An Investigation of Sharing Strategies for Answer Set Solvers and SAT Solvers

摘要

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.