Skip to main content
SpringerLink
Log in

Two WAM Implementations of Action Rules

  • Conference paper
Logic Programming (ICLP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5366))

Included in the following conference series:

Abstract

Two implementations of Action Rules are presented in the context of a WAM-like Prolog system: one follows a meta-call based approach, the other uses suspended WAM environments on the WAM heap. Both are based on a program transformation that clarifies the semantics of Action Rules. Their implementation is compared experimentally to the TOAM-based implementation of Action Rules in B-Prolog. The suspension based approach is faster at reactivating agents on the instantiation event. The meta-call approach is easier to implement, performs overall very good and much better for synchronous events, and it is more flexible than the suspension based approaches.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Aït-Kaci, H.: The WAM: a (real) tutorial. Technical Report 5, DEC Paris Research Report (1990)

    Google Scholar 

  2. Carlsson, M.: Freeze, Indexing, and Other Implementation Issues in the WAM. In: Lassez, J.-L. (ed.) Logic Programming: Proc. of the Fourth International Conference, vol. 1, pp. 40–58. MIT Press, Cambridge (1987)

    Google Scholar 

  3. Clocksin, W., Mellish, C.: Programming in Prolog. Springer, Heidelberg (1984)

    Book  MATH  Google Scholar 

  4. Conway, M.E.: Design of a Separable Transition-Diagram Compiler. Communications of the ACM 6(7), 396–408 (1963)

    Article  MATH  Google Scholar 

  5. Demoen, B., Nguyen, P.-L.: So many WAM variations, so little time. In: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L.M., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol. 1861, pp. 1240–1254. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Shen, K.: Overview of DASWAM: Exploitation of Dependent And-parallelism. JLP 29(1-3), 245–293 (1996)

    Article  MATH  Google Scholar 

  7. Warren, D.H.D.: An Abstract Prolog Instruction Set. Technical Report 309, SRI (1983)

    Google Scholar 

  8. Wielemaker, J.: SWI-Prolog release 5.4.0 (2004), http://www.swi-prolog.org/

  9. Zhou, N.-F.: Global optimizations in a Prolog compiler for the TOAM. Journal of Logic Programming 15(4), 275–294 (1993)

    Article  MATH  Google Scholar 

  10. Zhou, N.-F.: On the Scheme of Passing Arguments in Stack Frames for Prolog. In: Proceedings of The International Conference on Logic Programming, pp. 159–174. MIT Press, Cambridge (1994)

    Google Scholar 

  11. Zhou, N.-F.: A Novel Implementation Method for Delay. In: Joint Internatinal Conference and Symposium on Logic Programming, pp. 97–111. MIT Press, Cambridge (1996)

    Google Scholar 

  12. Zhou, N.-F.: Programming Finite-Domain Constraint Propagators in Action Rules. Theory and Practice of Logic Programming (TPLP) 6(5), 483–508 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhou, N.-F.: A Register-Free Abstract Prolog Machine with Jumbo Instructions. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 455–457. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K.U.Leuven, Belgium

    Bart Demoen

  2. Institut de Mathématiques Appliquées, UCO, Angers, France

    Phuong-Lan Nguyen

Authors
  1. Bart Demoen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Phuong-Lan Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clayton School of Information Technology, Monash University, Australia

    Maria Garcia de la Banda

  2. Department of Computer Science, New Mexico State University, NM 88003, Las Cruces, USA

    Enrico Pontelli

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demoen, B., Nguyen, PL. (2008). Two WAM Implementations of Action Rules. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89982-2_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89981-5

  • Online ISBN: 978-3-540-89982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation