Artificial Intelligence
On word problems in equational theories
14th International Colloquium on Automata, languages and programming
Journal of Symbolic Computation
Critical pair criteria for completion
Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
Existence, uniqueness, and construction of rewrite systems
SIAM Journal on Computing
Automatic proofs by induction in theories without constructors
Information and Computation
Completion-time optimization of rewrite-time goal solving
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Computing ground reducibility and inductively complete positions
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Rewriting techniques for program synthesis
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Consider only general superpositions in completion procedures
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
A strong restriction of the inductive completion procedure
Journal of Symbolic Computation
Completion for rewriting modulo a congruence
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Automated proofs of the Moufang identities in alternatives rings
Journal of Automated Reasoning
CADE-10 Proceedings of the tenth international conference on Automated deduction
On restrictions of ordered paramodulation with simplification
CADE-10 Proceedings of the tenth international conference on Automated deduction
Satisfiability of systems of ordinal notations with the subterm property is decidable
Proceedings of the 18th international colloquium on Automata, languages and programming
A completion procedure for conditional equationst
Journal of Symbolic Computation
Automating inductionless induction using test sets
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
On proving inductive properties of abstract data types
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Rewrite Methods for Clausal and Non-Clausal Theorem Proving
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Confluence Criterion Based on the Generalised Neman Lemma
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
A critical-pair/completion algorithm for finitely generated ideals in rings
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
How to Prove Algebraic Inductive Hypotheses Without Induction
Proceedings of the 5th Conference on Automated Deduction
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation - Special issue on automatic programming
Declarative Representation of Algorithms of Completion by Critical Pairs
Cybernetics and Systems Analysis
Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic (TOCL)
On the Completeness of Arbitrary Selection Strategies for Paramodulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Normalization via Rewrite Closures
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Journal of Automated Reasoning
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
ACM Transactions on Computational Logic (TOCL)
Structures for Abstract Rewriting
Journal of Automated Reasoning
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Canonical Inference for Implicational Systems
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Confluence as a cut elimination property
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Termination tools in ordered completion
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
KBCV: knuth-bendix completion visualizer
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Paramodulation with Non-Monotonic Orderings and Simplification
Journal of Automated Reasoning
| Hi-index | 0.00 |
We describe the application of proof orderings—a technique for reasoning about inference systems-to various rewrite-based theorem-proving methods, including refinements of the standard Knuth-Bendix completion procedure based on critical pair criteria; Huet's procedure for rewriting modulo a congruence; ordered completion (a refutationally complete extension of standard completion); and a proof by consistency procedure for proving inductive theorems.