JJ. Lu Department of Computer Science, Bucknell University, Lewisburg, PA 17837, USA
Signed formula is a formalism that has been applied to reasoning about multiple-valued logics. In this paper, the theory of logic programming based on signed formula is developed, and its connection to annotated logic programming investigated. It is shown that a signed formula logic program, together with annotated logic, forms a paraconsistent basis for reasoning about 'inconsistent' multiple-valued logic programs. A query processing procedure based on signed resolution is introduced.
multiple-valued logic, logic programming, signed formula, annotation, paraconsistency, query processing.
Part of the OUP Journal of Logic and Computation WWW service
Click here to register with OUP.
This page is maintained by OUP admin
Last updated 08 Jan 97
Part of the OUP Journals World Wide Web service.
Copyright Oxford University Press, 1997