Inconsistency Proofs for ASP: The ASP - DRUPE Format
From MaRDI portal
Publication:5108508
DOI10.1017/S1471068419000255zbMath1434.68065arXiv1907.10389OpenAlexW2973328396WikidataQ113857303 ScholiaQ113857303MaRDI QIDQ5108508
Carmine Dodaro, Markus Hecher, Johannes K. Fichte, Jakob Rath, Tobias Philipp, Mario Alviano
Publication date: 4 May 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10389
Related Items
Witnesses for Answer Sets of Logic Programs, A practical account into counting Dung's extensions by dynamic programming
Uses Software
Cites Work
- Semantics and complexity of recursive aggregates in answer set programming
- Answer set based design of knowledge systems
- Logic programs with abstract constraint atoms: the role of computations
- Conflict-driven answer set solving: from theory to practice
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
- Extended resolution simulates \({\mathsf{DRAT}}\)
- Efficient certified RAT verification
- DRAT Proofs for XOR Reasoning
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Multi-Criteria Optimization in Answer Set Programming
- Team-building with answer set programming in the Gioia-Tauro seaport
- Vicious Circle Principle and Logic Programs with Aggregates
- Logic programs with propositional connectives and aggregates
- Detecting inconsistencies in large biological networks with answer set programming
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- A Unified Proof System for QBF Preprocessing
- Well-founded and stable semantics of logic programs with aggregates
- A Constructive semantic characterization of aggregates in answer set programming
- Advances in WASP
- Expressing Symmetry Breaking in DRAT Proofs
- Some (in)translatability results for normal logic programs and propositional theories
- Stable inference as intuitionistic validity
- Shared aggregate sets in answer set programming
- GRASP: a search algorithm for propositional satisfiability
- Answer Set Programming Modulo Acyclicity*
- Verifying Refutations with Extended Resolution
- Logic Programming and Nonmonotonic Reasoning
- Theory and Applications of Satisfiability Testing
