Testing and debugging techniques for answer set solver development
From MaRDI portal
Publication:3585183
DOI10.1017/S1471068410000396zbMath1206.68292arXiv1007.3223OpenAlexW2134211750MaRDI QIDQ3585183
Matti Järvisalo, Robert Brummayer
Publication date: 19 August 2010
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3223
Uses Software
Cites Work
- Unnamed Item
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer set programming based on propositional satisfiability
- Extending and implementing the stable model semantics
- Logic programs with stable model semantics as a constraint programming paradigm
- The Significance of Memory Costs in Answer Set Solver Implementation
- Computing Stable Models via Reductions to Difference Logic
- Simple Random Logic Programs
- Some (in)translatability results for normal logic programs and propositional theories
- The DLV system for knowledge representation and reasoning
- The nomore + + Approach to Answer Set Solving
- Debugging ASP Programs by Means of ASP