A completion procedure for conditional equationst
- 28 February 1991
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 11 (1-2) , 51-81
- https://doi.org/10.1016/s0747-7171(08)80132-0
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Ground term confluence in parametric conditional equational specificationsPublished by Springer Nature ,2006
- System support for modular order-sorted Horn clause specificationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Completion of first-order clauses with equality by strict superpositionPublished by Springer Nature ,1991
- On restrictions of ordered paramodulation with simplificationPublished by Springer Nature ,1990
- Proof normalization for resolution and paramodulationPublished by Springer Nature ,1989
- Completion with history-dependent complexities for generated equationsPublished by Springer Nature ,1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979