The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Tracing piece by piece: affordable debugging for lazy functional languages
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Generating deductive database explanations
Proceedings of the 1999 international conference on Logic programming
Algorithmic Program DeBugging
Specifying Prolog Trace Models with a Continuation Semantics
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A meta-programming technique for debugging answer-set programs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Well-founded semantics and the algebraic theory of non-monotone inductive definitions
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
SAT(ID): satisfiability of propositional logic extended with inductive definitions
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Justifications for logic programs under answer set semantics
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Catching the ouroboros: On debugging non-ground answer-set programs
Theory and Practice of Logic Programming
VIDEAS: a development tool for answer-set programs based on model-driven engineering technology
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.01 |
Due to the development of efficient solvers, declarative problem solving frameworks based on model generation are becoming more and more applicable in practice. However, there are almost no tools to support debugging in these frameworks. For several reasons, current solvers are not suitable for debugging by tracing. In this paper, we propose a new solver algorithm for one of these frameworks, namely Model Expansion, that allows for debugging by tracing. We explain how to explore the trace of this solver in order to quickly locate a bug and we compare our debugging method with existing ones for Answer Set Programming and the Alloy system.