Sciweavers

ASP
2001
Springer

Computing stable models in parallel

13 years 8 months ago
Computing stable models in parallel
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicability, despite recent impressive gains in performance, remains limited. One way to deal with limitations of answer-set programming is to exploit parallelism. In this paper, we design and implement a parallel algorithm, parstab, that computes stable models of logic programs. We describe preliminary experimental studies of parstab, running it on seven machines and comparing its performance to a serial execution. Our results are encouraging. For some problems, significant speedups are obtained by running parstab on multiple machines.
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where ASP
Authors Raphael A. Finkel, Victor W. Marek, Neil Moore, Miroslaw Truszczynski
Comments (0)