Sorted Multi-Adjoint Logic Programs: Termination Results and Applications
by
C. V. Damásio
,
J. Medina
,
M. Ojeda-Aciego
| Citations: | 14 - 4 self |
BibTeX
@MISC{Damásio_sortedmulti-adjoint,
author = {C. V. Damásio and J. Medina and M. Ojeda-Aciego},
title = {Sorted Multi-Adjoint Logic Programs: Termination Results and Applications},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
