Experimental analysis of graph-based answer set computation over parallel and distributed architectures

Journal of Logic and Computation

Volumn 19, Issue 4, 2009, Pages 697-715

  Grossi, Giuliano ^a   Marchi, Massimo ^b   Pontelli, Enrico ^c   Provetti, Alessandro ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF MESSINA   (Italy)

^c New Mexico State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; BEOWULF; BRANCH AND BOUNDS; CENTRALIZED ARCHITECTURE; COMMUNICATION OVERHEADS; COMPACT REPRESENTATION; DISTRIBUTED ARCHITECTURE; EXPERIMENTAL ANALYSIS; GRAPH-BASED; LOGIC PROGRAMS; SEARCH SUBSPACE;

ARCHITECTURAL DESIGN; COMPUTATION THEORY; LOGIC PROGRAMMING;

MESSAGE PASSING;

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

References (21)

1. M. Balduccini,E. Pontelli, O. Elkhatib, and H. Le. Issues in parallel execution of non-monotonic reasoning systems. Parallel Computing, 31, 608-647, 2005.
2. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK, 2003.
3. W. Blochinger, C. Sinz, and W. Kuchlin. Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing, 29, 969-994, 2003.
4. G. Brignoli. Extended Dependency Graphs for the Analysis of Logic Programs. Masters Thesis in Informatics (in Italian), University of Milan, 1998.
5. G. Brignoli, S. Costantini, O. D'Antona, and A. Provetti. Characterizing and computing stable models of logic programs: the non-stratified case. In Proceedings of Conference on Information Technology, pp. 197-201. OITS, Bhubaneswar, India, 1999.
6. W. Chrabakh and R. Wolski. Gridsat: a chaff-based distributed sat solver for the grid. In Proceedings of Supercomputing '03, ACM, New York, 2003.
7. S. Costantini, O. D'Antona, and A. Provetti. On the equivalence and range of applicability of graph-based representations of logic programs. Information Processing Letters, 84, 241-249, 2002.
8. S. Costantini and A. Provetti. Normal forms for answer set programming. Theory and Practice of Logic Programming, 5, 747-760, 2005.
9. E. Erdem and V. Lifschitz. Tight logic programs. Theory and Practice of Logic Programming (TPLP), 3, 499-518, 2003.
10. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9, 365-387, 1991.
11. E. Giunchiglia, Y. Lierler, and M. Maratea. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning, 36, 345-377, 2006.
12. 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 Logic Programming and Non-monotonic Reasoning, pp. 227-239. Springer-Verlag, Berlin, 2005.
13. G. Grossi and M. Marchi. A new algorithm for answer set computation. In Proceedings of the Answer Set Programming Workshop (ASP05). Vol. 142 of Lecture Notes in CEUR Workshop series, pp. 155-162. CEUR, Aachen, 2005.
14. G. Grossi, M. Marchi, and A. Provetti. Improving the adjsolver algorithm for asp kernel programs. In Answer Set Programming Workshop (ASP07), S. Costantini and R. Watson eds, pp. 21-32. 2007.
15. K. Konczak, T. Linke, and T. Schaub. Graphs and colourings for answer set programming: preliminary report. In Proceedings of the Answer Set Programming Workshop (ASP03). Vol. 76 of Lecture Notes in CEUR Workshop series, pp. 43-56. CEUR, Aachen, 2003.
16. Z. Lonc and M. Truszczyński. Computing stable models: worst-case performance estimates. In ICLP '02: Proceedings of the 18th International Conference on Logic Programming, LNCS, pp. 347-362. Springer-Verlag, Berlin, 2002.
17. W. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective, pp. 375-398. Springer-Verlag, Berlin, 1999.
18. J. W. Moon and L. Moser. On cliques in graphs. Israel Journal of Mathematics, 3, 23-28, 1965.
19. P. Simons,I. Niemelä, andT.Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138, 181-234, 2002.
20. Solvers. Web location of some of the most known asp solvers. Aspps: http://cs.engr.uky.edu/ai/aspps/ CMODELS: http://www.cs.utexas.edu/users/ tag/ Clasp: http://www.cs.uni-potsdam.de/clasp/ DLV: http://www.dbai.tuwien.ac. at/proj/dlv/ Smodels: http://www.tcs.hut.fi/Software/smodels/, 2008.
21. I. Spence. tts: a sat-solver for small, difficult instances. Journal on Satisfiability, Boolean Modeling and Computation, 4, 173-190, 2008.