A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Sorted Multi-adjoint Logic Programs: Termination Results and Applications
[chapter]
2004
Lecture Notes in Computer Science
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.
doi:10.1007/978-3-540-30227-8_23
fatcat:ogcqfm2o6jgitjbuvmmdkphkhq