The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The Muse Or-parallel Prolog model and its performance
Proceedings of the 1990 North American conference on Logic programming
Implementing stable semantics by linear programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
On the complexity of or-parallelism
New Generation Computing
Proceedings of the 1999 international conference on Logic programming
Comparing trailing and copying for constraint programming
Proceedings of the 1999 international conference on Logic programming
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures
Proceedings of the 17th International Conference on Logic Programming
Non-monotonic Reasoning on Beowulf Platforms
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
An optimal data structure to handle dynamic environments in non-deterministic computations
Computer Languages, Systems and Structures
Hi-index | 0.00 |
In this paper we study the use of parallelism to speed up execution of Answer Set Programs (ASP). ASP is an emerging programming paradigm which combines features from constraint programming, logic programming, and non-monotonic reasoning, and has found relevant applications in areas such as planning and intelligent agents. We propose different methodologies to parallelize execution of ASP programs, and we describe a prototype which exploits one form of parallelism.