A Model-Based Completeness Proof of Extended Narrowing and Resolution

Authors:
Jürgen Stuber
Affiliations:
-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 12
Cited 6

Basic paramodulation

Information and Computation
Paramodulation with built-in AC-theories and symbolic constraints

Journal of Symbolic Computation
Superposition theorem proving for abelian groups represented as integer modules

Theoretical Computer Science - Special issue on rewriting techniques and applications
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings

Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Proof Normalization Modulo

TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Replacement Rules with Definition Detection

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Canonical Forms and Unification

Proceedings of the 5th Conference on Automated Deduction
Theorem Proving with Ordering Constrained Clauses

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Associative-Commutative Deduction with Constraints

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Associative-Commutative Superposition

CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems

Theorem Proving Modulo

Journal of Automated Reasoning
Superposition with equivalence reasoning and delayed clause normal form transformation

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Superposition with equivalence reasoning and delayed clause normal form transformation

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Resolution is Cut-Free

Journal of Automated Reasoning
A semantic completeness proof for tamed

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Semantic cut elimination in the intuitionistic sequent calculus

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a proof of refutational completeness for Extended Narrowing And Resolution (ENAR), a calculus introduced by Dowek, Hardin and Kirchner in the context of Theorem Proving Modulo. ENAR integrates narrowing with respect to a set of rewrite rules on propositions into automated first-order theorem proving by resolution. Our proof allows to impose ordering restrictions on ENAR and provides general redundancy criteria, which are crucial for finding nontrivial proofs. On the other hand, it requires confluence and termination of the rewrite system, and in addition the existence of a well-founded ordering on propositions that is compatible with rewriting, compatible with ground inferences, total on ground clauses, and has some additional technical properties. Such orderings exist for hierarchical definitions of predicates. As an example we provide such an ordering for a fragment of set theory.