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 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
|
/********************* */
/*! \file boolean_simplification.h
** \verbatim
** Top contributors (to current version):
** Morgan Deters, Tim King, Mathias Preiner
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. 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 "cvc4_private.h"
#ifndef CVC4__BOOLEAN_SIMPLIFICATION_H
#define CVC4__BOOLEAN_SIMPLIFICATION_H
#include <vector>
#include <algorithm>
#include "base/check.h"
#include "expr/expr_manager_scope.h"
#include "expr/node.h"
namespace CVC4 {
/**
* A class to contain a number of useful functions for simple
* simplification of nodes. One never uses it as an object (and
* it cannot be constructed). It is used as a namespace.
*/
class BooleanSimplification {
// cannot construct one of these
BooleanSimplification() = delete;
BooleanSimplification(const BooleanSimplification&) = delete;
static bool push_back_associative_commute_recursive(
Node n, std::vector<Node>& buffer, Kind k, Kind notK, bool negateNode)
CVC4_WARN_UNUSED_RESULT;
public:
/**
* The threshold for removing duplicates. (See removeDuplicates().)
*/
static const uint32_t DUPLICATE_REMOVAL_THRESHOLD = 10;
/**
* Remove duplicate nodes from a vector, modifying it in-place.
* If the vector has size >= DUPLICATE_REMOVAL_THRESHOLD, this
* function is a no-op.
*/
static void removeDuplicates(std::vector<Node>& buffer)
{
if(buffer.size() < DUPLICATE_REMOVAL_THRESHOLD) {
std::sort(buffer.begin(), buffer.end());
std::vector<Node>::iterator new_end =
std::unique(buffer.begin(), buffer.end());
buffer.erase(new_end, buffer.end());
}
}
/**
* Takes a node with kind AND, collapses all AND and (NOT OR)-kinded
* children of it (as far as possible---see
* push_back_associative_commute()), removes duplicates, and returns
* the resulting Node.
*/
static Node simplifyConflict(Node andNode)
{
AssertArgument(!andNode.isNull(), andNode);
AssertArgument(andNode.getKind() == kind::AND, andNode);
std::vector<Node> buffer;
push_back_associative_commute(andNode, buffer, kind::AND, kind::OR);
removeDuplicates(buffer);
if(buffer.size() == 1) {
return buffer[0];
}
NodeBuilder<> nb(kind::AND);
nb.append(buffer);
return nb;
}
/**
* Takes a node with kind OR, collapses all OR and (NOT AND)-kinded
* children of it (as far as possible---see
* push_back_associative_commute()), removes duplicates, and returns
* the resulting Node.
*/
static Node simplifyClause(Node orNode)
{
AssertArgument(!orNode.isNull(), orNode);
AssertArgument(orNode.getKind() == kind::OR, orNode);
std::vector<Node> buffer;
push_back_associative_commute(orNode, buffer, kind::OR, kind::AND);
removeDuplicates(buffer);
Assert(buffer.size() > 0);
if(buffer.size() == 1) {
return buffer[0];
}
NodeBuilder<> nb(kind::OR);
nb.append(buffer);
return nb;
}
/**
* Takes a node with kind IMPLIES, converts it to an OR, then
* simplifies the result with simplifyClause().
*
* The input doesn't actually have to be Horn, it seems, but that's
* the common case(?), hence the name.
*/
static Node simplifyHornClause(Node implication)
{
AssertArgument(implication.getKind() == kind::IMPLIES, implication);
TNode left = implication[0];
TNode right = implication[1];
Node notLeft = negate(left);
Node clause = NodeBuilder<2>(kind::OR) << notLeft << right;
return simplifyClause(clause);
}
/**
* Aids in reforming a node. Takes a node of (N-ary) kind k and
* copies its children into an output vector, collapsing its k-kinded
* children into it. Also collapses negations of notK. For example:
*
* push_back_associative_commute( [OR [OR a b] [OR b c d] [NOT [AND e f]]],
* buffer, kind::OR, kind::AND )
* yields a "buffer" vector of [a b b c d e f]
*
* @param n the node to operate upon
* @param buffer the output vector (must be empty on entry)
* @param k the kind to collapse (should equal the kind of node n)
* @param notK the "negation" of kind k (e.g. OR's negation is AND),
* or kind::UNDEFINED_KIND if none.
* @param negateChildren true if the children of the resulting node
* (that is, the elements in buffer) should all be negated; you want
* this if e.g. you're simplifying the (OR...) in (NOT (OR...)),
* intending to make the result an AND.
*/
static inline void push_back_associative_commute(Node n,
std::vector<Node>& buffer,
Kind k,
Kind notK,
bool negateChildren = false)
{
AssertArgument(buffer.empty(), buffer);
AssertArgument(!n.isNull(), n);
AssertArgument(k != kind::UNDEFINED_KIND && k != kind::NULL_EXPR, k);
AssertArgument(notK != kind::NULL_EXPR, notK);
AssertArgument(n.getKind() == k, n,
"expected node to have kind %s", kindToString(k).c_str());
bool b CVC4_UNUSED =
push_back_associative_commute_recursive(n, buffer, k, notK, false);
if(buffer.size() == 0) {
// all the TRUEs for an AND (resp FALSEs for an OR) were simplified away
buffer.push_back(NodeManager::currentNM()->mkConst(k == kind::AND ? true : false));
}
}/* push_back_associative_commute() */
/**
* Negates a node, doing all the double-negation elimination
* that's possible.
*
* @param n the node to negate (cannot be the null node)
*/
static Node negate(TNode n)
{
AssertArgument(!n.isNull(), n);
bool polarity = true;
TNode base = n;
while(base.getKind() == kind::NOT){
base = base[0];
polarity = !polarity;
}
if(n.isConst()) {
return NodeManager::currentNM()->mkConst(!n.getConst<bool>());
}
if(polarity){
return base.notNode();
}else{
return base;
}
}
/**
* Negates an Expr, doing all the double-negation elimination that's
* possible.
*
* @param e the Expr to negate (cannot be the null Expr)
*/
static Expr negate(Expr e)
{
ExprManagerScope ems(e);
return negate(Node::fromExpr(e)).toExpr();
}
/**
* Simplify an OR, AND, or IMPLIES. This function is the identity
* for all other kinds.
*/
inline static Node simplify(TNode n)
{
switch(n.getKind()) {
case kind::AND:
return simplifyConflict(n);
case kind::OR:
return simplifyClause(n);
case kind::IMPLIES:
return simplifyHornClause(n);
default:
return n;
}
}
};/* class BooleanSimplification */
}/* CVC4 namespace */
#endif /* CVC4__BOOLEAN_SIMPLIFICATION_H */
|