The Refined Extension Principle for Semantics of Dynamic Logic Programming

Research output: Contribution to journalArticlepeer-review

27 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. Such principle 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 generalisations of the stable model semantics, comply 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
Pages (from-to)7-32
Number of pages26
JournalStudia Logica
Issue number1
Publication statusPublished - Feb 2005


  • Logic programming
  • stable models
  • Semantics
  • Dynamic Logic Programming
  • Answer-set Programming
  • Non-monotonic Reasoning
  • Updates
  • Stable Model Semantics


Dive into the research topics of 'The Refined Extension Principle for Semantics of Dynamic Logic Programming'. Together they form a unique fingerprint.

Cite this