This paper describes a framework to combine tabling evaluation and constraint logic programming (TCLP). While this combination has been studied previously from a theoretical point of view and some implementations exist, they either suffer from a lack of efficiency, flexibility, or generality, or have inherent limitations with respect to the programs they can execute to completion (either with success or failure). Our framework addresses these issues directly, including the ability to check for answer / call entailment, which allows it to terminate in more cases than other approaches. The proposed framework is experimentally compared with existing solutions in order to provide evidence of the mentioned advantages. © 2012 Springer-Verlag.
CITATION STYLE
Chico De Guzmán, P., Carro, M., Hermenegildo, M. V., & Stuckey, P. (2012). A general implementation framework for tabled CLP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7294 LNCS, pp. 104–119). https://doi.org/10.1007/978-3-642-29822-6_11
Mendeley helps you to discover research relevant for your work.