Expressive Power and Complexity in Algebraic Logic
Expressive Power and Complexity in Algebraic Logic
复制标题
代数逻辑的表达能力和复杂性
DOI：
--
复制
发表时间：
1997
影响因子：
0.7
通讯作者：
R. Hirsch
中科院分区：
文献类型：
--
作者：
R. Hirsch
Two complexity problems in algebraic logic are surveyed: the satisfaction problem and the network satisfaction problem. Various complexity results are collected here and some new ones are derived. Many examples are given. The network satisfaction problem for most cylindric algebras of dimension four or more is shown to be intractable. Complexity is tied-in with the expressivity of a relation algebra. Expressivity and complexity are analysed in the context of homogeneous representations. The model-theoretic notion of interpretation is used to generalise known complexity results to a range of other algebraic logics. In particular a number of relation algebras are shown to have intractable network satisfaction problems.
