{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:46Z","timestamp":1725561286908},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_27","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"392-406","source":"Crossref","is-referenced-by-count":20,"title":["Incremental Evaluation of Tabled Logic Programs"],"prefix":"10.1007","author":[{"given":"Diptikalyan","family":"Saha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Bol, R., Degerstadt, L.: Tabulated resolution for well-founded semantics. In: ILPS (1993)"},{"key":"27_CR2","unstructured":"Chen, W., Swift, T., Warren, D.S.: Efficient implementation of general logical queries. J. Logic. Prog. (1995)"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. Journal of the ACM\u00a043(1), 20\u201374 (1996)","journal-title":"Journal of the ACM"},{"key":"27_CR4","unstructured":"Damas, L., Costa, V.S.: The YAP prolog system (2002), http:\/\/www.ncc.up.pt\/~vsc\/Yap\/"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Dawson, S., Ramakrishnan, C.R., Warren, D.S.: Practical program analysis using general purpose logic programming systems \u2014 a case study. In: PLDI (1996)","DOI":"10.1145\/231379.231399"},{"key":"27_CR6","unstructured":"Gupta, A., Katiyar, D., Mumick, I.S.: Counting solutions to the view maintenance problem. In: Workshop on Deductive Databases, JICSLP, pp. 185\u2013194 (1992)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally. In: Proceedings of ACM SIGMOD, pp. 157\u2013166 (1993)","DOI":"10.1145\/170035.170066"},{"issue":"2","key":"27_CR8","first-page":"3","volume":"18","author":"A. Gupta","year":"1995","unstructured":"Gupta, A., Mumick, I.S.: Maintenance of materialized views: Problems, techniques, and appfications. IEEE Data Engineering Bulletin\u00a018(2), 3\u201318 (1995)","journal-title":"IEEE Data Engineering Bulletin"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45635-X_4","volume-title":"Logic Programming","author":"G. Gupta","year":"2001","unstructured":"Gupta, G., Guo, H.-F.: A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 181\u2013196. Springer, Heidelberg (2001)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Liu, Y., Stoller, S.: From Datalog rules to efficient programs with time and space guarantees. In: PPDP (2003)","DOI":"10.1145\/888251.888268"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Lu, J., Moerkotte, G., Schue, J., Subrahmanian, V.S.: Efficient maintenance of materialized mediated views. In: ACM SIGMOD, pp. 340\u2013351 (1995)","DOI":"10.1145\/223784.223850"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Mayol, E., Teniente, E.: A survey of current methods for integrity constraint maintenance and view updating. In: ER 1999, pp. 62\u201373 (1999)","DOI":"10.1007\/3-540-48054-4_6"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1145\/357172.357177","volume":"4","author":"R. Paige","year":"1982","unstructured":"Paige, R., Koenig, S.: Finite differencing of computable expressions. ACM TOPLAS\u00a04(3), 402\u2013454 (1982)","journal-title":"ACM TOPLAS"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/10722167_48","volume-title":"Computer Aided Verification","author":"C.R. Ramakrishnan","year":"2000","unstructured":"Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A., Dong, Y., Du, X., Roychoudhury, A., Venkatakrishnan, V.N.: XMC: A logic-programming-based verification toolset. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 576\u2013580. Springer, Heidelberg (2000)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, V., Rao, P., Sagonas, K., Swift, T., Warren, D.S.: Efficient tabling mechanisms for logic programs. In: ICLP, pp. 697\u2013711 (1995)","DOI":"10.7551\/mitpress\/4298.003.0067"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0169-023X(99)00007-5","volume":"30","author":"R.R. Seljee","year":"1999","unstructured":"Seljee, R.R., de Swart, H.C.M.: Three types of redundancy in integrity checking; an optimal solution. Journal of Data and Knowledge Enigineering\u00a030, 135\u2013151 (1999)","journal-title":"Journal of Data and Knowledge Enigineering"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-58179-0_67","volume-title":"Computer Aided Verification","author":"O.V. Sokolsky","year":"1994","unstructured":"Sokolsky, O.V., Smolka, S.A.: Incremental model checking in the modal mucalculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 351\u2013363. Springer, Heidelberg (1994)"},{"key":"27_CR18","unstructured":"Staudt, M., Jarke, M.: Incremental maintenance of externally materialized views. The VLDB Journal, 75\u201386 (1996)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Tamaki, H., Sato, T.: OLDT resolution with tabulation. In: ICLP, pp. 84\u201398 (1986)","DOI":"10.1007\/3-540-16492-8_66"},{"key":"27_CR20","unstructured":"XSB. The XSB logic programming system, Available from http:\/\/xsb.sourceforge.net"},{"key":"27_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1007\/3-540-44957-4_72","volume-title":"Computational Logic - CL 2000","author":"G. Yang","year":"2000","unstructured":"Yang, G., Kifer, M.: Flora: Implementing an efficient dood system using a tabling logic engine. 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. 1078\u20131093. Springer, Heidelberg (2000)"},{"key":"27_CR22","unstructured":"Zhou, N.-F., Shen, Y.-D., Yuan, L.-Y., You, J.-H.: Implementation of a linear tabling mechanism. Journal of Functional and Logic Programming 2001(10) (2001)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T21:51:10Z","timestamp":1711662670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}