Skip to main content
SpringerLink
Log in

Dynamic Logic Programming

  • Chapter
  • First Online:
Prolog: The Next 50 Years

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

Abstract

Dynamic Logic Programming (DLP) is an extension to logic programming designed to support the representation of knowledge about dynamic worlds. It combines the strengths of safe, stratified, side-effect-free logic programming in defining relations with the power of simultaneous transition rules for defining dynamic operations. Because relation definitions in DLP are safe and stratified and side-effect-free, dynamic logic programs are simpler than general Prolog programs and they allow for efficient implementation. At the same time, defining operations using simultaneous transition rules adds expressive power without compromising the conceptual simplicity of logic programming. DLP is the basis for the logic programming language Epilog (aka Dynamic Prolog) [10].

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

References

  1. Clocksin, W.F., Mellish, C.S.: Programming in Prolog, 4th edn. Springer-Verlag, New York (1994)

    Book  MATH  Google Scholar 

  2. Bonner, A.J., Kifer, M.: Transaction logic programming, international conference on logic programming (ICLP) (1993)

    Google Scholar 

  3. Carro, M., Hermenegildo, M.: Concurrency in prolog using threads and a shared database (1999). International Conference on Logic Programming, pp. 320–334, MIT Press, Cambridge, MA, USA, November (1999)

    Google Scholar 

  4. Cabeza, D., Hermenegildo, M.: Distributed www programming using (Ciao) Prolog and the pillow library. Theory Pract. Logic Program. 1(3), 251–282 (2001)

    Article  Google Scholar 

  5. Costantini, S., Tocchio, A.: The DALI logic programming agent-oriented language. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 685–688. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30227-8_57

    Chapter  MATH  Google Scholar 

  6. Flesca, S., Greco, S.: Declarative semantics for active rules. Theory Pract. Logic Program. 1(1), 43–69 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fodor, P.: Practical reasoning with transaction logic programming for knowledge base dynamics, PhD Thesis, Stonybrook University (2011)

    Google Scholar 

  8. Fruehwirth, T.: Constraint Handling Rules. Cambridge University Press. ISBN 9780521877763 (2009)

    Google Scholar 

  9. Genesereth, M., Love, N., Pell, B.: The international game playing competition. AAAI Magazine (2005)

    Google Scholar 

  10. Genesereth, M.: Epilog. http://epilog.stanford.edu

  11. Genesereth, M., Chaudhri, V.: Logic Programming. Synthesis Lectures on Artificial Intelligence and Machine Learning, February (2020). https://doi.org/10.2200/S00966ED1V01Y201911AIM044

  12. Hayes, P.: Computation and deduction. In: Proceedings Second Symposium on Mathematical Foundations of Computer Science, Czechoslovakian Academy of Sciences, Czechoslovakia, pp. 105–118 (1973)

    Google Scholar 

  13. Kifer, M., Liu, A.: Declarative logic programming, ACM Books (2018)

    Google Scholar 

  14. Kowalski, R.: Algorithm = Logic + Control. In: Communications of the ACM, vol. 22, No. 7, July (1979)

    Google Scholar 

  15. Kowalski, R., Sadri, F.: LPS-A logic-based production system framework (2009)

    Google Scholar 

  16. Kowalski, R., Sadri, F.: Integrating logic programming and production systems in abductive logic programming agents (2009)

    Google Scholar 

  17. Slota, M., Leite, J.A.: EVOLP: an implementation. In: Computational Logic in Multi-Agent Systems, 8th International Workshop, CLIMA VIII, Porto, Portugal, September 10–11 (2007)

    Google Scholar 

  18. Warren, D.S.: Programming in tabled prolog. https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.49.4635

  19. Zhou, N.-F.: The language features and architecture of B-Prolog. Theory Pract. Logic Program. 12(1–2) (2011). https://doi.org/10.1017/S1471068411000445

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Stanford University, Palo Alto, USA

    Michael Genesereth

Authors
  1. Michael Genesereth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Genesereth .

Editor information

Editors and Affiliations

  1. Stony Brook University, Stony Brook, NY, USA

    David S. Warren

  2. Simon Fraser University, Burnaby, BC, Canada

    Veronica Dahl

  3. TU Wien, Vienna, Austria

    Thomas Eiter

  4. Universidad Politecnica de Madrid/IMDEA Software Institute, Madrid, Spain

    Manuel V. Hermenegildo

  5. Imperial College London, London, UK

    Robert Kowalski

  6. IBM Research, Yorktown Heights, NY, USA

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Genesereth, M. (2023). Dynamic Logic Programming. In: Warren, D.S., Dahl, V., Eiter, T., Hermenegildo, M.V., Kowalski, R., Rossi, F. (eds) Prolog: The Next 50 Years. Lecture Notes in Computer Science(), vol 13900. Springer, Cham. https://doi.org/10.1007/978-3-031-35254-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-35254-6_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-35253-9

  • Online ISBN: 978-3-031-35254-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation