Decidability and complexity of simultaneous rigid E-unification with one variable and related results

We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the For All*There Exists For All* f ...

[1]  Max Dauchet,et al.  Rewriting and Tree Automata , 1993, Term Rewriting.

[2]  Andrei Voronkov.  Herbrand's theorem, automated reasoning and semantic tableaux , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[3]  Helmut Seidl,et al.  Haskell Overloading is DEXPTIME-Complete , 1994, Inf. Process. Lett..

[4]  Robert E. Shostak,et al.  An algorithm for reasoning about equality , 1977, CACM.

[5]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Margus Veanes.  The relation between second-order unification and simultaneous rigid E-unification , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[7]  Andrei Voronkov.  Simultaneous Rigid E-unification and other Decision Problems Related to the Herbrand Theorem , 1999, Theor. Comput. Sci..

[8]  David A. Plaisted,et al.  Special Cases and Substitutes for Rigid E-Unification , 2000, Applicable Algebra in Engineering, Communication and Computing.

[9]  M. Veanes.  On Computational Complexity of Basic Decision Problems of Finite Tree Automata , 1997 .

[10]  UppsalaUSA Swedengurevich.  Some Undecidable Problems Related to the Herbrand Theorem , 1997 .

[11]  Wolfgang Bibel,et al.  Deduction - automated logic , 1993 .

[12]  Sophie Tison,et al.  Decidability of the Confluence of Ground Term Rewriting Systems , 1985, LICS.

[13]  B. Courcelle.  On Recognizable Sets and Tree Automata , 1989 .

[14]  Dexter Kozen,et al.  Complexity of finitely presented algebras , 1977, STOC '77.

[15]  Andrei Voronkov.  Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction , 1996, TABLEAUX.

[16]  Andrei Voronkov,et al.  Decidability problems for the prenex fragment of intuitionistic logic , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[17]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[18]  G. E. Mints.  Choice of Terms in Quantifier Rules of Constructive Predicate Calculus , 1969 .

[19]  Eric Kogel.  Rigid E-Unification Simplified , 1995, TABLEAUX.

[20]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[21]  H. James Hoover,et al.  Limits to Parallel Computation: P-Completeness Theory , 1995 .

[22]  R. Statman.  Lower bounds on Herbrand’s theorem , 1979 .

[23]  V. A. Lifshits.  PROBLEM OF DECIDABILITY FOR SOME CONSTRUCTIVE THEORIES OF EQUALITIES , 1969 .

[24]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems , 1994, Theor. Comput. Sci..

[25]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[26]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[27]  Wayne Snyder,et al.  Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E , 1989, RTA.

[28]  Andrei Voronkov,et al.  Herbrand's Theorem and Equational Reasoning: Problems and Solutions , 1996, Bull. EATCS.

[29]  Andrei Voronkov,et al.  Simultaneous rigid E-unification and related algorithmic problems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[30]  Paliath Narendran,et al.  Rigid E-Unification: NP-Completeness and Applications to Equational Matings , 1990, Inf. Comput..

[31]  Peter Baumgartner,et al.  Theorem Proving with Analytic Tableaux and Related Methods , 1996, Lecture Notes in Computer Science.

[32]  Paliath Narendran,et al.  Rigid E-unification is NP-complete , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[33]  Andrei Voronkov,et al.  Monadic Simultaneous Rigid E-Unification and Related Problems , 1997, ICALP.

[34]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

[35]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[36]  Andrei Voronkov.  Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification , 1996, CADE.

[37]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[38]  Andrei Voronkov,et al.  Simultaneous Regid E-Unification Is Undecidable , 1995, CSL.

[39]  J. Goubault.  Rigid E/spl I.oarr/-unifiability is DEXPTIME-complete , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[40]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[41]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[42]  Wayne Snyder,et al.  Theorem Proving Using Rigid E-Unification Equational Matings , 1987, LICS.

[43]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[44]  Andrei Voronkov,et al.  The Undecidability of Simultaneous Rigid E-Unification , 1996, Theor. Comput. Sci..

[45]  Dexter Kozen.  Communication: Positive First-Order Logic is NP-Complete , 1981, IBM J. Res. Dev..

[46]  KozenDexter.  Positive first-order logic is NP-complete , 1981 .

[47]  Margus Veanes,et al.  The Undecidability of Simultaneous Rigid E-Unification with Two Variables , 1997, Kurt Gödel Colloquium.

[48]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[49]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[50]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[51]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..