Termination of logic programs with imperfect information: applications and query procedure

Abstract

A general logic programming framework allowing for the combination of several adjoint lattices of truth-values is presented. The language is sorted, enabling the combination of several reasoning forms in the same knowledge base. The contribution of the paper is two-fold: on the one hand, sufficient conditions guaranteeing termination of all queries for the fix-point semantics for a wide class of sorted multi-adjoint logic programs are presented and related to some well-known probability-based formalisms; in addition, we specify a general non-deterministic tabulation goal-oriented query procedure for sorted multi-adjoint logic programs over complete lattices. We prove its soundness and completeness as well as independence of the selection ordering. We apply the termination results to probabilistic and fuzzy logic programming languages, enabling the use of the tabulation proof procedure for query answering.