summaryrefslogtreecommitdiff
path: root/src/util/propositional_query.h
diff options
context:
space:
mode:
authorMorgan Deters <mdeters@cs.nyu.edu>2013-01-31 14:29:58 -0500
committerMorgan Deters <mdeters@cs.nyu.edu>2013-03-19 19:09:27 -0400
commit7dd316a13b796d02985be63b1b03975a756fb624 (patch)
treeab348129940e25c4dde47c19568aea40d31a51ea /src/util/propositional_query.h
parent89a1304db9208a366c10136e8dee722f634015e9 (diff)
Remove PropositionalQuery class and all CUDD-related build stuff (and references)
Diffstat (limited to 'src/util/propositional_query.h')
-rw-r--r--src/util/propositional_query.h60
1 files changed, 0 insertions, 60 deletions
diff --git a/src/util/propositional_query.h b/src/util/propositional_query.h
deleted file mode 100644
index b1dc58cee..000000000
--- a/src/util/propositional_query.h
+++ /dev/null
@@ -1,60 +0,0 @@
-/********************* */
-/*! \file propositional_query.h
- ** \verbatim
- ** Original author: taking
- ** Major contributors: mdeters
- ** 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 A class for simple, quick, propositional
- ** satisfiability/validity checking
- **
- ** PropositionalQuery is a way for parts of CVC4 to do quick purely
- ** propositional satisfiability or validity checks on a Node. These
- ** checks do no theory reasoning, and handle atoms as propositional
- ** variables, but can sometimes be useful for subqueries.
- **/
-
-#include "cvc4_private.h"
-
-#ifndef __CVC4__PROPOSITIONAL_QUERY_H
-#define __CVC4__PROPOSITIONAL_QUERY_H
-
-#include "expr/node.h"
-#include "util/result.h"
-
-namespace CVC4 {
-
-/**
- * PropositionalQuery is a way for parts of CVC4 to do quick purely
- * propositional satisfiability or validity checks on a Node.
- */
-class PropositionalQuery {
-public:
-
- /**
- * Returns whether a node q is propositionally satisfiable.
- *
- * @param q Node to be checked for satisfiability.
- * @pre q is a ground formula.
- * @pre effort is between 0 and 1.
- */
- static Result isSatisfiable(TNode q);
-
- /**
- * Returns whether a node q is a propositional tautology.
- *
- * @param q Node to be checked for satisfiability.
- * @pre q is a ground formula.
- * @pre effort is between 0 and 1.
- */
- static Result isTautology(TNode q);
-
-};/* class PropositionalQuery */
-
-}/* CVC4 namespace */
-
-#endif /* __CVC4__PROPOSITIONAL_QUERY_H */
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback