Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K.A.M. Ali and R. Karlsson. The Muse Or-parallel Prolog Model and its Performance. In N. American Conf. on Logic Prog., MIT Press, 1990.
C. Baral and M. Gelfond. Logic Programming and Knowledge Representation. J. of Logic Progr., 19/20:73–148, 1994.
C. Bell et al. Implementing Stable Semantics by Linear Programming. In Logic Programming and Non-monotonic Reasoning, MIT Press, 1993.
W. Chen and D.S. Warren. Computation of Stable Models and its Integration with Logical Query Processing. Trans. on Knowledge and Data Engineering, 8(5), 1996.
P. Cholewinski, V.W. Marek, and M. Truszczynski. Default Reasoning System DeReS. In Int. Conf. on Principles of Knowledge Repr. and Reasoning, 1996.
W.F. Dowling and J.H. Gallier. Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. of Logic Programming, 3:267–289, 1984.
T. Eiter et al. The KR System dlv: Progress Report, Comparisons, and Benchmarks. In Int. Conf. on Principles of Knowledge Repr. and Reasoning, 1998.
M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programs. In Int. Symposium on Logic Programming, MIT Press, 1988.
G. Gupta, E. Pontelli et al. Parallel Execution of Prolog Programs: a Survey. Technical report, New Mexico State University, 2000.
V. Lifschitz. Answer Set Planning. In Logic Programming and Non-monotonic Reasoning, Springer Verlag, 1999.
V.W. Marek and M. Truszczynski. Stable Models and an Alternative Logic Programming Paradigm. In The Logic Programming Paradigm. Springer Verlag, 1999.
I. Niemela. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and AI, (to appear).
I. Niemela and P. Simons. An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. In LPNMR, Springer Verlag, 1997.
D. Ranjan, E. Pontelli, and G. Gupta. On the Complexity of Or-Parallelism. New Generation Computing, 17(3):285–308, 1999.
P. Rao et al. XSB: A System for Efficiently Computing WFS. In Logic Programming and Non-monotonic Reasoning. Springer Verlag, 1997.
C. Schulte. Compairing Trailing and Copying for Constraint Programming. In International Conference on Logic Programming, pages 275–289. MIT Press, 1999.
A. Van Gelder, K.A. Ross, and J.S. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3):620–650, 1991.
P. Van Hentenryck. Parallel Constraint Satisfaction in Logic Programming. In Proc. Int. Conf. on Logic Programming. MIT Press, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pontelli, E., El-Khatib, O. (2001). Construction and Optimization of a Parallel Engine for Answer Set Programming. In: Ramakrishnan, I.V. (eds) Practical Aspects of Declarative Languages. PADL 2001. Lecture Notes in Computer Science, vol 1990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45241-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-45241-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41768-2
Online ISBN: 978-3-540-45241-6
eBook Packages: Springer Book Archive