Stepwise debugging of answer-set programs
From MaRDI portal
Publication:4603428
DOI10.1017/S1471068417000217zbMath1425.68053arXiv1705.06564MaRDI QIDQ4603428
Jörg Pührer, Johannes Oetsch, Hans Tompits
Publication date: 20 February 2018
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.06564
Related Items (5)
Witnesses for Answer Sets of Logic Programs ⋮ Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics ⋮ Towards causality-based conflict resolution in answer set programs ⋮ Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms ⋮ Answering the “why” in answer set programming – A survey of explanation approaches
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On abstract modular inference systems and solvers
- Semantics and complexity of recursive aggregates in answer set programming
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Logic programs with abstract constraint atoms: the role of computations
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- Propositional semantics for disjunctive logic programs
- Logic programs with stable model semantics as a constraint programming paradigm
- Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints
- On elementary loops of logic programs
- Stepwise Debugging of Description-Logic Programs
- Logic programs with propositional connectives and aggregates
- Stepping through an Answer-Set Program
- Abstract answer set solvers with backjumping and learning
- Advances in WASP
- Interactive Debugging of Non-ground ASP Programs
- Solving SAT and SAT Modulo Theories
- Catching the Ouroboros: On debugging non-ground answer-set programs
- Justifications for logic programs under answer set semantics
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- The DLV system for knowledge representation and reasoning
- A logic of nonmonotone inductive definitions
- Debugging for Model Expansion
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Debugging ASP Programs by Means of ASP
- A Theoretical Framework for the Declarative Debugging of Datalog Programs
This page was built for publication: Stepwise debugging of answer-set programs