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

具有学习功能的抽象答案集求解器

Abstract Answer Set Solvers with Learning

University of Texas at Austin(德克萨斯大学奥斯汀分校);Department of Computer Science(计算机科学系)

Yuliya Lierler

摘要:

Nieuwenhuis,Oliveras和Tinelli(2006)展示了如何使用转换系统而不是伪代码来描述Davis-Putnam-Logemann-Loveland算法的增强。我们设计了一个类似的框架,几个算法,生成答案集的逻辑程序:Smodels,Smodels-CC,Asp-Sat与学习(Cmodels),和一个新设计和实现的算法Sup。这种描述答案集求解器的方法使得证明它们的正确性、比较它们以及设计新系统变得更加容易。

英文摘要:

Nieuwenhuis, Oliveras, and Tinelli (2006) showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for several algorithms that generate answer sets for logic programs: Smodels, Smodels-cc, Asp-Sat with Learning (Cmodels), and a newly designed and implemented algorithm Sup. This approach to describing answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.

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

↑