An investigation of sharing strategies for answer set solvers and SAT solvers

Authors:
Hung Viet Le;Enrico Pontelli
Affiliations:
Department of Computer Science, New Mexico State University;Department of Computer Science, New Mexico State University
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 5
Cited 1

PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
On the complexity of or-parallelism

New Generation Computing
Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)
A taxonomy of parallel strategies for deduction

Annals of Mathematics and Artificial Intelligence
Search Procedures and Parallelism in Constraint Programming

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming

Dynamic scheduling in parallel answer set programming solvers

SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.