Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Practical Aspects of Declarative Languages

PADL 2003: Practical Aspects of Declarative Languages pp 37–57Cite as

Non-monotonic Reasoning on Beowulf Platforms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2562))

Abstract

Non-monotonic logic programming systems, such as the various implementations of Answer Set Programming (ASP), are frequently used to solve problems with large search spaces. In spite of the impressive improvements in implementation technology, the sheer size of realistic computations required to solve problems of interest often makes such problems inaccessible to existing sequential technology. This paper presents some preliminary results obtained in the development of solutions for execution of Answer Set Programs on parallel architectures. We identify different forms of parallelism that can be automatically exploited in a typical ASP execution, and we describe the execution models we have experimented with to take advantage of some of these. Performance results obtained on a Beowulf system are presented.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Balduccini and M. Gelfond. Diagnostic Reasoning with A-Prolog. Theory and Practice of Logic Programming (to appear), 2002.

    Google Scholar 

  2. C. Baral and M. Gelfond. Logic Programming and Knowledge Representation. Journal of Logic Programming, 19/20:73–148, 1994.

    Article  MathSciNet  Google Scholar 

  3. P. Cholewinski et al. Default Reasoning System DeReS. In Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 518–528. Morgan Kauffman, 1996.

    Google Scholar 

  4. W.F. Dowling and J.H. Gallier. Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. Journal of Logic Programming, 3, 1984.

    Google Scholar 

  5. D. East and M. Truszczyński. Datalog with Constraints. In National Conference on Artificial Intelligence, pages 163–168. AAAI/MIT Press, 2000.

    Google Scholar 

  6. T. Eiter et al. The KR System dlv: Progress Report, Comparisons, and Benchmarks. In Int. Conf. on Principles of Knowledge Representation and Reasoning, 1998.

    Google Scholar 

  7. R. Finkel et al. Computing Stable Models in Parallel. In AAAI Spring Symposium on Answer Set Programming, pages 72–75, 2001. AAAI/MIT Press.

    Google Scholar 

  8. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programs. In Int. Symposium on Logic Programming, pages 1070–1080. MIT Press, 1988.

    Google Scholar 

  9. G. Gupta and E. Pontelli. Stack-splitting: A Simple Technique for Implementing Or-Parallelism on Distributed Machines. In ICLP, pages 290–304, 1999. MIT Press.

    Google Scholar 

  10. G. Gupta, E. Pontelli, M. Carlsson, M. Hermenegildo, and K.M. Ali. Parallel Execution of Prolog Programs: a Survey. ACM TOPLAS, 23(4):472–602, 2001.

    Article  Google Scholar 

  11. K. Heljanko and I. Niemela. Answer Set Programming and Bounded Model Checking. In AAAI Spring Symposium, pages 90–96, 2001.

    Google Scholar 

  12. V.W. Marek and M. Truszczy’nski. Stable Models and an Alternative Logic Programming Paradigm. In The Logic Programming Paradigm. Springer Verlag, 1999.

    Google Scholar 

  13. T. Nguyen and Y. Deville. A Distributed Arc-Consistency Algorithm. Science of Computer Programming, 30(1–2):227–250, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  14. I. Niemela. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and AI, 2001.

    Google Scholar 

  15. I. Niemela and P. Simons. Smodels-An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. In LPNMR, Springer Verlag, 1997.

    Google Scholar 

  16. M. Nogueira, M. Balduccini, M. Gelfond, R. Watson, and M. Barry. An A-Prolog Decision Support System for the Space Shuttle. In PADL, Springer Verlag, 2001.

    Google Scholar 

  17. L. Perron. Search Procedures and Parallelism in Constraint Programming. In Int. Conf. on Principles and Practice of Constraint Programming, 1999. Springer Verlag.

    Google Scholar 

  18. E. Pontelli and O. El-Kathib. Construction and Optimization of a Parallel Engine for Answer Set Programming. In PADL, 2001. Springer Verlag.

    Google Scholar 

  19. D. Ranjan, E. Pontelli, and G. Gupta. On the Complexity of Or-Parallelism. New Generation Computing, 17(3):285–308, 1999.

    Article  Google Scholar 

  20. C. Schulte. Comparing Trailing and Copying for Constraint Programming. In International Conference on Logic Programming, pages 275–289. MIT Press, 1999.

    Google Scholar 

  21. V.S. Subrahmanian, D. Nau, and C. Vago. WFS + Branch and Bound = Stable Models. Transactions on Knowledge and Data Engineering, 7(3):362–377, 1995.

    Article  Google Scholar 

  22. T. Syrjanen. Implementation of Local Grounding for Logic Programs with Stable Model Semantics. Technical Report B-18, Helsinki University of Technology, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, New Mexico State University, Mexico

    E. Pontelli & F. Bermudez

  2. Dept. Computer Science, Texas Tech University, Texas

    M. Balduccini

Authors
  1. E. Pontelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Balduccini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Bermudez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department Logic and Functional Programming Group, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby B.C., Canada

    Veronica Dahl

  2. Avaya Labs, 233 Mount Airy Road, Basking Ridge, 07920, NJ, USA

    Philip Wadler

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pontelli, E., Balduccini, M., Bermudez, F. (2003). Non-monotonic Reasoning on Beowulf Platforms. In: Dahl, V., Wadler, P. (eds) Practical Aspects of Declarative Languages. PADL 2003. Lecture Notes in Computer Science, vol 2562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36388-2_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-36388-2_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00389-2

  • Online ISBN: 978-3-540-36388-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation