2019
DOI: 10.1017/s1471068419000255
|View full text |Cite
|
Sign up to set email alerts
|

Inconsistency Proofs for ASP: The ASP - DRUPE Format

Abstract: Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs. However, it is far from immediate to verify whether a program that is claimed to be inconsistent, indeed does not admit any answer sets. In this paper, we address this problem and develo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 38 publications
0
2
0
Order By: Relevance
“…This resulted in several proof formats for solvers deciding satisfiability [Gelder, 2008;Goldberg and Novikov, 2003] and further problem formalisms [Heule et al, 2013;Wetzler et al, 2014;Heule et al, 2014;Lonsing and Egly, 2018b]. In the light of these works, the resulting initiative on explainability for artificial intelligence, and a recent proof logging format adapted for answer set programming [Alviano et al, 2019b], it might be interesting to consider applying and adapting such formats for the algorithms of Chapter 3 or further approaches based based on dynamic programming.…”
Section: Future Workmentioning
confidence: 99%
“…This resulted in several proof formats for solvers deciding satisfiability [Gelder, 2008;Goldberg and Novikov, 2003] and further problem formalisms [Heule et al, 2013;Wetzler et al, 2014;Heule et al, 2014;Lonsing and Egly, 2018b]. In the light of these works, the resulting initiative on explainability for artificial intelligence, and a recent proof logging format adapted for answer set programming [Alviano et al, 2019b], it might be interesting to consider applying and adapting such formats for the algorithms of Chapter 3 or further approaches based based on dynamic programming.…”
Section: Future Workmentioning
confidence: 99%
“…An unsatisfiable core of a given program Π is a subset C of literals that make the program Π ∪ {← ¬ℓ | ℓ ∈ C} under the (literal) assumptions C inconsistent. Besides core-guided optimization, assumptions and unsatisfiable cores are relevant for cautious reasoning (Alviano et al 2018b), explainability (Alviano et al 2019), belief revision (Garcia et al 2018), and forgetting rules (cf. Gonc ¸alves, Knorr, and Leite 2021).…”
Section: Introductionmentioning
confidence: 99%