## Logic Programs as Definitions: a framework for and an evaluation of its semantics

### BibTeX

@MISC{Denecker_logicprograms,

author = {Marc Denecker and Danny De Schreye},

title = {Logic Programs as Definitions: a framework for and an evaluation of its semantics},

year = {}

}

### OpenURL

### Abstract

We present a formal theory on the semantics of logic programs and abductive logic programs with first order integrity constraints. The theory provides an elegant, uniform formalisation for the three most widely accepted families of semantics: completion semantics, stable semantics and wellfounded semantics. The theory is based on the notion of a justification, which is a mathematical object describing, given an interpretation, how the truth value of a literal can be justified on the basis of the program. We identify the three different notions of justifications underlying the three types of semantics. In addition, we defend an alternative declarative reading of logic programming, different from the current predominant view of logic programming as a form of defeasible logic. Logic programs are interpreted as sets of definitions of predicates. The framework is suited to evaluate the extent to which this intuition is supported by the three classes of semantics. 1 Introduction. At this mo...