Dynamic Consistency Checking in Goal-Directed Answer Set Programming

Abstract

In answer set programming, inconsistencies arise when the constraints placed on a program become unsatisfiable. In this paper, we introduce a technique for dynamic consistency checking for our goal-directed method for computing answer sets, under which only those constraints deemed relevant to the partial answer set are tested, allowing inconsistent knowledgebases to be successfully queried. However, the algorithm guarantees that, if a program has at least one consistent answer set, any partial answer set returned will be a subset of some consistent answer set. To appear in Theory and Practice of Logic Programming (TPLP).Comment: 12 pages. Accepted to ICLP 2014. To appear in Theory and Practice of Logic Programming (TPLP

Repairing inconsistent answer set programs using rules of thumb: A gene regulatory networks case study

“…The basic idea behind this method is to find a minimal subset of rules whose removal restores consistency to the program. In [21], a technique of dynamic consistency checking for computing answer sets in inconsistent ASP programs is presented. Under this method, only constraints that are deemed relevant to partial answer sets (i.e.…”

The Seventh Answer Set Programming Competition: Design and Results

“…Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning (Baral 2003;Brewka et al 2011;Eiter et al 2009;Gelfond and Leone 2002;Lifschitz 2002;Marek and Truszczyński 1999;Niemelä 1999). The goal of the ASP Competition series is to promote advancements in ASP methods, collect challenging benchmarks, and assess the state of the art in ASP solving (see, e.g., Alviano et al 2015Alviano et al , 2017Bruynooghe et al 2015;Gebser et al 2015;Lefèvre et al 2017;Maratea et al 2015;Marple and Gupta 2014;Calimeri et al 2017 for recent ASP systems, and Gebser et al 2018 for a recent survey). Following a nowadays customary practice of publishing results of AI-based competitions in archival journals, where they are expected to remain available and can be used as references, the results of ASP competitions have been hosted in prominent journals of the area (see Calimeri et al 2014Gebser et al 2017b).…”

Query answering in resource-based answer set semantics

“…Answer set programming (ASP) is nowadays a well-established and successful programming paradigm based on answer set semantics (Gelfond and Lifschitz 1988;Marek and Truszczyński 1999), with applications in many areas (cf., e.g., (Baral 2003;Truszczyński 2007;Gelfond 2007) and the references therein). Nevertheless, as noted in (Gebser et al 2009;Bonatti et al 2008), few attempts to construct a goal-oriented proof procedure exist, though there is a renewal of interest, as attested, e.g., by the recent work presented in (Marple and Gupta 2014). This is due to the very nature of the answer set semantics, where a program may admit none or several answer sets, and where the semantics enjoys no locality, or, better, no Relevance in the sense of (Dix 1995): no subset of the given program can in general be identified, from where the decision of atom A (intended as a goal, or query) belonging or not to some answer set can be drawn.…”