ECAI 2004 Conference Paper

A tabulation proof procedure for residuated logic programming

Carlos V. Damasio, Jesus Medina, Manuel Ojeda-Aciego

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 reach the least fixpoint after only finitely-many steps. On the basis of this result we show that the tabulation procedure terminates for every definite residuated logic program. Moreover, using the general tabulation packae of the XSB system, a general encoding showing how to use this tabled features in order to implement residuated logic programming within XSB.

Keywords: Reasoning under Uncertainty, Logic Programming

Citation: Carlos V. Damasio, Jesus Medina, Manuel Ojeda-Aciego: A tabulation proof procedure for residuated logic programming. In R.López de Mántaras and L.Saitta (eds.): ECAI2004, Proceedings of the 16th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2004, pp.808-812.

ECAI-2004 is organised by the European Coordinating Committee for Artificial Intelligence (ECCAI) and hosted by the Universitat Politècnica de València on behalf of Asociación Española de Inteligencia Artificial (AEPIA) and Associació Catalana d'Intel-ligència Artificial (ACIA).