Semantics for dynamic logic programming: A principle-based approach

José Júlio Alves Alferes; Federico Banti,; Antonio Brogi; João Alexandre Carvalho Pinheiro Leite

doi:10.1007/978-3-540-24609-1_4

Semantics for dynamic logic programming: A principle-based approach

José Júlio Alves Alferes, Federico Banti, , Antonio Brogi, João Alexandre Carvalho Pinheiro Leite

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Citations (Scopus)

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 - 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 language	English
Title of host publication	Lecture Notes in Computer Science
Pages	8-20
Number of pages	13
Volume	2923
DOIs	https://doi.org/10.1007/978-3-540-24609-1_4
Publication status	Published - 1 Jan 2004
Event	International Conference on Logic Programming and Nonmonotonic Reasoning - Duration: 1 Jan 2004 → …

Conference

Conference	International Conference on Logic Programming and Nonmonotonic Reasoning
Period	1/01/04 → …

Keywords

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

Access to Document

10.1007/978-3-540-24609-1_4

Cite this

@inproceedings{b1279c88185e4842902888bf6400e8ab,

title = "Semantics for dynamic logic programming: A principle-based approach",

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 - 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.",

keywords = "Logiic programming, Semantics, Stable models, Knowledge representation, Problem solving, Artificial intelligence, Information science",

author = "Alferes, {Jos{\'e} J{\'u}lio Alves} and Federico Banti, and Antonio Brogi and Leite, {Jo{\~a}o Alexandre Carvalho Pinheiro}",

year = "2004",

month = jan,

day = "1",

doi = "10.1007/978-3-540-24609-1_4",

language = "English",

isbn = "3-540-20721-X",

volume = "2923",

pages = "8--20",

booktitle = "Lecture Notes in Computer Science",

note = "International Conference on Logic Programming and Nonmonotonic Reasoning ; Conference date: 01-01-2004",

}

TY - GEN

T1 - Semantics for dynamic logic programming: A principle-based approach

AU - Alferes, José Júlio Alves

AU - Banti, , Federico

AU - Brogi, Antonio

AU - Leite, João Alexandre Carvalho Pinheiro

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

KW - Logiic programming

KW - Semantics

KW - Stable models

KW - Knowledge representation

KW - Problem solving

KW - Artificial intelligence

KW - Information science

UR - http://www.scopus.com/record/display.uri?eid=2-s2.0-9444258593&origin=resultslist&sort=plf-f&src=s&st1

U2 - 10.1007/978-3-540-24609-1_4

DO - 10.1007/978-3-540-24609-1_4

M3 - Conference contribution

SN - 3-540-20721-X

VL - 2923

SP - 8

EP - 20

BT - Lecture Notes in Computer Science

T2 - International Conference on Logic Programming and Nonmonotonic Reasoning

Y2 - 1 January 2004

ER -

Semantics for dynamic logic programming: A principle-based approach

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this