On the autoepistemic reconstruction of logic programming
type: Item
instance of: scholarly article
title: On the autoepistemic reconstruction of logic programming
zbMATH Open document ID: 0776.68028
DOI: 10.1007/BF03037155
author: Juan-Miguel Gracia
published in: New Generation Computing
publication date: 1993-09-30T00:00:00Z
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.
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 417073
zbMATH Keywords: negation as failure
zbMATH Keywords: nonmonotonic reasoning
zbMATH Keywords: closed world assumption
zbMATH Keywords: completion semantics
zbMATH Keywords: stable model semantics
zbMATH Keywords: stratification
zbMATH Keywords: well- founded semantics
zbMATH Keywords: three-valued autoepistemic semantics
zbMATH Keywords: semantics of logic programs
zbMATH Keywords: autoepistemic predicate logic
MaRDI profile type: Publication
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: A kripke-kleene semantics for logic programs*
cites work: An intensional epistemic logic
cites work: Negation in logic programming
cites work: Q3030269
cites work: Q5750425
cites work: Q3486550
cites work: Q3826525
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3972030
cites work: Q3348437
cites work: Three-valued nonmonotonic formalisms and semantics of logic programs
cites work: A logic for default reasoning
cites work: The well-founded semantics for general logic programs
full work available at URL: https://doi.org/10.1007/bf03037155
OpenAlex ID: W2025884596
description: scientific article; zbMATH DE number 417073