Sorted Multi-Adjoint Logic Programs:
A general framework of logic programming allowing for the combination of several adjoint lattices of truth-values is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several extensions of these conditions are presented and related to some well-known formalisms for probabilistic logic programming.
Available from: Manuel Ojeda-Aciego
[Show abstract] [Hide abstract]
ABSTRACT: A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory to-gether with some (quasi)completeness results to general termination results, and from the neural-like implementa-tion of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approaches.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.