99 search results - page 1 / 20 » Quantifier structure in search based procedures for QBFs |
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
IJCAI
2001
13 years 6 months ago
2001
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
CADE
2004
Springer
14 years 5 months ago
2004
Springer
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
MP
2002
13 years 4 months ago
2002
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
FSEN
2007
Springer
13 years 8 months ago
2007
Springer
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...