blob: 8e1661e28f7bf32dd917132ef661af4b22d56c0e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
/********************* */
/*! \file theory_bool.cpp
** \verbatim
** Original author: Morgan Deters
** Major contributors: Dejan Jovanovic
** Minor contributors (to current version): Clark Barrett
** This file is part of the CVC4 project.
** Copyright (c) 2009-2014 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief The theory of booleans.
**
** The theory of booleans.
**/
#include "theory/theory.h"
#include "theory/booleans/theory_bool.h"
#include "theory/booleans/circuit_propagator.h"
#include "theory/valuation.h"
#include "util/boolean_simplification.h"
#include "theory/substitutions.h"
#include <vector>
#include <stack>
#include "util/hash.h"
using namespace std;
namespace CVC4 {
namespace theory {
namespace booleans {
Theory::PPAssertStatus TheoryBool::ppAssert(TNode in, SubstitutionMap& outSubstitutions) {
if (in.getKind() == kind::CONST_BOOLEAN && !in.getConst<bool>()) {
// If we get a false literal, we're in conflict
return PP_ASSERT_STATUS_CONFLICT;
}
// Add the substitution from the variable to its value
if (in.getKind() == kind::NOT) {
if (in[0].getKind() == kind::VARIABLE) {
outSubstitutions.addSubstitution(in[0], NodeManager::currentNM()->mkConst<bool>(false));
} else {
return PP_ASSERT_STATUS_UNSOLVED;
}
} else {
if (in.getKind() == kind::VARIABLE) {
outSubstitutions.addSubstitution(in, NodeManager::currentNM()->mkConst<bool>(true));
} else {
return PP_ASSERT_STATUS_UNSOLVED;
}
}
return PP_ASSERT_STATUS_SOLVED;
}
}/* CVC4::theory::booleans namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
|
