TY  - RPRT
T1  - Regular path expressions in feature logic 
T3  - Kaiserslautern ; Saarbrücken : DFKI, 1993
A1  - Backofen,Rolf
Y1  - 2011/06/27
N2  - 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. 
KW  - Künstliche Intelligenz
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/3653
ER  -