The first-order theory of ordering constraints over feature trees

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 432-443

  Muller, Martin ^a   Niehren, Joachim ^a   Treinen, Ralf ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

EQUALITY CONSTRAINTS; EXISTENTIAL FORMULA; EXISTENTIAL QUANTIFICATIONS; FIRST ORDER THEORIES; INCLUSION PROBLEM; NONDETERMINISTIC FINITE AUTOMATON; ORDERING CONSTRAINTS; PSPACE-COMPLETE;

COMPUTER CIRCUITS;

EID: 85014867463     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705677     Document Type: Conference Paper

References (34)

1. H. Aït-Kaci, A. Podelski, G. Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263-283, 1994.
2. R. Backofen. A complete axiomatization of a theory with feature and arity constraints. J. of Logic Programming, 24(1&2):37-71, 1995.
3. R. Backofen, G. Smolka. A complete and recursive feature theory. Theoretical Computer Science, 146(1-2):243-268, 1995.
4. F. Bourdoncle, S. Merz. Type checking higher-order polymorphic multi-methods. In 24th ACM Symposium on Principles of Programming Languages, 302-315, Paris, France, Jan. 1997. ACM Press, New York.
5. B. Carpenter. The Logic of Typed Feature Structures - with Applications to Unification Grammars, Logic Programs and Constraint Resolution. No. 32 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
6. J. Dörre. Feature logics with weak subsumption constraints. In Annual Meeting of the Association of Computational Linguistics, 256-263, 1991.
7. J. Dörre, W. C. Rounds. On subsumption and semiunification in feature algebras. In 5th LICS, 300-310, 1990.
8. M. R. Garey, D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
9. F. Henglein, J. Rehof. The complexity of subtype entailment for simple types. In 12th LICS, Warsaw, Poland, 1997. IEEE Computer Society Press.
10. F. Henglein, J. Rehof. Constraint automata and the complexity of recursive subtype entailment. In K. Larsen (ed.), 25th Internat. Conf. on Automata, Languages, and Programming, LNCS, Aalborg, Denmark, 1998. Springer- Verlag, Berlin, Germany. to appear.
11. R. M. Kaplan, J. Bresnan. Lexical-functional grammar: A formal system for grammatical representation. In J. Bresnan (ed.), The Mental Representation of Grammatical Relations, 173-281. The MIT Press, 1982.
12. R. T. Kasper, W. C. Rounds. A logical semantics for feature structures. In Annual Meeting of the Association of Computational Linguistics, 257-265, 1986.
13. M. J. Maher. Logic semantics for a class of committedchoice programs. In J.-L. Lassez (ed.), Internat. Conf. on Logic Programming, 858-876. The MIT Press, 1987.
14. S. Marlow, P. Wadler. A practical subtyping system for Erlang. In 2nd ACM SIGPLAN Internat. Conf. on Functional Programming, 136-149. ACM Press, New York, 1997.
15. M. Müller. Ordering constraints over feature trees with ordered sorts. In P. Lopez, S. Manandhar, W. Nutt (eds.), Computational Logic and Natural Language Understanding, LNAI, to appear. Springer-Verlag, Berlin, Germany.
16. M. Müller. Set-based Failure Diagnosis for Concurrent Constraint Programming. Doctoral Dissertation. Universität des Saarlandes, Tech. Fak., Germany, 1998. In preparation.
17. M. Müller, J. Niehren. Ordering constraints over feature trees expressed in second-order monadic logic. In T. Nipkow (ed.), Internat. Conf. on Rewriting Techniques and Applications, no. 1379 in LNCS, 196-210, Tsukuba, Japan, 1998.
18. M. Müller, J. Niehren, A. Podelski. Ordering constraints over feature trees. In G. Smolka (ed.), 3rd Internat. Conf. on Principles and Practice of Constraint Programming, vol. 1330 of LNCS, 297-311, 1997.
19. M. Muller, J. Niehren, R. Treinen. The firstorder theory of ordering constraints over feature trees. http://www.ps.uni-sb.de/Papers/abstracts/FTSubTheory-98.html.
20. J. Palsberg. Efficient inference of object types. In 9th LICS, 186-185, 1994.
21. C. Pollard, I. Sag. Head-Driven Phrase Structure Grammar. Studies in Contemporary Linguistics. Cambridge University Press, Cambridge, England, 1994.
22. F. Pottier. Simplifying subtyping constraints. In ACM SIGPLAN Internat. Conf. on Functional Programming, 122- 133. ACM Press, 1996.
23. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
24. W. C. Rounds. Feature logics. In J. v. Benthem, A. ter Meulen (eds.), Handbook of Logic and Language. Elsevier Science Publishers B.V. (North Holland), 1997.
25. V. A. Saraswat. Concurrent Constraint Programming. The MIT Press, 1993.
26. S. Shieber. An Introduction to Unification-based Approaches to Grammar. CSLI Lecture Notes No. 4. Center for the Study of Language and Information, 1986.
27. G. Smolka. Feature constraint logics for unification grammars. J. of Logic Programming, 12:51-87, 1992.
28. G. Smolka, R. Treinen. Records for logic programming. J. of Logic Programming, 18(3):229-258, 1994.
29. J. W. Thatcher, J. B. Wright. Generalized finite automata theory with an application to a decision problem of secondorder logic. Mathematical Systems Theory, 2(1):57-81, 1968.
30. R. Treinen. A new method for undecidability proofs of first order theories. J. of Symbolic Computation, 14:437-457, 1992.
31. R. Treinen. Feature trees over arbitrary structures. In P. Blackburn, M. de Rijke (eds.), Specifying Syntactic Structures, chap. 7, 185-211. CSLI Publications and FoLLI, 1997.
32. V. Trifonov, S. Smith. Subtyping constrained types. In R. Cousot, D. A. Schmidt (eds.), 3rd Internat. Static Analysis Symposium, vol. 1145 of LNCS, 349-365, Aachen, 1996. Springer-Verlag, Berlin, Germany.
33. P. Van Roy, M. Mehl, R. Scheidhauer. Integrating efficient records into concurrent constraint programming. In Internat. Symposium on Programming Language Implementation and Logic Programming, Aachen, Germany, Sep. 1996. Springer-Verlag.
34. S. Vorobyov. An improved lower bound for the elementary theories of trees. In Internat. Conf. on Automated Deduction, vol. 1104 of LNCS, 275-287, 1996.