Ordering constraints over feature trees expressed in second-order monadic logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1379, Issue , 1998, Pages 196-210

  Müller, Martin ^a   Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Complexity; Decidability; Entailment; Feature logic; Second order monadic logic; Tree orderings

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FORESTRY; FORMAL LOGIC; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

COMPLEXITY; ENTAILMENT; FEATURE LOGIC; MONADIC LOGIC; TREE ORDERINGS;

COMPUTER CIRCUITS;

EID: 0041901338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052371     Document Type: Conference Paper

References (26)

1. H. Aït-Kaci and A. Podelski. Towards a Meaning of Life. The Journal of Logic Programming, 16(3 and 4):195-234, July, Aug. 1993.
2. H. Aït-Kaci, A. Podelski, and G. Smolka. A Feature-based Constraint System for Logic Programming with Entailment. Theoretical Computer Science, 122(1-2):263-283, 1994.
3. R. Backofen. A Complete Axiomatization of a Theory with Feature and Arity Constraints. The Journal of Logic Programming, 1995. Special Issue on Computational Linguistics and Logic Programming.
4. R. Backofen and G. Smolka. A Complete and Recursive Feature Theory. Theoretical Computer Science, 146(1-2):243-268, July 1995.
5. H. Comon. Sequentiaiity, second-order monadic logic and tree automata. In K. Dexter, editor, Proceedings of the Logic in Computer Science Conference, pages 508-517, 1995.
6. S. A. Cook. The Complexity of Theorem-Proving Procedures. In Annual ACM Symposium on Theory of Computing, pages 151-158, New York, 1971. ACM.
7. J. Dörre. Feature logics with weak subsumption constraints. In Annual Meeting of the ACL (Association of Computational Logics), pages 256-263, 1991.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
9. E Henglein and J. Rehof. The Complexity of Subtype Entailment for Simple Types. In 12 th IEEE Symposium on Logic in Computer Science, Warsaw, Poland, 1997.
10. J. D. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979.
11. R. M. Kaplan and J. Bresnan. Lexical-Functional Grammar: A Formal System for Grammatical Representation. pages 173-381. The MIT Press, Cambridge, MA, 1982.
12. M. Kay. Functional Grammar. In C. Chiarello et al., editor, Proc. of the 5 th Annual Meeting of the Berkeley Linguistics Society, pages 142-158, 1979.
13. M. MtUler. Ordering Constraints over Feature Trees with Ordered Sorts. In P. Lopez, S. Manandhar, and W. Nutt, editors, Computational Logic and Natural Language Understanding, Lecture Notes in Artificial Intelligence, to appear, 1997.
14. M. Müler and J. Niehren. Entailment for Set Constraints is not Feasible. Technical report, Programming Systems Lab, Universitüt des Saarlandes, 1997. http://www.ps.uni-sb.de/Papers/abstracts/inesInfeas.html
15. M. Müler and J. Niehren. Ordering Constraints over Feature Trees Expressed in Secondorder Monadic Logic. Full version available at http: //www.ps.uni-sb.de/Papers/abstracts/SWS97.html 1997.
16. M. Müller, J. Niehren, and R. Treinen. The First-order Theory of Ordering Constraints over Feature Trees. SubmiRed. http://www.ps.uni-sb.de/Papers/abstracts/FTSubTheory-98.html. 1997.
17. M. MOiler, J. Niehren, and A. Podelski. Ordering Constraints over Feature Trees. In 3 rd Int. Conf. on Principles and Practice of Constraint Programming, vol 1330 of LNCS, 1997.
18. C. Pollard and I. Sag. Head-Driven Phrase Structure Grammar. Studies in Contemporary Linguistics. Cambridge University Press, Cambridge, England, 1994.
19. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
20. W. C. Rounds. Feature Logics. In J. v. Benthem and A. ter Meulen, editors, Handbook of Logic and Language. Elsevier Science Publishers B.V. (North Holland), 1997.
21. H. Seidl. Deciding Equivalence of Finite Tree Automata. SIAM Journal of Computing, 19(3):424-437, June 1990.
22. S. Shieber. An Introduction to Unification-based Approaches to Grammar. CSLI Lecture Notes No. 4. Center for the Study of Language and Information, 1986.
23. G. Smolka. The Oz Programming Model. In J. van Leeuwen, editor, Computer Science Today, LNCS, vol. 1000, pages 324-343. Springer-Verlag, Berlin, Germany, 1995.
24. G. Smolka and R. Treinen. Records for Logic Programming. The Journal of Logic Programming, 18(3):229-258, Apr. 1994.
25. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1967.
26. S. Vorobyov. An improved lower bound for the elementary theories of trees. In lnternat. Conf. on Automated Deduction, vol. 1104 of LNCS, 275-287, 1996.