Publication details

Saarland University Computer Science

On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations

Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt, Gert Smolka

Journal of Logic, Language and Information 2:1-18, 1993

Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of long-distance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if there is no atom.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy