Computing multiple-valued logic programs

Abstract

The logic of signed formula can be used to reason about a wide variety of multiple-valued logics \cite{hah94,lmr96}. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in \cite{lu96}. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and special cases, and applications to bilattice logic programming and truth-maintenance are analyzed.