Abstract
Residuated Logic Programs allow to capture a spate of different semantics dealing with uncertainty and vagueness. In this work we provide a tabulation goal-oriented query procedure, and show that our tabulation query procedure terminates if and only if the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely-many steps. On the basis of this result we show that the tabulation procedure terminates for important classes of residuated logic programs, in particular for probabilistic deductive databases of Lakshmanan and Sadri.
Citation
Please, cite this work as:
[DMO04] C. V. Damásio, J. Medina, and M. Ojeda-Aciego. “A Tabulation Proof Procedure for Residuated Logic Programming”. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI’2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, August 22-27, 2004. Ed. by R. L. de Mántaras and L. Saitta. IOS Press, 2004, pp. 808-812.
@InProceedings{Damasio2004,
author = {Carlos Viegas Dam{’a}sio and Jes{’u}s Medina and Manuel Ojeda-Aciego},
booktitle = {Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI’2004, including Prestigious Applicants of Intelligent Systems, {PAIS} 2004, Valencia, Spain, August 22-27, 2004},
title = {A Tabulation Proof Procedure for Residuated Logic Programming},
year = {2004},
editor = {Ram{’o}n L{’o}pez {de M{’a}ntaras} and Lorenza Saitta},
pages = {808–812},
publisher = {{IOS} Press},
abstract = {Residuated Logic Programs allow to capture a spate of different semantics dealing with uncertainty and vagueness. In this work we provide a tabulation goal-oriented query procedure, and show that our tabulation query procedure terminates if and only if the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely-many steps. On the basis of this result we show that the tabulation procedure terminates for important classes of residuated logic programs, in particular for probabilistic deductive databases of Lakshmanan and Sadri.},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/conf/ecai/DamasioMO04.bib},
timestamp = {Thu, 07 Jan 2021 00:00:00 +0100},
}