Ground reducibility and automata with disequality constraints
Authors:
- 1 January 1994
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 149-162
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Encompassment properties and automata with constraints1993
- Testing for the ground (co-)reducibility property in term-rewriting systemsTheoretical Computer Science, 1992
- Sufficient-completeness, ground-reducibility and their complexityActa Informatica, 1991
- Automata on Infinite Objects1990
- Automatic proofs by induction in theories without constructorsInformation and Computation, 1989
- Computing ground reducibility and inductively complete positionsLecture Notes in Computer Science, 1989
- On sufficient-completeness and related properties of term rewriting systemsActa Informatica, 1987
- Semantic confluence tests and completion methodsInformation and Control, 1985
- Completeness in data type specificationsLecture Notes in Computer Science, 1985
- Decidable Theories1977