Published in

Springer, Lecture Notes in Computer Science, p. 104-119, 2012

DOI: 10.1007/978-3-642-29822-6_11

Links

Tools

Export citation

Search in Google Scholar

A General Implementation Framework for Tabled CLP

Book chapter published in 2012 by Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo ORCID, Peter Stuckey
Distributing this paper is prohibited by the publisher
Distributing this paper is prohibited by the publisher

Full text: Unavailable

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

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.