Abstract:
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, it has been used almost exclusively for propositional logic so far because of its highly inefficient treatment of quantifiers, based on instantiation into ground formulas. The recent FDPLL calculus by Baumgartner was the first successful attempt to lift the procedure to the first-order level without resorting to ground instantiations. FDPLL lifts to the first-order case the core of the DPLL procedure, the splitting rule, but ignores other aspects of the procedure that, although not necessary for completeness, are crucial for its effectiveness in practice. In this paper, we present a new calculus loosely based on FDPLL that lifts these aspects as well. In addition to being a more faithful litfing of the DPLL procedure, the new calculus contains a more systematic treatment of universal literals, one of FDPLL's optimizations, and so has the potential of leading to much faster implementations.
Citations
|
722
|
Chaff: Engineering an efficient SAT solver
– Moskewicz, Madigan, et al.
- 2001
|
|
243
|
3.0 Reference Manual and Guide
– McCune, OTTER
|
|
149
|
GXL: Towards a Standard Exchange Format. 10/99 Jürgen Ebert, Luuk Groenewegen, Roger Süttenbach. A Formalization of SOCCA
– Holt, Winter, et al.
|
|
90
|
Automating first-order relational logic
– Jackson
- 2000
|
|
62
|
Relating Defeasible and Normal Logic Programming through Transformation Properties
– Chesñevar, Dix, et al.
|
|
61
|
Controlled integration of the cut rule into connection tableau calculi
– Letz, Mayr, et al.
- 1994
|
|
60
|
Exchanging Graphs with GXL
– Winter
|
|
55
|
Towards a Logical Approach for Soccer Agents Engineering
– Murray, Obst, et al.
|
|
50
|
The Taming of the (X)OR
– Baumgartner, Massacci
|
|
49
|
Folding: An Approach to Enable Program Understanding of Preprocessed Languages
– Kullbach, Riediger
|
|
44
|
Modelling a concurrent ray-tracing algorithm using object-oriented Petri-Nets
– Hutten, Philippi
|
|
43
|
Applying GUPRO to GEOS – A Case Study
– Lange, Sneed, et al.
|
|
43
|
Specification of Symbols and Implementation of Their Constraints in JKogge
– Uhe, Rosendahl
|
|
42
|
Qualitative Velocity and Ball Interception
– Stolzenburg, Obst, et al.
|
|
42
|
Furbach. Automated Deduction Techniques for the Management of Personalized Documents
– Baumgartner, Ulrich
|
|
42
|
Specifying Rational Agents with Statecharts and Utility Functions
– Obst
|
|
40
|
From the Specification of Multiagent Systems by Statecharts to their Formal Analysis by Model Checking
– Stolzenburg
|
|
38
|
Slicing Book Technology — eine neue Technik für eine neue Lehre
– Valerius, Simon
|
|
37
|
Eliminating Duplicates with the HyperLinking Strategy
– Lee, Plaisted
- 1992
|
|
37
|
Specifying Agents with UML
– Murray
|
|
36
|
Frieder Stolzenburg. Multiagent Systems Specification by UML Statecharts Aiming at Intelligent Manufacturing
– Arai
|
|
35
|
User Requirements – Lessons Learned from a Computer Science Course
– Simon, Valerius
|
|
35
|
A First-Order Logic Davis-Putnam-Logemann-Loveland Procedure
– Baumgartner
|
|
34
|
Towards a Common Query Language for Reverse Engineering
– Holt, Winter, et al.
|
|
33
|
An efficient algorithm for unit propagation
– Zhang, Stickel
|
|
33
|
Conceptual Modelling and Web Site Generation using Graph Technology
– Gipp, Ebert
|
|
32
|
Deciding separation formulas with SAT
– Strichman, Seshia, et al.
- 2002
|
|
31
|
Logical Reasoning and Petri Nets
– Lautenbach
|
|
21
|
A DPLL-based calculus for ground satisfiability modulo theories
– Tinelli
- 2002
|
|
19
|
Denali: a goal-directed superoptimizer
– Joshi, Nelson, et al.
- 2001
|
|
14
|
Concept based querying of semistructured data
– Gro-Hardt
|
|
7
|
Pruning the search space and extracting more models in tableaux
– Peltier
- 1999
|
|
4
|
Constrained hyper tableaux
– Eijck
- 2001
|
|
4
|
Fahrassistenzsystem zur Untersttzung beim Rckwrtsfahren mit einachsigen Gespannen
– Binder, Diebold, et al.
|
|
3
|
Partial Instantiation Methods for Inference in First Order Logic
– Hooker, Rago, et al.
- 1996
|
