Unification in extensions of shallow equational theories
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Basic paramodulation and decidable theoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sequentiality, second order monadic logic and tree automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Solving a Unification Problem under Constrained Substitutions Using Tree AutomataJournal of Symbolic Computation, 1997
- SPASS - Version 0.49Journal of Automated Reasoning, 1997
- Decidable approximations of term rewriting systemsPublished by Springer Nature ,1996
- Basic ParamodulationInformation and Computation, 1995
- Theorem Proving with Ordering and Equality Constrained ClausesJournal of Symbolic Computation, 1995
- Syntacticness, Cycle-Syntacticness, and Shallow TheoriesInformation and Computation, 1994
- Equality and disequality constraints on direct subterms in tree automataPublished by Springer Nature ,1992
- Rewrite SystemsPublished by Elsevier ,1990