The significance of memory costs in answer set solver implementation

Journal of Logic and Computation

Volumn 19, Issue 4, 2009, Pages 615-641

  Brain, Martin ^a   De Vos, Marina ^a  

^a University of Bath   (United Kingdom)

Author keywords

Answer set programming; Answer set solvers; Cache utilization; Declarative programming systems; Optimization of memory bound programs

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; ANSWER SET SOLVERS; BANDWIDTH LIMIT; CACHE MISS; CACHE UTILIZATION; DECLARATIVE PROGRAMMING; DECLARATIVE PROGRAMMING SYSTEMS; IMPLEMENTATION CHANGES; IMPLEMENTATION COST; INPUT PROGRAMS; MEMORY COST; PROCESSOR MEMORY; PROCESSOR PERFORMANCE; QUALITATIVE ASSESSMENTS; QUANTITATIVE ASSESSMENTS; SMODELS; SMODELS SOLVER; SOLVER PERFORMANCE;

COMPUTER PROGRAMMING; COSTS;

CACHE MEMORY;

EID: 68549135155     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exn038     Document Type: Conference Paper

References (42)

1. Advanced Micro Devices, Inc.AMD64 Architecture Programmer's Manual, 1.0 edn, Sunnyvale, CA, USA, 2005.
2. Advanced Micro Devices, Inc. Software Optimization Guide for AMD64 Processors, 3.06 edn, Sunnyvale, CA, USA, 2005.
3. Advanced Micro Devices, Inc. BIOS and Kernel Developers Guide for AMD Athlon 64 and AMD Opteron Processors, 3.30 edn, Sunnyvale, CA, USA, 2006.
4. C.Anger, M. Gebser, T. Linke,A. Neumann, and T. Schaub. The nomore++ approach to answer set solving. In Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Vol. 3835 of Lecture Notes in Computer Science, pp. 95-109. Springer, Heidelberg, Germany, 2005.
5. M. Balduccini, M. Gelfond, and M. Nogueira. Reasoning about digital circuits in a-prolog. Technical Report I, The University of Texas at El Paso and Texas Tech University, 2000.
6. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK, 2003.
7. C. Baral and M. Gelfond. Reasoning agents in dynamic domains. In Proceedings of the Logic-based Artificial Intelligence, pp. 257-279. Kluwer Academic Publishers, Heidelberg, Germany, 2000.
8. E.Berger,B. Zorn, andK.McKinley. Reconsidering custom memory allocation. ACM SIGPLAN Notices, Proceedings of the OOPSLA 2002 Session on Storage Management. Vol. 37, pp. 1-12. The Association for Computing Machinery, New York, NY, USA, 2002.
9. M. Brain, T. Crick, M. De Vos, and J. Fitch. Toast: applying answer set programming to superoptimisation. In Proceedings of the International Conference on Logic Programming (ICLP'06), Vol. 4079 of Lecture Notes in Computer Science, Springer-Verlag, pp. 270-284. 2006.
10. M. Brain, M. De Vos, and K. Satoh. Smodels-ie: improving the cache utilisation of smodels. In Proceedings of Answer Set Programming: Advances in Theory and Implementation, S. Costantini and R. Watson, eds, pp. 309-313. 2007.
11. O. Cliffe, M. De Vos, and J. Padget. Specifying and analysing agent-based social institutions using answer set programming. In Proceedings of the Selected revised papers from the workshops on Agent, Norms and Institutions for Regulated Multi-Agent Systems (ANIREM) and Organizations and Organization Oriented Programming (OOOP) at AAMAS'05, Vol. 3913 of Lecture Notes in Computer Science, pp. 99-113. Springer, Heidelberg, Germany, 2006.
12. N. Eén and N. Sörensson. An extensible sat-solver. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT'03), Vol. 2919 of Lecture Notes in Computer Science. pp. 502-518. Springer, Heidelberg, Germany, 2003.
13. E. Erdem, V. Lifschitz, L. Nakhleh, and D. Ringe. Reconstructing the evolutionary history of indo-european languages using answer set programming. In Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages. Vol. 2562 of Lecture Notes in Computer Science, pp. 160-176. Springer, Heidelberg, Germany, 2003.
14. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Conflict-driven answer set solving. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, M. Veloso, ed., pp. 386-392. AAAI Press, Menlo Park, CA, USA, 2007.
15. M. Gebser, L. Liu, G. Namasivayam, A. Neumann, T. Schaub, and M. Truszczyński. The first answer set programming system competition. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07). Vol. 4483 of Lecture Notes in Computer Science. pp. 3-17. Springer, Heidelberg, Germany, 2007.
16. M. Gebser, T. Schaub, and S. Thiele. Gringo: a new grounder for answer set programming. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, Vol. 4670 of Lecture Notes in Computer Science, pp. 458-459. Springer, Heidelberg, Germany, 2007.
17. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, pp. 1070-1080, The MIT Press, Seattle, Washington, 1988.
18. E. Giunchiglia, Y. Lierler, and M. Maratea. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning, 36, 345-377, 2006.
19. GNU Project. Gnu general public license. Available at http://www.gnu.org/licenses/gpl.html (Last accessed on 19 July 2008).
20. S. Grell,T. Schaub, and J. Selbig. Modelling biological networks by action languages via answer set programming. In Proceedings of the International Conference on Logic Programming (ICLP'06). Vol. 4079 of Lecture Notes in Computer Science, pp. 285-299. Springer-Verlag, Berlin, 2006.
21. J. Gressmann, T. Janhunen, R. Mercer, T. Schaub, S. Thiele, and R. Tichy. Platypus:A platform for distributed answer set solving. In Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning. Vol. 3662 of Lecture Notes in Computer Science, pp. 227-239. Springer, Heidelberg, Germany, 2005.
22. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. 4th edn. Morgan Kaufmann Publications, San Francisco, CA, USA, 2007.
23. K. Konczak. Voting theory in answer set programming. In Proceedings of the Twentieth Workshopon Logic Programmin (WLP'06), INFSYS RR-1843-06-02 in Technical Report Series, pp. 45-53. Technische Universität Wien, 2006.
24. P. Kongetira, K. Aingaran, and K. Olukotun. Niagara: a 32-way multithreaded sparc processor. IEEE Micro, 25, 21-29, 2005.
25. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7, 499-562, 2006.
26. Y. Lierler and M. Maratea. Cmodels-2: sat-based answer set solver enhanced to non-tight programs. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning. Vol. 2923 of Lecture Notes in Computer Science, pp. 346-350. Springer, Heidelberg, Germany, 2003.
27. Vladimir Lifschitz. Answer set programming and plan generation. Journal of Artificial Intelligence, 138, 39-54, 2002.
28. F. Lin and Y. Zhao. Assat: computing answer sets of a logic program by sat solvers. Journal of Artificial Intelligence, 157, 115-137, 2004.
29. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: engineering an efficient sat solver. In Proceedings of the 38th Conference on Design Automation. pp. 530-535. IEEE, Los Alamitos, CA, USA, 2001.
30. G.Namasivayam andM.Truszczyński.An smodels system with limited lookahead computation. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07). Vol. 4483 of Lecture Notes in Computer Science, pp. 278-283. Springer, Heidelberg, Germany, 2007.
31. N. Nethercote and A. Mycroft. The cache behaviour of large lazy functional programs on stock hardware. ACM SIGPLAN Notices, 38, 44-55, 2003.
32. M. Nogueira, M. Balduccini, M. Gelfond, R. Watson, and M. Barry.Aa-prolog decision support system for the space shuttle. In Proceedings of the Answer Set Programming: Towards Efficient and Scalable Knowledge Represenation and Reasoning. American Association for Artificial Intelligence Press, Stanford (Palo Alto), California, US, 2001.
33. M. Ruffolo, N. Leone, M. Manna, D. Saccà, and A. Zavatto. Exploiting asp for semantic information extraction. In Answer Set Programming. Vol. 142 of CEUR Workshop Proceedings. CEUR-WS.org, Tilburg University, The Netherlands, 2005.
34. O. Sabuneu, F. Alpaslan, and V. Akman. Using criticalities as a heuristic for answer set programming. In Proceedings of the Answer Set Programming: Advances in Theory and Implementation, M. De Vos and A. Provetti, eds, CEUR-WS.org, Tilburg University, The Netherlands, 2003.
35. B. Schneier. Applied Cryptography, 2nd edn. John Wiley & Sons, Inc., Hoboken, NJ, USA, 1996.
36. T. Syrjänen. Omega-restricted logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning. Vol. 2173 of Lecture Notes in computer Science, pp. 267-279. Springer, Heidelberg, Germany, 2001.
37. T. Syrjänen and I. Niemelä. The smodels system. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning. Vol. 2173 of Lecture Notes in Computer Science, pp. 434-438. Springer, Heidelberg, Germany, 2001.
38. The asparagus project. Available at http://asparagus.cs.uni-potsdam.de/ (Last accessed on 19 July 2008).
39. The oprofile project. http://oprofile.sourceforge.net/ (Last accessed on 19 July 2008).
40. J. Ward and S. Schlipf. Answer set programming with clause learning. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning. Vol. 2923 of Lecture Notes in Computer Science, pp. 302-313. Springer, Heidelberg, Germany, 2004.
41. L. Zhang and S. Malik. Cache performance of sat solvers: a case study for efficient implementation of algorithms. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT'03), Vol. 2919 of Lecture Notes in Computer Science, pp. 287-298. Springer, Heidelberg, Germany, 2003.
42. Author's website.Available at http://www.cs.bath.ac.uk/∼mjb/ (Last accessedon 19 July 2008).