30 search results - page 1 / 6 » Extensions of Constraint Solving for Proof Planning |
ECAI
2000
Springer
13 years 9 months ago
2000
Springer
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
LICS
2003
IEEE
13 years 9 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
AIPS
2007
13 years 6 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
AAAI
1997
13 years 5 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...