2001 · 25 citations · 7 references
ComputingComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingData ParallelismLogic ProgrammingParallel Algorithm DesignParallel ArchitecturesParallel Computing SystemsParallel Performance AnalysisAnswer Set ProgrammingExperimental StudiesParallel Logic ProgrammingParallel Program DesignParallel ProgrammingParallel Solvers
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.
7
The well-founded semantics for general logic programs
Allen Van Gelder, Kenneth A. Ross, John S. Schlipf · Journal of the ACM · 1991 · 1.7K citations
Henry Kautz, Bart Selman · 1992 · 828 citations
Wiktor Marek, Mirosław Truszczyński · Journal of the ACM · 1991 · 422 citations · Full text
The KR system dlv: progress report, comparisons and benchmarks
Thomas Eiter, Nicola Leone, Cristinel Mateis et al. · 1998 · 210 citations