Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints.

Lecture Notes in Computer Science(2013)

引用 12|浏览16
暂无评分
摘要
When deploying Answer Set Programming (ASP) in an industrial context, for instance for (re-)configuration [5], knowledge engineers need debugging support on non-ground programs. Current approaches to ASP debugging, however, do not cover extended modeling features of ASP, such as choice rules, conditional literals, cardinality and weight constraints [13]. To this end, we encode non-ground ASP programs using extended modeling features into normal logic progams; this encoding extends existing encodings for the case of ground programs [4,10,11] to the non-ground case. We subsequently deploy this translation on top of an existing ASP debugging approach for non-ground normal logic programs [14]. We have implemented and tested the approach and provide evaluation results.
更多
查看译文
关键词
Choice Rule, Predicate Symbol, Cardinality Constraint, Weight Constraint, Normal Logic Program
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要