Well founded semantics for logic program updates

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)


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 languageEnglish
Title of host publicationLecture Notes in Artificial Intelligence
Number of pages12
Publication statusPublished - 1 Jan 2004
EventIbero-American Conference on Artificial Intelligence -
Duration: 1 Jan 2004 → …


ConferenceIbero-American Conference on Artificial Intelligence
Period1/01/04 → …


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


Dive into the research topics of 'Well founded semantics for logic program updates'. Together they form a unique fingerprint.

Cite this