Abstract
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.
This work was supported by a research grant, ITW 9002 0, from the German Bundesministerium für Forschung und Technologie to the DFKI project DISCO. I would like to thank Jochen Dörre, Joachim Niehren and Ralf Treinen for reading draft version of this paper. An extended version of this paper containing the complete proofs will be published as a technical report [Bac93].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rolf Backofen. Regular path expressions in feature logic. Research report, DFKI, 1993. To appear.
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.
Rolf Backofen and Gert Smolka. A complete and recursive feature theory. Research Report RR-92-30, DFKI, 1992.
Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69–116, 1987.
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.
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.
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.
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.
Stuart M. Shieber. An Introduction to Unification-Based Approaches to Grammar, volume 4 of CSLI Lecture Notes. Stanford University, Stanford (CA), 1986.
Gert Smolka. A feature logic with subsorts. LILOG-Report 33, IWBS, IBM Deutschland, Stuttgart, May 1988.
Gert Smolka. Feature constraint logics for unification grammars. Journal of Logic Programming, 12:51–87, 1992.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Backofen, R. (1993). Regular path expressions in feature logic. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-21551-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56868-1
Online ISBN: 978-3-662-21551-7
eBook Packages: Springer Book Archive