Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Information and Computation
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Design Proof Assistant (Abstract)
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
A Model-Based Completeness Proof of Extended Narrowing and Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Associative-Commutative Superposition
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
The design and implementation of VAMPIRE
AI Communications - CASC
Hi-index | 0.00 |
This paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system.