Previous researchers have proposed generalizations of Horn clause logic to support negation and non-determinism as two separate extensions. In this paper, we show that the stable model semantics for logic programs provides a unified basis for the treatment of both concepts. First, we introduce the concepts of partial models, stable models, strongly founded models and deterministic models and other interesting classes of partial models and study their relationships. We show that the maximal deterministic model of a program is a subset of the intersection of all its stable models and that the well-founded model of a program is a subset of its maximal deterministic model. Then, we show that the use of stable models subsumes the use of the non-deterministic
先前的研究人员提出了Horn子句逻辑的概括,以支持否定和非确定性作为两个单独的扩展。在本文中,我们证明了逻辑程序的稳定模型语义为处理这两个概念提供了统一的基础。首先,我们介绍局部模型,稳定模型,牢固建立的模型和确定性模型以及其他有趣的局部模型类的概念,并研究它们之间的关系。我们表明,程序的最大确定性模型是其所有稳定模型的交集的子集,并且程序良好的模型是其最大确定性模型的子集。然后,我们证明稳定模型的使用包含了LDL中不确定的
机译:带有负数的逻辑程序对稳定模型语义的贡献
机译:带有负数的逻辑程序对稳定模型语义的贡献
机译:否定导致失败:独立选择逻辑中的稳定模型
机译:逻辑计划的良好成立和部分稳定语义中的强烈否定
机译:具有稳定模型的逻辑编程,可以满足约束条件。
机译:结合归纳逻辑编程和命题模型的基于家庭的蛋白质远程同源性检测的判别方法
机译:否定逻辑程序中的稳定模型和不确定性
机译:逻辑规划与否定:一项调查