Well founded semantics for logic program updates

Federico Banti,; José Júlio Alves Alferes; Antonio Brogi

doi:10.1007/978-3-540-30498-2_40

Well founded semantics for logic program updates

Federico Banti, , José Júlio Alves Alferes, Antonio Brogi

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

8 Citations (Scopus)

Abstract

Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models semantics of normal, extended (with explicit negation) or generalized (with default negation in rule heads) logic programs. In this paper we propose a well founded semantics for logic programs updates. We motivate our proposal with both practical and theoretical argumentations. Various theoretical results presented here show how our proposal is related to the stable model approach and how it extends the well founded semantics of normal and generalized logic programs.

Original language	English
Title of host publication	Lecture Notes in Artificial Intelligence
Pages	397-407
Number of pages	12
Volume	3315
DOIs	https://doi.org/10.1007/978-3-540-30498-2_40
Publication status	Published - 1 Jan 2004
Event	Ibero-American Conference on Artificial Intelligence - Duration: 1 Jan 2004 → …

Conference

Conference	Ibero-American Conference on Artificial Intelligence
Period	1/01/04 → …

Keywords

Logic programming
stable models
Semantics
Theorem proving
Artificial intelligence
Formal languages
Formal logic
Information analysis
Knowledge based systems
Mathematical models
Mathematical operators
Set theory

Access to Document

10.1007/978-3-540-30498-2_40

Cite this

@inproceedings{da916eff1636400ab07b5bd15ba14e5e,

title = "Well founded semantics for logic program updates",

abstract = "Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models semantics of normal, extended (with explicit negation) or generalized (with default negation in rule heads) logic programs. In this paper we propose a well founded semantics for logic programs updates. We motivate our proposal with both practical and theoretical argumentations. Various theoretical results presented here show how our proposal is related to the stable model approach and how it extends the well founded semantics of normal and generalized logic programs.",

keywords = "Logic programming, stable models, Semantics, Theorem proving, Artificial intelligence, Formal languages, Formal logic, Information analysis, Knowledge based systems, Mathematical models, Mathematical operators, Set theory",

author = "Federico Banti, and Alferes, {Jos{\'e} J{\'u}lio Alves} and Antonio Brogi",

year = "2004",

month = jan,

day = "1",

doi = "10.1007/978-3-540-30498-2_40",

language = "English",

isbn = "3-540-23806-9",

volume = "3315",

pages = "397--407",

booktitle = "Lecture Notes in Artificial Intelligence",

note = "Ibero-American Conference on Artificial Intelligence ; Conference date: 01-01-2004",

}

TY - GEN

T1 - Well founded semantics for logic program updates

AU - Banti, , Federico

AU - Alferes, José Júlio Alves

AU - Brogi, Antonio

PY - 2004/1/1

Y1 - 2004/1/1

N2 - Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models semantics of normal, extended (with explicit negation) or generalized (with default negation in rule heads) logic programs. In this paper we propose a well founded semantics for logic programs updates. We motivate our proposal with both practical and theoretical argumentations. Various theoretical results presented here show how our proposal is related to the stable model approach and how it extends the well founded semantics of normal and generalized logic programs.

AB - Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models semantics of normal, extended (with explicit negation) or generalized (with default negation in rule heads) logic programs. In this paper we propose a well founded semantics for logic programs updates. We motivate our proposal with both practical and theoretical argumentations. Various theoretical results presented here show how our proposal is related to the stable model approach and how it extends the well founded semantics of normal and generalized logic programs.

KW - Logic programming

KW - stable models

KW - Semantics

KW - Theorem proving

KW - Artificial intelligence

KW - Formal languages

KW - Formal logic

KW - Information analysis

KW - Knowledge based systems

KW - Mathematical models

KW - Mathematical operators

KW - Set theory

U2 - 10.1007/978-3-540-30498-2_40

DO - 10.1007/978-3-540-30498-2_40

M3 - Conference contribution

SN - 3-540-23806-9

VL - 3315

SP - 397

EP - 407

BT - Lecture Notes in Artificial Intelligence

T2 - Ibero-American Conference on Artificial Intelligence

Y2 - 1 January 2004

ER -

Well founded semantics for logic program updates

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this