On Probing and Multi-Threading in Platypus

The PLATYPUS approach offers a generic platform for distributed answer set solving, accommodating a variety of different architectures for distributing the search for answer sets across different processes and different search modes for modifying search behaviour. We describe two major extensions of PLATYPUS. First, we present its probing mode which provides a controlled non-linear traversal of the search space. Second, we present its new multi-threading architecture allowing for intra-process distribution. Both contributions are underpinned by experimental results illustrating their computational impact.

[1]  Maged M. Michael,et al.  Simple, fast, and practical non-blocking and blocking concurrent queue algorithms , 1996, PODC '96.

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

[3]  Fangzhen Lin,et al.  ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..

[4]  Yannis Dimopoulos,et al.  Towards Local Search for Answer Sets , 2002, ICLP.

[5]  G. Brewka.  Principles of Knowledge Representation , 1996 .

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

[7]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[8]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[9]  Maurice Herlihy,et al.  A methodology for implementing highly concurrent data objects , 1993, TOPL.

[10]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[11]  John David Valois.  Lock-free data structures , 1996 .

[12]  Chitta Baral.  Knowledge Representation, Reasoning and Declarative Problem Solving: Query answering and answer set computing systems , 2003 .

[13]  John S. Schlipf,et al.  Answer Set Programming with Clause Learning , 2004, LPNMR.

[14]  Yuliya Lierler,et al.  A SAT-based polynomial space algorithm for answer set programming , 2004, NMR.

[15]  Enrico Pontelli,et al.  Non-monotonic Reasoning on Beowulf Platforms , 2003, PADL.

[16]  Arthur B. Markman,et al.  Knowledge Representation , 1998 .

[17]  Robert B. Ross,et al.  Using MPI-2: Advanced Features of the Message Passing Interface , 2003, CLUSTER.

[18]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

[19]  Joao Marques-Silva,et al.  Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability , 2000, CP.

[20]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[21]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

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

[23]  Victor W. Marek,et al.  Computing stable models in parallel , 2001, Answer Set Programming.

[24]  V. Lifschitz,et al.  Foundations of Logic Programming , 1997 .