Title: Approximation fixpoint theory and the semantics of logic and answers set programs
Authors: Denecker, Marc
Bruynooghe, Maurice
Vennekens, Joost
Issue Date: 2012
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:7265
Host Document: Correct Reasoning, Essays on Logic-Based AI in Honor of Vladimir Lifschitz pages:178 -194
Abstract: Approximation Fixpoint Theory was developed as a fixpoint
theory of lattice operators that provides a uniform formalization of four
main semantics of three major nonmonotonic reasoning formalisms. The
aim of this paper is, first, to clarify the application of this fixpoint theory
to define the stable and well-founded semantics of logic programs, and
second, to show the remarkable power of this theory for defining natural
and elegant versions of these semantics for extensions of logic and answer
set programs. In particular, we here consider extensions with general
rule bodies, general interpretations (also non-Herbrand interpretations)
and aggregates. We also investigate the relationship with the equilibrium
semantics of nested answer set programs, on the formal and the informal
ISBN: 978-3-642-30742-3
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IHb
Appears in Collections:Informatics Section
Technologiecluster Computerwetenschappen
Computer Science Technology TC, Technology Campus De Nayer Sint-Katelijne-Waver

Files in This Item:
File Description Status SizeFormat
LifschitzSubmitted.pdf Published 326KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.