期刊
ARTIFICIAL INTELLIGENCE
卷 187, 期 -, 页码 52-89出版社
ELSEVIER
DOI: 10.1016/j.artint.2012.04.001
关键词
Answer set programming; Logic programming; Nonmonotonic reasoning
资金
- German Science Foundation (DFG) [SCHA 550/8-1, SCHA 550/8-2]
We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply advanced solving techniques from the area of SAT. As a result, we present the first full-fledged algorithmic framework for native conflict-driven ASP solving. Our approach is implemented in the ASP solver clasp that has demonstrated its competitiveness and versatility by winning first places at various solver contests. (C) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据