Technical Report: Inconsistency in Answer Set Programs and Extensions
Christoph Redl

TL;DR
This paper investigates the causes of inconsistency in Answer Set Programming and HEX-programs, introduces methods for analyzing and explaining these inconsistencies, and presents a new evaluation algorithm with significant performance improvements.
Contribution
It offers a novel framework for characterizing and explaining inconsistencies in ASP and HEX-programs, along with an innovative evaluation algorithm utilizing conflict-driven learning.
Findings
New characterization of inconsistency in ASP and HEX-programs
Techniques for computing inconsistency reasons
Significant speedup in HEX-program evaluation experiments
Abstract
Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs. HEX-programs extend ASP with external atoms for accessing arbitrary external information, which can introduce values that do not appear in the input program. In this work we consider inconsistent ASP- and HEX-programs, i.e., programs without answer sets. We study characterizations of inconsistency, introduce a novel notion for explaining inconsistencies in terms of input facts, analyze the complexity of reasoning tasks in context of inconsistency analysis, and present techniques for computing inconsistency reasons. This theoretical work is motivated by two concrete applications, which we also present. The first one is the new modeling technique of query answering over subprograms as a convenient alternative to the well-known saturation technique. The second application is a new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Logic, programming, and type systems
