Theoretical Computer Science
System support for modular order-sorted horn clause specifications
ICSE '90 Proceedings of the 12th international conference on Software engineering
Proving termination with multiset orderings
Communications of the ACM
Proof Normalization for Resolution and Paramodulation
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
On Restrictions of Ordered Paramodulation with Simplification
Proceedings of the 10th International Conference on Automated Deduction
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
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
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation - Special issue on automatic programming
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
On Coherence Properties in Team Rewriting Models of Concurrency
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Hi-index | 0.00 |
The paper presents a new completion procedure for conditional equations. The work is based on the notion of reductive conditional rewriting and the procedure has been designed to handle in particular non-reductive equations that are generated during completion. The paper also describes techniques for simplification of conditional equations and rules, so that the procedure terminates on more specifications. The correctness proofs which form a substantial part of this paper employ recursive path orderings on the proof trees of conditional equational logic, an extension of the ideas of Bachmair, Dershowitz & Hsiang to the conditional case.