Abstraction for Non-ground Answer Set Programs.

Lecture Notes in Artificial Intelligence(2019)

引用 16|浏览57
暂无评分
摘要
We address the issue of abstraction, a widely used notion to simplify problems, in the context of Answer Set Programming (ASP), which is a highly expressive formalism and a convenient tool for declarative problem solving. We introduce a method to automatically abstract non-ground ASP programs given an abstraction over the domain, which ensures that each original answer set is mapped to some abstract answer set. We discuss abstraction possibilities on several examples and show the use of abstraction to gain insight into problem instances, e.g., domain details irrelevant for problem solving; this makes abstraction attractive for getting to the essence of the problem. We also provide a tool implementing automatic abstraction from an input program.
更多
查看译文
关键词
Abstraction,Answer set programming,Declarative problem solving,Knowledge representation and reasoning,Nonmonotonic formalisms,Explaining unsatisfiability,Counterexample-guided abstraction and refinement
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要