@InProceedings{Bac:Regular:RTA93,
  author = 	"Rolf Backofen",
  title = 	"Regular Path Expressions in Feature Logic",
  booktitle = 	"Proc.\ of the RTA'93",
  year = 	1993,
  editor = 	"Claude Kirchner",
  pages = 	"121--135",
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = 690,
  isbn      = {3-540-56868-9},
  address = 	"Montreal, Canada",
  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. 
   }
}