Logic programming with signs and annotations

Publisher Website
Google Scholar
Abstract
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’multiplevalued logic programs. A query processing procedure based on signed resolution is introduced.

This publication has 0 references indexed in Scilit: