Debugging ASP using ILP

Tingting Li, Marina De Vos, Julian Padget, Ken Satoh, Tina Balke

Research output: Chapter or section in a book/report/conference proceedingChapter in a published conference proceeding

1 Citation (SciVal)
107 Downloads (Pure)


Declarative programming allows the expression of properties of the desired solution(s), while the computational task is delegated to a general-purpose algorithm. The freedom from explicit control
is counter-balanced by the difficulty in working out what properties are missing or are incorrectly expressed, when the solutions do not meet expectations. This can be particularly problematic in the
case of answer set semantics, because the absence of a key constraint/rule could make the difference between none or thousands of answer sets, rather than the intended one (or handful). The debugging
task then comprises adding or deleting conditions on the right hand sides of existing rules or, more far-reaching, adding or deleting whole rules. The contribution of this paper is to show how inductive
logic programming (ILP) along with examples of (un)desirable properties of answer sets can be used to revise the original program semi-automatically so that it satisfies the stated properties, in effect
providing debugging-by-example for programs under answer set semantics.
Original languageEnglish
Title of host publicationProceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015)
EditorsMarina De Vos, Thomas Eiter, Yuliya Lierler, Francesca Toni
Pages1 - 14
Number of pages14
ISBN (Electronic)1613-0073
Publication statusPublished - Aug 2015


Dive into the research topics of 'Debugging ASP using ILP'. Together they form a unique fingerprint.

Cite this