Skip to main content

Platypus: A Platform for Distributed Answer Set Solving

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3662))

Abstract

We propose a model to manage the distributed computation of answer sets within a general framework. This design incorporates a variety of software and hardware architectures and allows its easy use with a diverse cadre of computational elements. Starting from a generic algorithmic scheme, we develop a platform for distributed answer set computation, describe its current state of implementation, and give some experimental results.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Leone, N., Faber, W., Pfeifer, G., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (2005) (to appear)

    Google Scholar 

  3. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394–397 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fitting, M.: Fixpoint semantics for logic programming: A survey. Theoretical Computer Science 278, 25–51 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38, 620–650 (1991)

    MATH  Google Scholar 

  6. Finkel, R., Marek, V., Moore, N., Truszczynski, M.: Computing stable models in parallel. In: Provetti, A., Son, T. (eds.) Proceedings of AAAI Spring Symposium on Answer Set Programming, pp. 72–75. AAAI/MIT Press (2001)

    Google Scholar 

  7. Hirsimäki, T.: Distributing backtracking search trees. Technical report, Helsinki University of Technology (2001)

    Google Scholar 

  8. Pontelli, E., Balduccini, M., Bermudez, F.: Non-monotonic reasoning on beowulf platforms. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 37–57. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Finkel, R., Manber, U.: DIB — a distributed implementation of backtracking. ACM Transactions on Programming Languages and Systems 9, 235–256 (1987)

    Article  Google Scholar 

  10. Gupta, G., Pontelli, E., Ali, K., Carlsson, M., Hermenegildo, M.: Parallel execution of prolog programs: a survey. ACM Transactions on Programming Languages and Systems 23, 472–602 (2001)

    Article  Google Scholar 

  11. Chassin de Kergommeaux, J., Codognet, P.: Parallel logic programming systems. ACM Computing Surveys 26, 295–336 (1994)

    Article  Google Scholar 

  12. Zhang, H., Bonacina, M., Hsiang, J.: PSATO: a distributed propositional prover and its application to quasigroup problems. Journal of Logic and Computation 21, 543–560 (1996)

    MATH  MathSciNet  Google Scholar 

  13. Blochinger, W., Sinz, C., Küchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing 29, 969–994 (2003)

    Article  Google Scholar 

  14. Inoue, K., Koshimura, M., Hasegawa, R.: Embedding negation as failure into a model generation theorem prover. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 400–415. Springer, Heidelberg (1992)

    Google Scholar 

  15. Gropp, W., Lusk, E., Thakur, R.: Using MPI-2: Advanced Features of the Message-Passing Interface. The MIT Press, Cambridge (1999)

    Google Scholar 

  16. http://www.cs.uni-potsdam.de/nomore

  17. http://asparagus.cs.uni-potsdam.de

  18. http://www.cs.uni-potsdam.de/platypus

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gressmann, J., Janhunen, T., Mercer, R.E., Schaub, T., Thiele, S., Tichy, R. (2005). Platypus: A Platform for Distributed Answer Set Solving. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_18

Download citation

  • DOI: https://doi.org/10.1007/11546207_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28538-0

  • Online ISBN: 978-3-540-31827-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics