summaryrefslogtreecommitdiff
path: root/src/util/propositional_query.h
diff options
context:
space:
mode:
authorMorgan Deters <mdeters@gmail.com>2011-05-23 23:15:25 +0000
committerMorgan Deters <mdeters@gmail.com>2011-05-23 23:15:25 +0000
commit5707fbf2af8c3a941ce3249cf0cb3190a5b069e4 (patch)
tree084d0868ffcf319c8a92b3e4e65080a1709ce61d /src/util/propositional_query.h
parent3f7f9df5f0c419b7f7dd39e32852161f406a441f (diff)
fixes for "make dist" and "make doc", minor cleanups
Diffstat (limited to 'src/util/propositional_query.h')
-rw-r--r--src/util/propositional_query.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/util/propositional_query.h b/src/util/propositional_query.h
index f520f142d..2d269e801 100644
--- a/src/util/propositional_query.h
+++ b/src/util/propositional_query.h
@@ -40,22 +40,22 @@ public:
/**
* Returns whether a node q is propositionally satisfiable.
*
- * @params q Node to be checked for satisfiability.
- * @params e A number representing the effort to use between 0 (minimum effort),
+ * @param q Node to be checked for satisfiability.
+ * @param e A number representing the effort to use between 0 (minimum effort),
* and 1 (maximum effort).
- * @precondition q is a ground formula.
- * @precondition effort is between 0 and 1.
+ * @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.
*
- * @params q Node to be checked for satisfiability.
- * @params e A number representing the effort to use between 0 (minimum effort),
+ * @param q Node to be checked for satisfiability.
+ * @param e A number representing the effort to use between 0 (minimum effort),
* and 1 (maximum effort).
- * @precondition q is a ground formula.
- * @precondition effort is between 0 and 1.
+ * @pre q is a ground formula.
+ * @pre effort is between 0 and 1.
*/
static Result isTautology(TNode q);
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback