{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:40:06Z","timestamp":1750495206050,"version":"3.41.0"},"reference-count":36,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T00:00:00Z","timestamp":1203984000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2008,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n\t  <jats:p>Tabled 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.<\/jats:p>\n\t  <jats:p>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.<\/jats:p>","DOI":"10.1017\/s147106840800327x","type":"journal-article","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T10:38:23Z","timestamp":1204022303000},"page":"491-526","source":"Crossref","is-referenced-by-count":4,"title":["TCHR: a framework for tabled CLP"],"prefix":"10.1017","volume":"8","author":[{"given":"TOM","family":"SCHRIJVERS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BART","family":"DEMOEN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID S.","family":"WARREN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,2,26]]},"reference":[{"key":"S147106840800327X_manual_ref-34","unstructured":"Warren, D. S. 2005. The XSB Programmer's Manual: version 2.7, vols. 1 and 2. http:\/\/xsb.sf.net."},{"key":"S147106840800327X_manual_ref-35","unstructured":"Wielemaker, J. 2004. SWI-Prolog release 5.4.0. http:\/\/www.swi-prolog.org\/."},{"key":"S147106840800327X_manual_ref-10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","article-title":"Theory and practice of constraint handling rules","volume":"37","author":"Fr\u00fchwirth","year":"1998","journal-title":"Journal of Logic Programming"},{"key":"S147106840800327X_manual_ref-18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction.","author":"Marriott","year":"1998"},{"key":"S147106840800327X_manual_ref-1","first-page":"293","volume-title":"Logic and Databases","author":"Clark","year":"1987"},{"key":"S147106840800327X_manual_ref-28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1017\/S1471068405002541","article-title":"Optimal union-find in constraint handling rules","volume":"6","author":"Schrijvers","year":"2006","journal-title":"Theory and Practice of Logic Programming"},{"key":"S147106840800327X_manual_ref-12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24836-1_12"},{"key":"S147106840800327X_manual_ref-9","first-page":"90","volume-title":"ICLP'04: Proceedings of the 20th International Conference on Logic Programming.","author":"Duck","year":"2004"},{"key":"S147106840800327X_manual_ref-36","doi-asserted-by":"publisher","DOI":"10.1145\/512644.512661"},{"key":"S147106840800327X_manual_ref-30","first-page":"7","volume-title":"CICLOPS 2003: Proceedings of the Colloquium on Implementation of Constraint and LOgic Programming Systems","author":"Schrijvers","year":"2003"},{"key":"S147106840800327X_manual_ref-31","first-page":"64","volume-title":"Proceedings of CP'96 Workshop on Constraint Databases.","author":"Toman","year":"1996"},{"key":"S147106840800327X_manual_ref-6","unstructured":"Demoen, B. 2004. hProlog. http:\/\/www.cs.kuleuven.be\/~bmd\/hProlog\/."},{"key":"S147106840800327X_manual_ref-7","first-page":"175","volume-title":"IEEE Real Time Systems Symposium.","author":"Du","year":"2000"},{"key":"S147106840800327X_manual_ref-24","first-page":"170","volume-title":"PADL'07: Ninth International Symposium on Practical Aspects of Declarative Languages","author":"Sarna-Starosta","year":"2007"},{"key":"S147106840800327X_manual_ref-15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/41625.41635","volume-title":"POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages.","author":"Jaffar","year":"1987"},{"key":"S147106840800327X_manual_ref-33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009799613661"},{"key":"S147106840800327X_manual_ref-21","first-page":"112","volume-title":"Joint International Conference and Symposium on Logic Programming","author":"Rao","year":"1996"},{"key":"S147106840800327X_manual_ref-5","first-page":"67","volume-title":"Electronic Notes in Theoretical Computer Science","author":"Cui","year":"2000"},{"key":"S147106840800327X_manual_ref-29","first-page":"120","volume-title":"ICLP'04: Proceedings of the 20th International Conference on Logic Programming","author":"Schrijvers","year":"2004"},{"key":"S147106840800327X_manual_ref-8","first-page":"105","volume-title":"ICLP'04: Proceedings of the 20th International Conference on Logic Programming.","author":"Duck","year":"2004"},{"key":"S147106840800327X_manual_ref-13","unstructured":"Holzbaur, C. 1992. Metastructures vs. Attributed Variables in the Context of Extensible Unification. Tech. Rep. TR-92-23, Austrian Research Institute for Artificial Intelligence, Vienna, Austria."},{"key":"S147106840800327X_manual_ref-27","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.entcs.2005.06.039","article-title":"Automatic implication checking for CHR constraints","volume":"147","author":"Schrijvers","year":"2006","journal-title":"Electronic Notes in Theoretical Computer Science."},{"key":"S147106840800327X_manual_ref-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05138-2"},{"key":"S147106840800327X_manual_ref-20","first-page":"405","volume-title":"International Conference on Logic Programming.","author":"Pemmasani","year":"2002"},{"key":"S147106840800327X_manual_ref-16","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"S147106840800327X_manual_ref-17","first-page":"26","volume-title":"Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems.","author":"Kanellakis","year":"1995"},{"key":"S147106840800327X_manual_ref-22","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96733"},{"key":"S147106840800327X_manual_ref-25","doi-asserted-by":"crossref","unstructured":"Schrijvers, T. 2005. Analyses, Optimizations and Extensions of Constraint Handling Rules. Ph.D. thesis, Department of Computer Science, K.U.Leuven, Leuven, Belgium.","DOI":"10.1007\/11562931_44"},{"key":"S147106840800327X_manual_ref-19","first-page":"1","volume-title":"International Workshop on Tabulation in Parsing and Deduction.","author":"Mukund","year":"2000"},{"key":"S147106840800327X_manual_ref-23","first-page":"579","volume-title":"5th International Conference on Formal Engineering Methods, ICFEM 2003","author":"Sarna-Starosta","year":"2003"},{"key":"S147106840800327X_manual_ref-32","first-page":"246","volume-title":"Constraint Databases and Their Applications, Second International Workshop on Constraint Database Systems (CDB '97)","author":"Toman","year":"1997"},{"key":"S147106840800327X_manual_ref-3","doi-asserted-by":"crossref","unstructured":"Cui, B. 2000. A System for Tabled Constraint Logic Programming. Ph.D. thesis, State University of New York at Stony Brook.","DOI":"10.1007\/3-540-44957-4_32"},{"key":"S147106840800327X_manual_ref-14","first-page":"369","article-title":"A prolog constraint handling rules compiler and runtime system","volume":"14","author":"Holzbaur","year":"2000","journal-title":"Special Issue Journal of Applied Artificial Intelligence on Constraint Handling Rules"},{"key":"S147106840800327X_manual_ref-26","first-page":"1","volume-title":"First Workshop on Constraint Handling Rules: Selected Contributions","author":"Schrijvers","year":"2004"},{"key":"S147106840800327X_manual_ref-4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44957-4_32"},{"key":"S147106840800327X_manual_ref-2","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050016"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S147106840800327X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:07:42Z","timestamp":1750493262000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106840800327X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,26]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["S147106840800327X"],"URL":"https:\/\/doi.org\/10.1017\/s147106840800327x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2008,2,26]]}}}