An algorithm for the solution of multi-valued logic programming

Abstract

Logic programming using the Horn clause in the field of artificial intelligence is considered. It has been previously reported that the solution of multivalued logic programming with many truth values is obtained by solving the multivalued logic formula expressed in the Postian algebra. In this paper, expanding the idea that unnecessary search can be avoided by using an indeterminate value, an algorithm that solves three-valued logic programming using four-valued logic is obtained. The relation between the Horn clause and Postian algebra is established.<>