The first-order theory of ordering constraints over feature trees

The system FT/sub /spl les// of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT/sub /spl les// and its fragments, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT/sub /spl les// is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We determine the complexity of the entailment problem of FT/sub /spl les// with existential quantification to be PSPACE-complete, by proving its equivalence to the inclusion problem of non-deterministic finite automata. Our reduction from the entailment problem to the inclusion problem is based on a new algorithm that, given an existential formula of FT/sub /spl les//, computes a finite automaton which accepts all its logic consequences.

[1]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[2]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[3]  Philip Wadler,et al.  A practical subtyping system for Erlang , 1997, ICFP '97.

[4]  Hubert Comon-Lundh.  Sequentiality, Second Order Monadic Logic and Tree Automata , 1995, LICS.

[5]  Gert Smolka,et al.  A Feature Constraint System for Logic Programming with Entailment , 1994, Theor. Comput. Sci..

[6]  Jens Palsberg.  Efficient Inference of Object Types , 1995, Inf. Comput..

[7]  N. Curteanu.  Book Reviews: Lecture on Contemporary Syntactic Theories: An Introduction to Unification-Based Approaches to Grammar , 1987, CL.

[8]  Robert T. Kasper,et al.  A Logical Semantics for Feature Structures , 1986, ACL.

[9]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[10]  Rolf Backofen.  Expressivity and decidability of first-order languages over feature trees , 1994 .

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Rolf Backofen.  A Complete Axiomatization of a Theory with Feature and Arity Constraints , 1995, J. Log. Program..

[13]  Scott F. Smith,et al.  Subtyping Constrained Types , 1996, SAS.

[14]  Jochen Dörre,et al.  On subsumption and semiunification in feature algebras , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[15]  Bob Carpenter,et al.  The logic of typed feature structures , 1992 .

[16]  Andreas Podelski,et al.  Towards a Meaning of LIFE , 1991, J. Log. Program..

[17]  Ivan A. Sag,et al.  Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.

[18]  Kaniaki Mukai.  Partially Specified Term in Logic Programming for Linguistic Analysis , 1988, FGCS.

[19]  Gert Smolka,et al.  A Complete and Recursive Feature Theory , 1994, ACL.

[20]  Gert Smolka,et al.  A Feature-Based Constraint System for Logic Programming with Entailment , 1992, FGCS.

[21]  Bernhard Nebel,et al.  Representation and Reasoning with Attributive Descriptions , 1990, Sorts and Types in Artificial Intelligence.

[22]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[23]  Helmut Seidl.  Deciding Equivalence of Finite Tree Automata , 1990, SIAM J. Comput..

[24]  Alain Colmerauer,et al.  Equations and Inequations on Finite and Infinite Trees , 1984, FGCS.

[25]  Gert Smolka.  The Oz Programming Model , 1996 .

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  Jochen Dörre,et al.  Feature Logic with Weak Subsumption Constraints , 1991, ACL.

[28]  William C. Rounds,et al.  Feature Logics , 1997, Handbook of Logic and Language.

[29]  François Pottier,et al.  Simplifying subtyping constraints , 1996, ICFP '96.

[30]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[31]  Fritz Henglein,et al.  Constraint Automata and the Complexity of Recursive Subtype Entailment , 1998, ICALP.

[32]  H. B. Allen,et al.  A Functional Grammar , 1946 .

[33]  Hassan Aït-Kaci,et al.  LOGIN: A Logic Programming Language with Built-In Inheritance , 1986, J. Log. Program..

[34]  Fernando Pereira,et al.  The Formalism and Implementation of PATR-II , 1983 .

[35]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

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

[38]  Sergei G. Vorobyov.  An Improved Lower Bound for the Elementary Theories of Trees , 1996, CADE.

[39]  Michael J. Maher.  Logic Semantics for a Class of Committed-Choice Programs , 1987, ICLP.

[40]  Stephan Merz,et al.  Type checking higher-order polymorphic multi-methods , 1997, POPL '97.

[41]  Martin Ludwig Müller,et al.  Set based failure diagnosis for concurrent constraint programming , 1998 .

[42]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[43]  Ralf Treinen,et al.  A New Method for Undecidability Proofs of First Order Theories , 1990, FSTTCS.

[44]  Ralf Treinen,et al.  Feature Trees over Arbitrary Structures , 1997, UNIF.

[45]  Peter Van Roy,et al.  Integrating Efficient Records into Concurrent Constraint Programming , 1996, PLILP.

[46]  Gert Smolka,et al.  Records for Logic Programming , 1994, J. Log. Program..

[47]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[48]  Hassan Aït-Kaci,et al.  An Algebraic Semantics Approach to the Effective Resolution of Type Equations , 1986, Theor. Comput. Sci..

[49]  Joachim Niehren,et al.  Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic , 2000, Inf. Comput..

[50]  Gert Smolka,et al.  Feature-Constraint Logics for Unification Grammars , 1989, J. Log. Program..

[51]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[52]  Fritz Henglein,et al.  The complexity of subtype entailment for simple types , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[53]  Hubert Comon,et al.  Sequentiality, second order monadic logic and tree automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.