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
63
64
65
66
|
/********************* */
/*! \file boolean_simplification.cpp
** \verbatim
** Original author: mdeters
** Major contributors: none
** Minor contributors (to current version): none
** This file is part of the CVC4 prototype.
** Copyright (c) 2009-2012 New York University and The University of Iowa
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief Simple routines for Boolean simplification
**
** Simple, commonly-used routines for Boolean simplification.
**/
#include "util/boolean_simplification.h"
namespace CVC4 {
bool
BooleanSimplification::push_back_associative_commute_recursive
(Node n, std::vector<Node>& buffer, Kind k, Kind notK, bool negateNode)
throw(AssertionException) {
Node::iterator i = n.begin(), end = n.end();
for(; i != end; ++i){
Node child = *i;
if(child.getKind() == k){
if(! push_back_associative_commute_recursive(child, buffer, k, notK, negateNode)) {
return false;
}
}else if(child.getKind() == kind::NOT && child[0].getKind() == notK){
if(! push_back_associative_commute_recursive(child[0], buffer, notK, k, !negateNode)) {
return false;
}
}else{
if(negateNode){
if(child.isConst()) {
if((k == kind::AND && child.getConst<bool>()) ||
(k == kind::OR && !child.getConst<bool>())) {
buffer.clear();
buffer.push_back(negate(child));
return false;
}
} else {
buffer.push_back(negate(child));
}
}else{
if(child.isConst()) {
if((k == kind::OR && child.getConst<bool>()) ||
(k == kind::AND && !child.getConst<bool>())) {
buffer.clear();
buffer.push_back(child);
return false;
}
} else {
buffer.push_back(child);
}
}
}
}
return true;
}/* BooleanSimplification::push_back_associative_commute_recursive() */
}/* CVC4 namespace */
|
