A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion

We suggest a general logical formalism for Logic Programming based on a four-valued inference. We show that it forms a proper setting for representing logic programs with negation as failure of a most general kind and for describing logics and semantics that characterize their behavior. In this way...

Full description

Saved in:

Bibliographic Details
Published in:	The journal of logic programming Vol. 35; no. 2; pp. 151 - 170
Main Author:	Bochman, Alexander
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.1998
Subjects:	Foundations of logic programming Negation as failure Nonmonotonic reasoning Semantics for logic programs Negation as failure Foundations of logic programming Nonmonotonic reasoning Semantics for logic programs
ISSN:	0743-1066, 1873-5789
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We suggest a general logical formalism for Logic Programming based on a four-valued inference. We show that it forms a proper setting for representing logic programs with negation as failure of a most general kind and for describing logics and semantics that characterize their behavior. In this way we also extend the connection between Logic and Logic Programming beyond positive programs. In addition, the suggested formalism will allow us to see a reasoning about logic programs as a most simple kind of nonmonotonic reasoning in general.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0743-1066 1873-5789
DOI:	10.1016/S0743-1066(97)10005-X