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

@article{Damsio2007TerminationOL,
  title={Termination of logic programs with imperfect information: applications and query procedure},
  author={Carlos Viegas Dam{\'a}sio and Jes{\'u}s Medina and Manuel Ojeda-Aciego},
  journal={J. Applied Logic},
  year={2007},
  volume={5},
  pages={435-458}
}
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… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS