The refined extension principle for semantics of dynamic logic programming
Studia Logica 79 (1):7 - 32 (2005)
| 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 | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,711 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesC. F. M. Vermeulen (1995). Merging Without Mystery Or: Variables in Dynamics Semantics. Journal of Philosophical Logic 24 (4):405 - 450.
Jeroen Groenendijk & Martin Stokhof (1991). Dynamic Predicate Logic. Linguistics and Philosophy 14 (1):39-100.
Carlos Viegas Damásio & Luís Moniz Pereira (2002). Hybrid Probabilistic Logic Programs as Residuated Logic Programs. Studia Logica 72 (1):113 - 138.
C. F. M. Vermeulen (1993). Sequence Semantics for Dynamic Predicate Logic. Journal of Logic, Language and Information 2 (3):217-254.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads6 ( #145,761 of 551,007 )Recent downloads (6 months)1 ( #63,425 of 551,007 )How can I increase my downloads? |
My notes
Discussion
