TCHR: a framework for tabled CLP

Simple item page
dc.creatorSchrijvers, Tom
dc.creatorDemoen, Bart
dc.creatorWarren, David S.
dc.date2007-12-26
dc.date.accessioned2026-07-07T08:51:07Z
dc.date.available2026-07-07T08:51:07Z
dc.descriptionTabled Constraint Logic Programming is a powerful execution mechanism for dealing with Constraint Logic Programming without worrying about fixpoint computation. Various applications, e.g in the fields of program analysis and model checking, have been proposed. Unfortunately, a high-level system for developing new applications is lacking, and programmers are forced to resort to complicated ad hoc solutions. This papers presents TCHR, a high-level framework for tabled Constraint Logic Programming. It integrates in a light-weight manner Constraint Handling Rules (CHR), a high-level language for constraint solvers, with tabled Logic Programming. The framework is easily instantiated with new application-specific constraint domains. Various high-level operations can be instantiated to control performance. In particular, we propose a novel, generalized technique for compacting answer sets.
dc.descriptionAccepted for publication in Theory and Practice of Logic Programming
dc.identifierhttps://arxiv.org/abs/0712.3830
dc.identifierhttp://arxiv.org/abs/0712.3830
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144824
dc.subjectProgramming Languages
dc.titleTCHR: a framework for tabled CLP
dc.typetext

Files

Collections

arXiv