On the expressivity of feature logics with negation, functional uncertainty, and sort equations
On the expressivity of feature logics with negation, functional uncertainty, and sort equations
复制标题
关于具有否定、函数不确定性和排序方程的特征逻辑的表达性
DOI：
--
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
G. Smolka
中科院分区：
文献类型：
--
作者：
F. Baader;H. Bürckert;Bernhard Nebel;W. Nutt;G. Smolka
特征逻辑是计算语言学中研究的统一语法的逻辑基础。研究了特征项带否定的表达性和描述长距离依赖所需的函数不确定性结构，得到了如下结果：特征项的可满足性是不可判定的，排序方程是可内在化的，排序方程的一致性是可判定的，如果至少有一个原子，排序方程的一致性是不可判定的，如果没有原子.
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.