Please use this identifier to cite or link to this item:
Authors: Cleary, John G.
Keywords: Computer Science
Issue Date: 1-Feb-1987
Abstract: A logic using three truth values (true, false, undefined) is described together with its Horn clause subset and a procedural interpretation. The resulting logic programming language allows clauses to affirm both positive and negative information and can test whether a goal is definitely false or is just not provably true (standard negation by failure) as well as other possibilities including whether it is unknown (cannot be proven either true or false). The major theoretical results characterizing classical logic programs can be carried over to this context, including the equivalence of a programs answer set with the minimal Herbrand universe and least fixed point semantics as well as the correctness and completeness of SLD-resolution. The logic can be easily implemented within existing Prolog interpreters.
Appears in Collections:Cleary, John

Files in This Item:
File Description SizeFormat 
1987-261-09.pdf2.11 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.