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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The journal of logic programming Ročník 35; číslo 2; s. 151 - 170
Hlavní autor: Bochman, Alexander
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.05.1998
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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