Skip to main content
SpringerLink
Log in

A Kripkean Semantics for Dynamic Logic Programming

  • Conference paper
  • First Online:
Logic for Programming and Automated Reasoning (LPAR 2000)

Part of the book series: Lecture Notes in Artificial Intelligence ((LNAI,volume 1955))

Abstract

The main goal of the paper is to propose a tool for a semantic specification of program updates (in the context of dynamic logic programming paradigm). A notion of Kripke structure K P associated with a generalized logic program P is introduced. It is shown that some paths in K P specify stable models of P and vice versa, to each stable model of P corresponds a path in K P. An operation on Kripke structures is defined: for Kripke structures K P and K U associated with P (the original program) and U (the updating program), respectively, a Kripke structure K P⊕U is constructed. K P⊕U specifies (in a reasonable sense) a set of updates of P by U. There is a variety of possibilities for a selection of an updated program.

“. . . non-monotonic behaviour . . . is a symptom, rather than the essence of nonstandard inference” according to [20].

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 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. 1. Alchourrón, C., Makinson, D., Gärdensfors, P. On the logic of theory change. Partialmeet contraction and revision functions. Journal of Symbolic Logic, 50:510–530 (1985) 471

    Article  MATH  MathSciNet  Google Scholar 

  2. Alferes, J. J., Pereira,_L. M. Update-programs can update programs. LNAI 11126, Springer 1996 469

    Google Scholar 

  3. Alferes, J. J., Leite, J. A., Pereira, L. M., Przymusinska, H., Przymusinski, T. C. Dynamic Logic Programming. Proc. KR’98, 1998469, 469, 469, 470, 470, 471, 471, 471, 473, 476, 477, 478, 481, 481, 481, 482, 482, 482, 485

    Google Scholar 

  4. Cadoli, M., Donini, F. M., Schaerf, M. Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence 88, 1–2, 215–251 485

    Google Scholar 

  5. Cadoli, M., Donini, F. M., Liberatore, P., Schaerf, M. Space Efficiency of Propositional Knowledge Representation Formalisms. Journal of Artificial Intelligence Research 13 (2000), 1–31 485

    Article  MATH  MathSciNet  Google Scholar 

  6. Doyle, J. A Truth Maintenance System. AI Journal 12 (1979),231–272 475, 485

    MathSciNet  Google Scholar 

  7. Elkan, C. A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems. AI Journal 43 (1990) 219–234 485

    MATH  MathSciNet  Google Scholar 

  8. Gärdenfors, P., Rott. H. Belief Revision. In D. Gabbay, C. Hogger, J. Robinson: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 4, Epistemic and Temporal Reasoning, 35–132, 1995471

    Google Scholar 

  9. Gelfond, M., Lifschitz, V. The Stable Model Semantics for Logic Programming. Proc. 5th ICLP, MIT Press, 1988, 1070–1080 471

    Google Scholar 

  10. Leite, J., Pereira, L. Generalizing Updates: from models to programs. In LNAI 1471, 1997 469, 471, 481

    Google Scholar 

  11. Leite, J., Pereira, L. Iterated Logic Programs Updates. In Proc. of JICSLP98 469, 481

    Google Scholar 

  12. Lifschitz, V., Turner, H. Splitting a Logic Program. Proc. of the 11th Int. Conf. on Logic Programming, 1994, 23–37 484

    Google Scholar 

  13. Lifschitz, V. Answer set planning. Proc. of ICLP, 1999 484

    Google Scholar 

  14. Marek, W., Truszczynski, M. Revision Programming. Theoretical Computer Science, 190 (1998), 241–277 469

    Article  MATH  MathSciNet  Google Scholar 

  15. Marek, W., Truszczynski, M. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, 375–398, Springer 1999 484

    Google Scholar 

  16. Przymusinski, T., Turner, H. Update by inference rules. The Journal of Logic Programming, 1997 469

    Google Scholar 

  17. Niemelä, I. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Workshop on computational aspects of nonmonotonic reasoning, Trento, 1998 473, 484

    Google Scholar 

  18. Šefránek, J. Dynamic Kripke Structures. Proc. of CAEPIA’97, Malaga, Spain 485

    Google Scholar 

  19. Šefránek, J. Knowledge,Belief, Revisions, and a Semantics of Non-Monotonic Reasoning. Proc. LPNMR’99, Springer 1999 485, 485

    Google Scholar 

  20. J. Van Benthem, Semantic Parallels in Natural Language and Computation, in: Logic Colloquium’ 87, eds. Ebbinghaus H.-D. et al., 1989, 331–375, North Holland, Amsterdam 469

    Google Scholar 

  21. Witteveen, C., Brewka, G. Skeptical reason maintenance and belief revision. Artificial Intelligence 61 (1993), 1–36471

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Comenius University, 811 03, Bratislava, Slovakia

    Ján Šefránek

Authors
  1. Ján Šefránek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS, Université de Paris 7, case 7012, 2 place Jussieu, 75251, Paris Cedex 05, France

    Michel Parigot

  2. Computer Science Department, University of Manchester, Oxford Rd, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Šefránek, J. (2000). A Kripkean Semantics for Dynamic Logic Programming. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44404-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41285-4

  • Online ISBN: 978-3-540-44404-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation