A New Approach to Completeness for Multi-Adjoint Logic Programming

J. Medina, Manuel Ojeda‐Aciego

The hypotheses required for the quasicompleteness theorems [5, 7] are restated in terms of termination properties of a calculation algorithm.