Testing and debugging techniques for answer set solver development

Theory and Practice of Logic Programming

Volumn 10, Issue 4-6, 2010, Pages 741-758

  Brummayer, Robert ^a   Järvisalo, Matti ^b  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

answer set programming; answer set solvers; debugging; testing

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; ANSWER SET SOLVING; AUTOMATED TESTING; BLACK BOXES; DEBUGGING; DEBUGGING ALGORITHMS; FUZZ TESTING; TESTING AND DEBUGGING;

PROGRAM DEBUGGING;

EID: 77957231367     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068410000396     Document Type: Conference Paper

References (38)

1. ANGER, C., GEBSER, M., LINKE, T., NEUMANN, A. AND SCHAUB, T. 2005. The nomore++ approach to answer set solving. In Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005), G. Sutcliffe and A. Voronkov, Eds. Lecture Notes in Computer Science, vol. 3835. Springer, 95-109. (Pubitemid 43955308)
2. BARRETT, C. AND TINELLI, C. 2007. CVC3. In Proceedings of the 19th International Conference on Computer Aided Verification (CAV 2007), W. Damm and H. Hermanns, Eds. Lecture Notes in Computer Science, vol. 4590. Springer, 298-302.
3. BIERE, A. 2008. PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation 4, 75-97.
4. BRAIN, B., GEBSER, M., PüHRER, J., SCHAUB, T., TOMPITS, H. AND WOLTRAN, S. 2007. Debugging ASP programs by means of ASP. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007), C. Baral, G. Brewka, and J. S. Schlipf, Eds. Lecture Notes in Computer Science, vol. 4483. Springer, 31-43.
5. BRAIN, M. AND DE VOS, M. 2005. Debugging logic programs under the answer set semantics. In Proceedings of the 3rd Workshop on Answer Set Programming: Advances in Theory and Implementation (ASP), M. de Vos and A. Provetti, Eds. 142-152.
6. BRAIN, M. AND DE VOS, M. 2009. The significance of memory costs in answer set solver implementation. Journal of Logic and Computation 19, 4, 615-641.
7. BRUMMAYER, R. AND BIERE, A. 2009. Fuzzing and delta-debugging SMT solvers. In Proceedings of the 7th International Workshop on Satisfiability Modulo Theories (SMT). ACM International Conference Proceedings Series, vol. 375. ACM, 1-5.
8. CALIMERI, F., LEONE, N., RICCA, F. AND VELTRI, P. 2009. A visual tracer for DLV. In Proceedings of the 2nd International Workshop on Software Engineering for Answer Set Programming (SEA 2009), M. De Vos and T. Schaub, Eds. 79-93.
9. CLAESSEN, K. AND HUGHES, J. 2000. QuickCheck: A lightweight tool for random testing of Haskell programs. In Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP 2000). SIGPLAN Notices 35 (9). ACM, 268-279. (Pubitemid 32024728)
10. DE MOURA, L. M. AND BJØRNER, N. 2008. Z3: An efficient SMT solver. In Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2008), C. R. Ramakrishnan and J. Rehof, Eds. Lecture Notes in Computer Science, vol. 4963. Springer, 337-340.
11. DENECKER, M., VENNEKENS, J., BOND, S., GEBSER, M., AND TRUSZCZYNSKI, M. 2009. The second answer set programming competition. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), E. Erdem, F. Lin, and T. Schaub, Eds. Lecture Notes in Computer Science, vol. 5753. Springer, 637-654. See also competition results at http://www.cs.kuleuven. be/dtai/events/ASP-competition/.
12. DRESCHER, C., GEBSER, M., GROTE, T., KAUFMANN, B., KöNIG, A., OSTROWSKI, M. AND SCHAUB, T. 2008. Conflict-driven disjunctive answer set solving. In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR), G. Brewka and J. Lang, Eds. AAAI Press, 422-432.
13. DUTERTRE, B. AND DE MOURA, L. 2006. The Yices SMT solver. http://yices.csl.sri.com/tool-paperpdf.
14. EéN, N. AND SöRENSSON, N. 2004. An extensible SAT-solver. In 6th International Conference on Theory and Applications of Satisfiability Testing (SAT), Selected Revised Papers, E. Giunchiglia and A. Tacchella, Eds. Lecture Notes in Computer Science, vol. 2919. Springer, 502-518. (Pubitemid 38203766)
15. GEBSER, M., KAUFMANN, B., NEUMANN, A. AND SCHAUB, T. 2007. Conflict-driven answer set solving. In Proceedings of the 20th International Joint Conference on Articifial Intelligence (IJCAI), M. M. Veloso, Ed. Morgan Kaufmann, 286-392.
16. GEBSER, M., LIU, L., NAMASIVAYAM, G., NEUMANN, A., SCHAUB, T. AND TRUSZCZYNSKI, M. 2007. The first answer set programming system competition. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), C. Baral, G. Brewka, and J. S. Schlipf, Eds. Lecture Notes in Computer Science, vol. 4483. Springer, 3-17. See also competition results at http://asparagus.cs.uni-potsdam.de/contest/.
17. GEBSER, M., PüHRER, J., SCHAUB, T. AND TOMPITS, H. 2008. A meta-programming technique for debugging answer-set programs. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI), D. Fox and C. P. Gomes, Eds. AAAI Press, 448-453.
18. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP/SLP 1988), R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1070-1080.
19. GIUNCHIGLIA, E., LIERLER, Y. AND MARATEA, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36, 4, 345-377. (Pubitemid 46046675)
20. JANHUNEN, T. 2006. Some (in) translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics 16, 1-2, 35-86.
21. JANHUNEN, T. AND NIEMELä, I. 2004. GnT - A solver for disjunctive logic programs. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 2923. Springer, 331-335. (Pubitemid 38050689)
22. JANHUNEN, T., NIEMELä, I. AND SEVALNEV, M. 2009. Computing stable models via reductions to difference logic. In 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), E. Erdem, F. Lin, and T. Schaub, Eds. Lecture Notes in Computer Science, vol. 5753. Springer, 142-154.
23. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S. AND SCARCELLO, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 3, 499-562. (Pubitemid 44330485)
24. LIN, F. AND ZHAO, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157, 1-2, 115-137.
25. LIU, L. AND TRUSZCZYNSKI, M. 2005. Pbmodels - Software to compute stable models by pseudoboolean solvers. In Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), C. Baral, G. Greco, N. Leone, and G. Terracina, Eds. Lecture Notes in Computer Science, vol. 3662. Springer, 410-415.
26. MISHERGHI, G. AND SU, Z. 2006. HDD: Hierarchical delta debugging. In Proceedings of the 28th International Conference on Software Engineering (ICSE), L. J. Osterweil, H. D. Rombach, and M. L. Soffa, Eds. ACM, 142-151. (Pubitemid 46600911)
27. NAMASIVAYAM, G. AND TRUSZCZYŃSKI, M. 2009. Simple random logic programs. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), E. Erdem, F. Lin, and T. Schaub, Eds. Lecture Notes in Computer Science, vol. 5753. Springer, 223-235.
28. NIEMELä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3-4, 241-273.
29. SIMONS, P., NIEMELä, I. AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1-2, 181-234.
30. SUTTON, M., GREENE, A. AND AMINI, P. 2007. Fuzzing - Brute Force Vulnerability Discovery. Pearson Education.
31. SYRJäNEN, T. 2006. Debugging inconsistent answer set programs. In Proceedings of the 11th International Workshop on Nonmonotonic Reasoning (NMR), J. Dix and A. Hunter, Eds. IfI Technical Report Series, vol. IfI-06-04. TU Clausthal, 77-83.
32. TAKANEN, A., DEMOTT, J., AND MILLER, C. 2008. Fuzzing for Software Security Testing and Quality Assurance. Artech House.
33. TRONÇON, R. AND JANSSENS, G. 2006. A delta debugger for ILP query execution. In Proceedings of the 16th Workshop on Logic-Based Methods in Programming Environments (WLPE).
34. TSEITIN, G. S. 1983. On the complexity of derivation in propositional calculus. In Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970, J. Siekmann and G. Wrightson, Eds. Springer, 466-483.
35. WARD, J. AND SCHLIPF, J. S. 2004. Answer set programming with clause learning. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 2923. Springer, 302-313. (Pubitemid 38050686)
36. ZELLER, A. 2005. Why Programs Fail. A Guide to Systematic Debugging. Morgan Kaufmann.
37. ZELLER, A. AND HILDEBRANDT, R. 2002. Simplifying and isolating failure-inducing input. IEEE Transactions on Software Engineering 28, 2, 183-200. (Pubitemid 34198322)
38. ZHAO, Y. AND LIN, F. 2003. Answer set programming phase transition: A study on randomly generated programs. In Proceedings of the 19th International Conference on Logic Programming (ICLP), C. Palamidessi, Ed. Lecture Notes in Computer Science, vol. 2916. Springer, 239-253. (Pubitemid 37528769)