作者: C. V. Damásio , J. Medina , M. Ojeda-Aciego
DOI: 10.1007/978-3-540-30227-8_23
关键词:
摘要: A general framework of logic programming allowing for the combination several adjoint lattices truth-values is presented. The main contribution a new sufficient condition which guarantees termination all queries fixpoint semantics an interesting class programs. Several extensions these conditions are presented and related to some well-known formalisms probabilistic programming.