Sufficient-completeness, ground-reducibility and their complexity
- 1 April 1991
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 28 (4) , 311-350
- https://doi.org/10.1007/bf01893885
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A decidability result about sufficient-completeness of axiomatically specified abstract data typesPublished by Springer Nature ,2006
- Sufficient completeness, term rewriting systems and ”anti-unification”Published by Springer Nature ,1986
- Complexity of sufficient-completenessPublished by Springer Nature ,1986
- Proof by induction using test setsPublished by Springer Nature ,1986
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- How to prove algebraic inductive hypotheses without inductionPublished by Springer Nature ,1980
- The algebraic specification of abstract data typesActa Informatica, 1978
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970