Stable Model Semantics of Weight Constraint Rules
Stable Model Semantics of Weight Constraint Rules
复制标题
DOI：
10.1007/3-540-46767-x_23
复制
发表时间：
1999-12
期刊：
影响因子：
--
通讯作者：
I. Niemelä;P. Simons;T. Soininen
中科院分区：
文献类型：
--
作者：
I. Niemelä;P. Simons;T. Soininen
提出了一种逻辑程序规则的推广，其中规则是从每个谓词的类型信息而不是简单的文字的权重约束中构建的。这类约束对于简明地表示产品配置等组合问题中的各种选择以及基数、成本和资源约束是有用的。规则的声明性语义，它概括了正常逻辑程序的稳定模型语义。结果表明，对于基本规则的相关决策问题的复杂性停留在NP。该语言的第一个实现处理不允许使用函数符号的可判定子集。它是基于一个新的程序，用于计算稳定的基本规则扩展正常的程序与选择和重量结构和编译技术，其中的重量规则与变量被转换为一组这样的简单的基本规则。
A generalization of logic program rules is proposed where rules are built from weight constraints with type information for each predicate instead of simple literals. These kinds of constraints are useful for concisely representing different kinds of choices as well as cardinality, cost and resource constraints in combinatorial problems such as product configuration. A declarative semantics for the rules is presented which generalizes the stable model semantics of normal logic programs. It is shown that for ground rules the complexity of the relevant decision problems stays in NP. The first implementation of the language handles a decidable subset where function symbols are not allowed. It is based on a new procedure for computing stable models for ground rules extending normal programs with choice and weight constructs and a compilation technique where a weight rule with variables is transformed to a set of such simpler ground rules.