Semantics for dynamic logic programming: A principle-based approach

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Citations (Scopus)


Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the question of which are most adequate to model updates. A systematic approach to face this question is to identify general principles against which such semantics could be evaluated. In this paper we motivate and introduce a new such principle - the refined extension principle - which is complied with by the stable model semantics for (single) logic programs. It turns out that none of the existing semantics for logic program updates, even though based on stable models, complies with this principle. For this reason, we define a refinement of the dynamic stable model semantics for Dynamic Logic Programs that complies with the principle.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science
Number of pages13
Publication statusPublished - 1 Jan 2004
EventInternational Conference on Logic Programming and Nonmonotonic Reasoning -
Duration: 1 Jan 2004 → …


ConferenceInternational Conference on Logic Programming and Nonmonotonic Reasoning
Period1/01/04 → …


  • Logiic programming
  • Semantics
  • Stable models
  • Knowledge representation
  • Problem solving
  • Artificial intelligence
  • Information science


Dive into the research topics of 'Semantics for dynamic logic programming: A principle-based approach'. Together they form a unique fingerprint.

Cite this