summaryrefslogtreecommitdiff
path: root/src/prop/cnf_stream.h
diff options
context:
space:
mode:
authorClark Barrett <barrett@cs.nyu.edu>2011-07-11 19:53:44 +0000
committerClark Barrett <barrett@cs.nyu.edu>2011-07-11 19:53:44 +0000
commitf65c5c4cbc59527dc0c9c57283a373ef501792c5 (patch)
tree4a5b270413a72260d404c431a27c2f01209fae21 /src/prop/cnf_stream.h
parent7515ee9cda0925721c4fa7e1ba9ef3b25dc5e0d0 (diff)
Clark's work on array theory - can now solve all QF_AX problems
Diffstat (limited to 'src/prop/cnf_stream.h')
-rw-r--r--src/prop/cnf_stream.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/prop/cnf_stream.h b/src/prop/cnf_stream.h
index ef75e635b..e53b46d9b 100644
--- a/src/prop/cnf_stream.h
+++ b/src/prop/cnf_stream.h
@@ -147,14 +147,6 @@ protected:
bool isTranslated(TNode node) const;
/**
- * Returns true if the node has an assigned literal (it might not be translated).
- * Caches the pair of the node and the literal corresponding to the
- * translation.
- * @param node the node
- */
- bool hasLiteral(TNode node) const;
-
- /**
* Acquires a new variable from the SAT solver to represent the node
* and inserts the necessary data it into the mapping tables.
* @param node a formula
@@ -208,6 +200,14 @@ public:
TNode getNode(const SatLiteral& literal);
/**
+ * Returns true if the node has an assigned literal (it might not be translated).
+ * Caches the pair of the node and the literal corresponding to the
+ * translation.
+ * @param node the node
+ */
+ bool hasLiteral(TNode node) const;
+
+ /**
* Returns the literal that represents the given node in the SAT CNF
* representation.
* @param node [Presumably there are some constraints on the kind of
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback