利用可能性理论刻画和扩展答案集语义
Characterizing and Extending Answer Set Semantics using Possibility Theory
摘要:
答案集编程(ASP)是一个流行的框架建模组合问题。然而,ASP不能很容易地用于推理不确定的信息。可能性ASP(Possibilistic ASP,PASP)是ASP的一种扩展,它结合了可能性逻辑和ASP.在PASP中,权重与每个规则相关联,其中该权重被解释为当已知主体保持时可以建立结论的确定性。因此,它允许我们以直观的方式对不确定信息进行建模和推理。在本文中,我们提出了新的语义PASP,其中规则被解释为可能性分布的约束。这些约束的特殊模型,然后确定为可能性的答案集。此外,由于ASP是一个特殊的情况下,PASP中的所有规则是完全确定的,我们得到了一个新的表征ASP的可能性分布的约束。这使我们能够发现一种新的析取形式,称为弱析取,以前没有在文献中考虑过。除了介绍和激发弱析取的语义,我们还指出其计算复杂性。特别是,虽然大多数推理任务的复杂性符合标准的析取ASP,我们发现,勇敢的推理弱析取程序更容易。
英文摘要:
Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP, in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。