Regular path expressions in feature logic
We examine the existential fragment of a feature logic, which is extended by regular path expressions. A regular path expression is a subterm relation, where the allowed paths for the subterms are restricted by a regular language. We will prove that satisfiability is decidable. This is achieved by setting up a quasi-terminating rewrite system.
KeywordsSugar Dition Prefix
Unable to display preview. Download preview PDF.
- [Bac93]Rolf Backofen. Regular path expressions in feature logic. Research report, DFKI, 1993. To appear.Google Scholar
- [BBN+91]Franz Baader, Hans-Jürgen Bürckert, Berhard Nebel, Werner Nutt, and Gert Smolka. On the expressivity of feature logics with negation, functional uncertainity, and sort equations. Research Report RR-91-01, DFKI, 1991.Google Scholar
- [BS92]Rolf Backofen and Gert Smolka. A complete and recursive feature theory. Research Report RR-92-30, DFKI, 1992.Google Scholar
- [KB82]Ronald M. Kaplan and Joan Bresnan. Lexical-Functional Grammar: A formal system for grammatical representation. In J. Bresnan, editor, The Mental Representation of Grammatical Relations, pages 173–381. MIT Press, Cambridge (MA), 1982.Google Scholar
- [Kel9l]Bill Keller. Feature logics, infinitary descriptions and the logical treatment of grammar. Cognitive Science Research Report 205, Univerity of Sussex, School of Cognitive and Computing Sciences, 1991.Google Scholar
- [KM88]R. M. Kaplan and J. T. Maxwell III. An algorithm for functional uncertainty. In Proceedings of the 12th International Conference on Computational Linguistics, pages 297–302, Budapest, Hungary, 1988.Google Scholar
- [KZ88]Ronald M. Kaplan and Annie Zaenen. Long-distance dependencies, constituent structure, and functional uncertainty. In M. Baltin and A. Kroch, editors, Alternative Conceptions of Phrase Structure. University of Chicago Press, Chicago, 1988.Google Scholar
- [Shi86]Stuart M. Shieber. An Introduction to Unification-Based Approaches to Grammar, volume 4 of CSLI Lecture Notes. Stanford University, Stanford (CA), 1986.Google Scholar
- [Smo88]Gert Smolka. A feature logic with subsorts. LILOG-Report 33, IWBS, IBM Deutschland, Stuttgart, May 1988.Google Scholar
- [ST92]Gert Smolka and Ralf Treinen. Records for logic programming. In Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, Washington, DC, November 1992. The MIT Press.Google Scholar