Deciding Strong Sequentiality for orthogonal term rewriting systems is in Co-NP (1995)
by
Irène Durand
,
Universit'e De Bordeaux I
| Citations: | 3 - 0 self |
BibTeX
@MISC{Durand95decidingstrong,
author = {Irène Durand and Universit'e De Bordeaux I},
title = {Deciding Strong Sequentiality for orthogonal term rewriting systems is in Co-NP},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In [KM91], Klop and Middeldorp conjectured that deciding strong sequentiality for orthogonal term rewriting systems is NP-Complete. This problem appeared as "Problem 8" in the list of open problems in rewriting published in [DJK91]. In this article we show that the problem is in co-NP. If, as we conjecture, the problem is also in NP , this reduces its chances of being NP-Complete.
Citations
| 8882 | Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979 |
| 91 | Equations and rewrite rules: A survey - Huet, Oppen - 1980 |
| 20 | strongly sequential and forward-branching term rewriting systems - Bounded - 1994 |
| 20 | Call-by-need computations in nonambiguous linear term rewriting systems - Huet, Levy - 1979 |
| 20 | Programming with equations - Hoffmann, O'Donnell - 1982 |
| 19 | Open problems in rewriting - Dershowitz, Jouannaud, et al. - 1991 |
| 13 | second order monadic logic and tree automata - Sequentiality - 1995 |
| 13 | Computations in orthogonal rewriting systems, i and ii - Huet, Lévy - 1991 |
| 12 | Klop and Aart Middeldorp. Sequentiality in orthogonal term rewriting systems - Willem - 1991 |
| 10 | Compiling Equational Programs into Efficient Machine Code - Strandh - 1988 |
| 4 | Optimizing equational programs - Strandh - 1987 |
| 1 | Strong sequentiality of left linear term rewriting systems - Toyama - 1992 |
