TY - RPRT
T1 - On the expressivity of feature logics with negation, functional uncertainty, and sort equations
T3 - Kaiserslautern ; Saarbrücken : DFKI, 1991
A1 - Baader,Franz
A1 - Bürckert,Hans-Jürgen
A1 - Nebel,Bernhard
A1 - Nutt,Werner
A1 - Smolka,Gert
Y1 - 2011/07/01
N2 - 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.
KW - Künstliche Intelligenz
CY - Saarbrücken
PB - Saarländische Universitäts- und Landesbibliothek
AD - Postfach 151141, 66041 Saarbrücken
UR - http://scidok.sulb.uni-saarland.de/volltexte/2011/3795
ER -