Debugging Non-ground ASP Programs: Technique and Graphical Tools
From MaRDI portal
Publication:5197755
DOI10.1017/S1471068418000492zbMath1486.68025arXiv1808.00417MaRDI QIDQ5197755
Philip Gasteiger, Kristian Reale, Francesco Ricca, Konstantin Schekotihin, Carmine Dodaro
Publication date: 19 September 2019
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.00417
68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
68N17: Logic programming
Related Items
Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming, Answering the “why” in answer set programming – A survey of explanation approaches, Witnesses for Answer Sets of Logic Programs, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Testing in ASP: revisited language and programming environment, Enumeration of minimal models and MUSes in WASP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Design and results of the Fifth Answer Set Programming Competition
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints
- Stepping through an Answer-Set Program
- Optimization Methods for the Partner Units Problem
- Detecting inconsistencies in large biological networks with answer set programming
- Advances in WASP
- Interactive Debugging of Non-ground ASP Programs
- Characterising and Explaining Inconsistency in Logic Programs
- The Design of the Sixth Answer Set Programming Competition
- An ASP approach for the valves positioning optimization in a water distribution system
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Catching the Ouroboros: On debugging non-ground answer-set programs
- Justifications for logic programs under answer set semantics
- GRASP: a search algorithm for propositional satisfiability
- Shift Design with Answer Set Programming*
- Generating explanations for biomedical queries
- Optimizing phylogenetic supertrees using answer set programming
- Justifying answer sets using argumentation
- Anytime answer set optimization via unsatisfiable core shrinking
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
