241
click to vote
LPAR
16 years 8 days ago
2004 Springer 
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
205
click to vote
LPAR
16 years 8 days ago
2004 Springer 
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
201
click to vote
LPAR
16 years 8 days ago
2004 Springer 
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
193
click to vote
LPAR
16 years 8 days ago
2004 Springer 
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
190
click to vote
LPAR
16 years 8 days ago
2004 Springer 
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
|
Automated Reasoning