Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures

This article presents a distributed version of the adjSolver algorithm for computing the answer sets of logic programs. adjSolver operates a classical branch-and-bound structure; its intrinsic parallelism is exploited to control, with a centralized architecture, the delegation of promising search subspaces to distributed handling agents. adjSolver has been implemented and tested on a Beowulf platform, using MPI message passing. The communication overhead was minimized by adopting a compact representation of the data exchanged among agents and by reusing previously-computed partial solutions.

[1]  Enrico Pontelli,et al.  Issues in parallel execution of non-monotonic reasoning systems , 2005, Parallel Comput..

[2]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[3]  Stefania Costantini,et al.  On the equivalence and range of applicability of graph-based representations of logic programs , 2002, Inf. Process. Lett..

[4]  Yuliya Lierler,et al.  Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.

[5]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

[6]  Robert E. Mercer,et al.  Platypus: A Platform for Distributed Answer Set Solving , 2005, LPNMR.

[7]  J. Moon,et al.  On cliques in graphs , 1965 .

[8]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[9]  R. Wolski,et al.  GridSAT: A Chaff-based Distributed SAT Solver for the Grid , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[10]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[11]  Ivor T. A. Spence.  tts: A SAT-Solver for Small, Difficult Instances , 2008, J. Satisf. Boolean Model. Comput..

[12]  Miroslaw Truszczynski,et al.  Computing stable models: worst-case performance estimates , 2002, Theory and Practice of Logic Programming.

[13]  Wolfgang Küchlin,et al.  Parallel propositional satisfiability checking with distributed dynamic learning , 2003, Parallel Comput..

[14]  Giuliano Grossi,et al.  A New Algorithm for Answer Set Computation , 2005, Answer Set Programming.

[15]  Stefania Costantini,et al.  Normal forms for answer sets programming , 2005, Theory Pract. Log. Program..

[16]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[17]  Esra Erdem,et al.  Tight logic programs , 2003, Theory and Practice of Logic Programming.