On the autoepistemic reconstruction of logic programming

DOI10.1007/BF03037155MaRDI QIDQ685123zbMATH OpenOpenAlexFDO

Publication date 30 September 1993

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03037155

autoepistemic predicate logic closed world assumption completion semantics negation as failure nonmonotonic reasoning semantics of logic programs stable model semantics stratification three-valued autoepistemic semantics well- founded semantics

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Review text

We propose a new semantics of logic programs that can reflect some of the syntactical behaviours of the programs. The central notion of the semantics is the concept of a neutral clause \(p\leftarrow A\) which does not affect the behaviour of \(p\) in a program. The logic that underlies the semantics is based on an intensional extension of Levesque's autoepistemic predicate logic. It differs from existing autoepistemic logics in that it is quantificational and constructive. We will also compare and contrast our semantics with some well-known semantics. We will show how to capture the undefined value of a logic program without resorting to a three-valued nonmonotonic formalism. This is achieved by translating an incoherent AE logic program to a program with multiple AE extensions whose intersection can then be used to characterize the undefined value of a logic program.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: On the autoepistemic reconstruction of logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685123)