The Refined Extension Principle for Semantics of Dynamic Logic Programming |
| |
Authors: | Email author" target="_blank">José?Júlio?AlferesEmail author Federico?Banti Antonio?Brogi Jo?o?Alexandre?Leite |
| |
Institution: | (1) CENTRIA, Universidade Nova de Lisboa, 2829-516 Caparica, Portugal;(2) Dipartimento di Informatica, Universitá di Pisa, Pisa, Italy |
| |
Abstract: | 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. |
| |
Keywords: | Logic Programming Dynamic Logic Programming Updates Belief Change Non-monotonic Reasoning Answer-set Programming Stable Model Semantics |
本文献已被 SpringerLink 等数据库收录! |
|