On the decidability of functional uncertainty

Authors:
Rolf Backofen
Affiliations:
German Research Center for Artificial Intelligence (DFKI), Saarbrüken, Germany
Venue:
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Year:
1993

Citing 5
Cited 0

Termination of rewriting

Journal of Symbolic Computation
Feature-constraint logics for unification grammars

Journal of Logic Programming
Functional Uncertainty and Functional Precedence in Continental West Germanic

4. Österreichische Artificial-Intelligence-Tagung, Wiener Workshop Wissensbasierte Sprachverarbeitung
A complete and recursive feature theory

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
An algorithm for functional uncertainty

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.02

Visualization

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.