Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Artificial Intelligence
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Proofs and types
Existence, uniqueness, and construction of rewrite systems
SIAM Journal on Computing
Knuth-Bendix procedure and Buchberger algorithm: a synthesis
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Automatic demonstration: rewriting techniques (French)
Automatic demonstration: rewriting techniques (French)
Theoretical Computer Science
Theorem-proving with resolution and superposition
Journal of Symbolic Computation
Journal of the ACM (JACM)
Distributed automated deduction
Distributed automated deduction
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
Towards a foundation of completion procedures as semidecision procedures
Theoretical Computer Science
Term rewriting and all that
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equational Completion in Order-Sorted Algebras (Extended Abstract)
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract)
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
The Higher-Order Recursive Path Ordering
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Saturation-Based Inference
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Higher-order rewriting with dependent types (lambda calculus)
Higher-order rewriting with dependent types (lambda calculus)
Journal of Automated Reasoning
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Structures for Abstract Rewriting
Journal of Automated Reasoning
Cut Elimination in Deduction Modulo by Abstract Completion
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Abstract critical pairs and confluence of arbitrary binary relations
RTA'07 Proceedings of the 18th international conference on Term rewriting 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
Boolean rings for intersection-based satisfiability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Unbounded proof-length speed-up in deduction modulo
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
Solving goals--like proving properties, deciding word problems or resolving constraints--is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems.We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.