@InProceedings{Bac:Uncertainty:ACL93-withoutfull,
  AUTHOR = 	"Rolf Backofen",
  TITLE = 	"On the Decidability of Functional Uncertainty",
  booktitle = 	"Proc. of the 31$^{\it st}$ ACL",
  year = 	1993,
  pages = 	"201--208",
  organization = 	"Association for Computational Linguistics",
  address = 	"Columbus, Ohio"
, abstract = {We show that feature logic extended by functional uncertainty is
decidable, even if one admits cyclic descriptions.
We present an algorithm, which solves feature descriptions
containing functional uncertainty in two phases, both phases using a set
of deterministic and non-deterministic rewrite rules. We then
compare our algorithm with the one of Kaplan and Maxwell,
that does not cover cyclic feature descriptions. 
   }
}