Abstract
This paper describes a parallel engine for Answer Set solving, based on exploitation of search parallelism. The work explores a range of alternative strategies for work sharing, describing their implementations and comparing their efficiency. These results indicate methodologies to combine sharing strategies and select the most effective one depending on properties of the problem.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blochinger, W., et al.: Parallel SAT-Checking with Lemma Exchange: Implementation and Applications. Theory & Apps. of Satisfiability Testing, ENDM (2001)
Bonacina, M.: Taxonomy of Parallel Strategies for Deduction. Annals Math. & AI 29 (2000)
Chrabakh, W., Wolski, R.: A Parallel SAT solver for the Grid. UCSB TR 2003-05 (2003)
Finkel, R., et al.: Computing Stable Models in Parallel.In: AAAI Spring Symposium (2001)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In:ILPS (1988)
Gupta, G., et al.: Parallel Execution of Prolog Programs. ACM TOPLAS 23(4), 472–602 (2001)
Lifschitz, V.: Answer Set Planning. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 373–374. Springer, Heidelberg (1999)
Lin, F., Zhao, Y.: Computing Answer Sets By SAT Solvers. In:AAAI (2002)
Marek, V.W., Truszczyński, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm, Springer, Heidelberg (1999)
Perron, L.: Search and Parallelism in Constraint Programming. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 346–361. Springer, Heidelberg (1999)
Pontelli, E., El-Kathib, O.: Construction of a Parallel Engine for ASP. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, p. 288. Springer, Heidelberg (2001)
Ranjan, D., et al.: On the Complexity of Or-Parallelism. NGC 17(3), 285–308 (1999)
Simons, P.: Extending and Implementing the Stable Model Semantics. PhD, HUT (2000)
Villaverde, K., et al.: A methodology for order-sensitive execution of non-deterministic languages on beowulf platforms. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 694–703. Springer, Heidelberg (2003)
Zhang, H., et al.: PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems. J. Symbolic Computation 11, 1–18 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le, H.V., Pontelli, E. (2005). An Investigation of Sharing Strategies for Answer Set Solvers and SAT Solvers. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_82
Download citation
DOI: https://doi.org/10.1007/11549468_82
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)