{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:55:56Z","timestamp":1725684956247},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298219"},{"type":"electronic","value":"9783642298226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29822-6_11","type":"book-chapter","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:21:09Z","timestamp":1337520069000},"page":"104-119","source":"Crossref","is-referenced-by-count":4,"title":["A General Implementation Framework for Tabled CLP"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Chico de Guzm\u00e1n","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Carro","sequence":"additional","affiliation":[]},{"given":"Manuel V.","family":"Hermenegildo","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-16492-8_66","volume-title":"Third International Conference on Logic Programming","author":"H. Tamaki","year":"1986","unstructured":"Tamaki, H., Sato, M.: OLD Resolution with Tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 84\u201398. Springer, Heidelberg (1986)"},{"issue":"3","key":"11_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/131295.131299","volume":"35","author":"D.S. Warren","year":"1992","unstructured":"Warren, D.S.: Memoing for Logic Programs. CACM\u00a035(3), 93\u2013111 (1992)","journal-title":"CACM"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1145\/291889.291897","volume":"20","author":"K. Sagonas","year":"1998","unstructured":"Sagonas, K., Swift, T.: An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs. ACM TOPLAS\u00a020(3), 586\u2013634 (1998)","journal-title":"ACM TOPLAS"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.: Constraint LP: A Survey. JLP\u00a019\/20, 503\u2013581 (1994)","journal-title":"JLP"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P.C. Kanellakis","year":"1995","unstructured":"Kanellakis, P.C., Kuper, G.M., Revesz, P.Z.: Constraint Query Languages. J. Comput. Syst. Sci.\u00a051(1), 26\u201352 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3\/4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1023\/A:1009799613661","volume":"2","author":"D. Toman","year":"1997","unstructured":"Toman, D.: Memoing Evaluation for Constraint Extensions of Datalog. Constraints\u00a02(3\/4), 337\u2013359 (1997)","journal-title":"Constraints"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A Theory of Timed Automata. TCS\u00a0126, 183\u2013235 (1994)","journal-title":"TCS"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J. Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed Automata: Semantics, Algorithms and Tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"M. Hermenegildo","year":"2000","unstructured":"Hermenegildo, M., Puebla, G., Marriott, K., Stuckey, P.: Incremental Analysis of Constraint Logic Programs. ACM TOPLAS\u00a022(2), 187\u2013223 (2000)","journal-title":"ACM TOPLAS"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-62501-1_36","volume-title":"Constraint Databases and Applications","author":"D. Toman","year":"1996","unstructured":"Toman, D.: Constraint Databases and Program Analysis Using Abstract Interpretation. In: Gaede, V., Vianu, V., Brodsky, A., Srivastava, D., G\u00fcnther, O., Wallace, M. (eds.) CP-WS 1996 and CDB 1997. LNCS, vol.\u00a01191, pp. 246\u2013262. Springer, Heidelberg (1996)"},{"issue":"1","key":"11_CR11","first-page":"31","volume":"19","author":"A. Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The Octagon Abstract Domain. HOSC\u00a019(1), 31\u2013100 (2006)","journal-title":"HOSC"},{"key":"11_CR12","unstructured":"Codognet, P.: A Tabulation Method for Constraint Logic Programming. In: INAP 1995, Tokyo, Japan (October 1995)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/3-540-68530-8_27","volume-title":"Algorithms - ESA \u201998","author":"D. Frigioni","year":"1998","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 320\u2013331. Springer, Heidelberg (1998)"},{"issue":"4-6","key":"11_CR14","first-page":"401","volume":"10","author":"P. Chico de Guzm\u00e1n","year":"2010","unstructured":"Chico de Guzm\u00e1n, P., Carro, M., Warren, D.S.: Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling. TPLP\u00a010(4-6), 401\u2013416 (2010)","journal-title":"TPLP"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, I., Rao, P., Sagonas, K., Swift, T., Warren, D.: Efficient Tabling Mechanisms for Logic Programs. In: ICLP, pp. 697\u2013711 (1995)","DOI":"10.7551\/mitpress\/4298.003.0067"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/S0167-739X(99)00092-8","volume":"16","author":"B. Demoen","year":"2000","unstructured":"Demoen, B., Sagonas, K.: CHAT: the copy-hybrid approach to tabling. Future Generation Computer Systems\u00a016, 809\u2013830 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"11_CR17","unstructured":"Rao, P., Ramakrishnan, C.R., Ramakrishnan, I.: A Thread in Time Saves Tabling Time. In: JICSLP. MIT Press (1996)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-55844-6_141","volume-title":"Programming Language Implementation and Logic Programming","author":"C. Holzbaur","year":"1992","unstructured":"Holzbaur, C.: Metastructures vs. Attributed Variables in the Context of Extensible Unification. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, pp. 260\u2013268. Springer, Heidelberg (1992)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-15675-5_13","volume-title":"Logics in Artificial Intelligence","author":"F. Cruz","year":"2010","unstructured":"Cruz, F., Rocha, R.: Retroactive Subsumption-Based Tabled Evaluation of Logic Programs. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol.\u00a06341, pp. 130\u2013142. Springer, Heidelberg (2010)"},{"key":"11_CR20","unstructured":"Schulte, C.: Comparing trailing and copying for constraint programming. In: International Conference on Logic Programming, pp. 275\u2013289 (1999)"},{"key":"11_CR21","unstructured":"David, A.: Merging DBMs Efficiently. In: 17th Nordic Workshop on Programming Theory, NWPT 2005, pp. 54\u201356. DIKU, University of Copenhagen (2005)"},{"issue":"4","key":"11_CR22","first-page":"491","volume":"8","author":"T. Schrijvers","year":"2008","unstructured":"Schrijvers, T., Demoen, B., Warren, D.S.: TCHR: a Framework for Tabled CLP. TPLP\u00a08(4), 491\u2013526 (2008)","journal-title":"TPLP"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a Nutshell. STTT\u00a01 (1997)","DOI":"10.1007\/s100090050010"},{"key":"11_CR24","unstructured":"Sagonas, K., Swift, T., Warren, D.: The XSB Programming System. In: ILPS - PLD, Number TR #1183, p. 164. U. of Wisconsin (October 1993)"},{"key":"11_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-44957-4_32","volume-title":"Computational Logic - CL 2000","author":"B. Cui","year":"2000","unstructured":"Cui, B., Warren, D.S.: A System for Tabled Constraint Logic Programming. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 478\u2013492. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"11_CR26","first-page":"219","volume":"12","author":"M.V. Hermenegildo","year":"2012","unstructured":"Hermenegildo, M.V., Bueno, F., Carro, M., L\u00f3pez, P., Mera, E., Morales, J., Puebla, G.: An Overview of Ciao and its Design Philosophy. TPLP\u00a012(1-2), 219\u2013252 (2012), http:\/\/arxiv.org\/abs\/1102.5497","journal-title":"TPLP"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-45619-8_8","volume-title":"Logic Programming","author":"G. Pemmasani","year":"2002","unstructured":"Pemmasani, G., Ramakrishnan, C.R., Ramakrishnan, I.V.: Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 100\u2013114. Springer, Heidelberg (2002)"},{"key":"11_CR28","unstructured":"Du, X., Ramakrishnan, C.R., Smolka, S.A.: Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. In: IEEE Real-Time Systems Symposium, pp. 175\u2013184. IEEE Computer Society (2000)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29822-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T17:44:56Z","timestamp":1713980696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29822-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298219","9783642298226"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29822-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}