arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.08681cs.LO
收藏

基于图的答案集编程求解系统

Graph Based Answer Set Programming Solver Systems

Fang Li

摘要:

回答集编程(ASP)是一种基于非单调逻辑的知识表示和组合问题求解的流行范式。计算ASP程序的答案集通常是NP难的,研究人员一直在投入大量的精力来加速它。目前大多数ASP求解器采用类似SAT求解器的技术来找到这些答案集。因此,很难证明为什么文字在答案集中。存在基于依赖图的方法来找到答案集,但是由于依赖图的表示限制,这样的方法是有限的。本文提出了一种新的依赖图为基础的方法来寻找答案集,其中目标的连接显式表示为一个节点,允许任意答案集程序被统一表示。我们的表示保留了因果关系允许的理由,每个文字的答案集是elegantly found.In本文中,我们探讨了两种不同的方法的基础上的图形表示:自下而上和自上而下。自底向上的方法通过分配真值以及拓扑顺序来查找模型,而自顶向下的方法从约束开始生成模型。

英文摘要:

Answer set programming (ASP) is a popular nonmonotonic-logic based paradigm for knowledge representation and solving combinatorial problems. Computing the answer set of an ASP program is NP-hard in general, and researchers have been investing significant effort to speed it up. The majority of current ASP solvers employ SAT solver-like technology to find these answer sets. As a result, justification for why a literal is in the answer set is hard to produce. There are dependency graph based approaches to find answer sets, but due to the representational limitations of dependency graphs, such approaches are limited. This paper proposes a novel dependency graph-based approach for finding answer sets in which conjunction of goals is explicitly represented as a node which allows arbitrary answer set programs to be uniformly represented. Our representation preserves causal relationships allowing for justification for each literal in the answer set to be elegantly found. In this paper, we explore two different approaches based on the graph representation: bottom-up and top-down. The bottom-up approach finds models by assigning truth values along with the topological order, while the top-down approach generates models starting from the constraints.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑