CADE
2001
Springer
14 years 4 months ago
2001
Springer
CADE
2001
Springer
14 years 5 months ago
2001
Springer
CADE
2001
Springer
14 years 5 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
CADE
2001
Springer
15 years 22 days ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
CADE
2001
Springer
15 years 22 days ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
CADE
2001
Springer
15 years 22 days ago
2001
Springer
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...
CADE
2001
Springer
15 years 22 days ago
2001
Springer
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
CADE
2001
Springer
15 years 22 days ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
CADE
2001
Springer
15 years 22 days ago
2001
Springer
CADE
2001
Springer
15 years 22 days ago
2001
Springer