A Completion Method to Decide Reachability in Rewrite Systems
The Knuth-Bendix method takes in argument a finite set of equations and rewrite rules and, when it succeeds, returns an algorithm to decide if a term is equivalent to another modulo these equations and rules. In this paper, we design a similar method that takes in argument a finite set of rewrite rules and, when it succeeds, returns an algorithm to decide not equivalence but reachability modulo these rules, that is if a term reduces to another. As an application, we give new proofs of the decidability of reachability in finite ground rewrite systems and in pushdown systems.
Unable to display preview. Download preview PDF.
- 2.Burel, G., Dowek, G., Jiang, Y.: Automata, resolution and cut-elimination (manuscript) (2015)Google Scholar
- 4.Dershowitz, N.: Completion and its applications. In: Aït-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, vol. 2, chapter 2, pp. 31–86. Academic Press (1989)Google Scholar
- 9.Hirokawa, N.: Commutation and signature extension. In: Tiwari, A., Aoto, T. (eds.) International Workshop on Confluence (2015)Google Scholar
- 12.Kamin, S., Lévy, J.-J.: Attempts for generalizing the recursive path ordering (unpublished manuscript)Google Scholar
- 13.Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263–297, Pergamon (1970)Google Scholar
- 14.Lankford, D.S.: Canonical inference. Technical report, Louisiana Tech. University (1975)Google Scholar