Location of Repository

On the expressivity of feature logics with negation, functional uncertainty, and sort equations

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


Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with complements 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

Topics: Künstliche Intelligenz, Data processing Computer science
Publisher: Sonstige Einrichtungen. DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Year: 1991
OAI identifier: oai:scidok.sulb.uni-saarland.de:3795

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.