129
click to vote
LPAR
15 years 2 months 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 ...
LPAR
15 years 2 months 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. ...
LPAR
15 years 2 months ago
2004 Springer 
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
LPAR
15 years 2 months 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...
LPAR
15 years 2 months 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...
|
Automated Reasoning