Unification of infinite sets of terms schematized by primal grammars
Theoretical Computer Science
Increasing model building capabilities by constraint solving on terms with integer exponents
Journal of Symbolic Computation
The Unification of Infinite Sets of Terms and Its Applications
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Logic Programming with Recurrence Domains
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Primal Grammars and Unification Modulo a Binary Clause
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
On Finite Representations of Infinite Sequences of Terms
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Information and Computation
The first order theory of primal grammars is decidable
Theoretical Computer Science
Dei: A Theorem Prover for Terms with Integer Exponents
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Towards systematic analysis of theorem provers search spaces: first steps
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
I-terms in ordered resolution and superposition calculi: retrieving lost completeness
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Automatic generation of invariants for circular derivations in SUP(LA)
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We propose a new method for using recurrent schematizations in Theorem Proving. We provide techniques for detecting cycles in proofs (via proof generalization), and we show how to take advantage of the expressive power of schematizations in order to avoid generating such cycles explicitly. This may shorten proofs and avoid divergence in some cases. These techniques are more general than existing ones, and unlike them, they can be used with any kind of proof procedure (using tableaux-based approaches as well as resolution-based ones).