Skip to main content Skip to main navigation


Regular Path Expressions in Feature Logic

Rolf Backofen
DFKI, DFKI Research Reports (RR), Vol. 93-17, 1993.


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. We will prove that satisfiability is decidable. This is achieved by setting up a quasi-terminating rule system.

Weitere Links