Sufficient-completeness, ground-reducibility and their complexity

SummaryThe sufficient-completeness property of equational algebraic specifications has been found useful in providing guidelines for designing abstract data type specifications as well as in proving inductive properties using the induction-less-induction method. The sufficient-completeness property is known to be undecidable in general. In an earlier paper, it was shown to be decidable for constructor-preserving, complete (canonical) term rewriting systems, even when there are relations among constructor symbols. In this paper, the complexity of the sufficient-completeness property is analyzed for different classes of term rewriting systems. A number of results about the complexity of the sufficient-completeness property for complete (canonical) term rewriting systems are proved: (i) The problem is co-NP-complete for term rewriting systems with free constructors (i.e., no relations among constructors are allowed), (ii) the problem remains co-NP-complete for term rewriting systems with unary and nullary constructors, even when there are relations among constructors, (iii) the problem is provably in “almost” exponential time for left-linear term rewriting systems with relations among constructors, and (iv) for left-linear complete constructor-preserving rewriting systems, the problem can be decided in steps exponential innlogn wheren is the size of the rewriting system. No better lower-bound for the complexity of the sufficient-completeness property for complete (canonical) term rewriting system with nonlinear left-hand sides is known. An algorithm for left-linear complete constructor-preserving rewriting systems is also discussed. Finally, the sufficient-completeness property is shown to be undecidable for non-linear complete term rewriting systems with associative functions. These complexity results also apply to the ground-reducibility property (also called inductive-reducibility) which is known to be directly related to the sufficient-completeness property.

[1]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[2]  Paliath Narendran,et al.  Complexity of Sufficient-Completeness , 1986, FSTTCS.

[3]  Deepak Kapur,et al.  Proof by Consistency , 1987, Artif. Intell..

[4]  Harry R. Lewis,et al.  Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..

[5]  David A. Plaisted,et al.  Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..

[6]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[7]  Jean-Jacques Thiel.  Stop losing sleep over incomplete data type specifications , 1984, POPL '84.

[8]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[9]  Emmanuel Kounalis,et al.  Completeness in Data Type Specifications , 1985, European Conference on Computer Algebra.

[10]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[11]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[12]  Jean-Pierre Jouannaud,et al.  Automatic Proofs by Induction in Theories without Constructors , 1989, Inf. Comput..

[13]  Kim Marriott,et al.  Explicit representation of terms defined by counter examples , 1986, Journal of Automated Reasoning.

[14]  Paliath Narendran,et al.  Proof by Induction Using Test Sets , 1986, CADE.

[15]  Tobias Nipkow,et al.  A decidability result about sufficient-completeness of axiomatically specified abstract data types , 1983, Theoretical Computer Science.

[16]  Nachum Dershowitz,et al.  Computing with Rewrite Systems , 1985, Inf. Control..

[17]  Joseph A. Goguen,et al.  How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

[18]  Harry B. Hunt,et al.  The Complexity of Monadic Recursion Schemes: Exponential Time Bounds , 1984, J. Comput. Syst. Sci..

[19]  Ronald V. Book,et al.  Confluent and Other Types of Thue Systems , 1982, JACM.

[20]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[21]  Paliath Narendran,et al.  On sufficient-completeness and related properties of term rewriting systems , 1987, Acta Informatica.

[22]  James J. Horning,et al.  The algebraic specification of abstract data types , 1978, Acta Informatica.

[23]  H. Comon.  Sufficient Completness, Term Rewriting Systems and Anti-Unification , 1986 .

[24]  David A. Plaisted.  Complete Problems in the First-Order Predicate Calculus , 1984, J. Comput. Syst. Sci..

[25]  John V. Guttag,et al.  The specification and application to programming of abstract data types. , 1975 .

[26]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[27]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[28]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[29]  Gérard P. Huet,et al.  Proofs by Induction in Equational Theories with Constructors , 1980, FOCS.