𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular Path Expressions in Feature Logic

✍ Scribed by Rolf Backofen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
975 KB
Volume
17
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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 to any given regular language. In the area of computational linguistics, this notion has been introduced as "functional uncertainty". We will prove that satisfiability is decidable by constructing a quasi-terminating rule system.

πŸ“œ SIMILAR VOLUMES

Rewriting of Regular Expressions and Reg
Rewriting of Regular Expressions and Regular Path Queries
✍ Diego Calvanese; Giuseppe De Giacomo; Maurizio Lenzerini; Moshe Y. Vardi πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 189 KB

Recent work on semi-structured data has revitalized the interest in path queries, i.e., queries that ask for all pairs of objects in the database that are connected by a path conforming to a certain specification, in particular to a regular expression. Also, in semi-structured data, as well as in da

Shortest Paths in Distance-regular Graph
Shortest Paths in Distance-regular Graphs
✍ Enrique Bendito; Angeles Carmona; AndrΓ©s M. Encinas πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 150 KB
Expressing preferences in default logic
Expressing preferences in default logic
✍ James P. Delgrande; Torsten Schaub πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 400 KB