Interactive Debugging of ASP Programs release_iqrfdt63ufapnle5y7fgoqua4u

by Kostyantyn Shchekotykhin

Released as a article .

2014  

Abstract

Broad application of answer set programming (ASP) for declarative problem solving requires the development of tools supporting the coding process. Program debugging is one of the crucial activities within this process. Recently suggested ASP debugging approaches allow efficient computation of possible explanations of a fault. However, even for a small program a debugger might return a large number of possible explanations and selection of the correct one must be done manually. In this paper we present an interactive query-based ASP debugging method which extends previous approaches and finds a preferred explanation by means of observations. The system queries a programmer whether a set of ground atoms must be true in all (cautiously) or some (bravely) answer sets of the program. Since some queries can be more informative than the others, we discuss query selection strategies which, given user's preferences for an explanation, can find the best query. That is, the query an answer of which reduces the overall number of queries required for the identification of a preferred explanation.
In text/plain format

Archived Files and Locations

application/pdf  189.2 kB
file_o2awgwccpjblnfkio3lpbmm5si
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-05-08
Version   v2
Language   en ?
arXiv  1403.5142v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ed725425-da5d-4019-a3b8-7a3969377565
API URL: JSON