Completion of rewrite systems with membership constraints
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 392-403
- https://doi.org/10.1007/3-540-55719-9_91
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Equational formulas in order-sorted algebrasPublished by Springer Nature ,2005
- Higher-order critical pairsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Completion of rewrite systems with membership constraintsPublished by Springer Nature ,1992
- Basic superposition is completePublished by Springer Nature ,1992
- Rewrite SystemsPublished by Elsevier ,1990
- Schematization of infinite sets of rewrite rules generated by divergent completion processesTheoretical Computer Science, 1989
- Order-Sorted Equational ComputationPublished by Elsevier ,1989
- A unification algorithm for second-order monadic termsAnnals of Pure and Applied Logic, 1988
- Confluent term rewriting systems with membership conditionsPublished by Springer Nature ,1988
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985