{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:19:47Z","timestamp":1725761987176},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452208"},{"type":"electronic","value":"9783642452215"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45221-5_46","type":"book-chapter","created":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T09:28:23Z","timestamp":1386235703000},"page":"694-709","source":"Crossref","is-referenced-by-count":8,"title":["Incremental Tabling for Query-Driven Propagation of Logic Program Updates"],"prefix":"10.1007","author":[{"given":"Ari","family":"Saptawijaya","sequence":"first","affiliation":[]},{"given":"Lu\u00eds Moniz","family":"Pereira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-45757-7_5","volume-title":"Logics in Artificial Intelligence","author":"J.J. Alferes","year":"2002","unstructured":"Alferes, J.J., Brogi, A., Leite, J.A., Pereira, L.M.: Evolving logic programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 50\u201361. Springer, Heidelberg (2002)"},{"key":"46_CR2","series-title":"LNAI","volume-title":"Reasoning with Logic Programming","year":"1996","unstructured":"Alferes, J.J., Pereira, L.M. (eds.): Reasoning with Logic Programming. LNCS (LNAI), vol.\u00a01111. Springer, Berlin (1996)"},{"issue":"4","key":"46_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1017\/S1471068403001960","volume":"4","author":"J.J. Alferes","year":"2004","unstructured":"Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory and Practice of Logic Programming\u00a04(4), 383\u2013428 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"key":"46_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-30498-2_40","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2004","author":"F. Banti","year":"2004","unstructured":"Banti, F., Alferes, J.J., Brogi, A.: Well founded semantics for logic program updates. In: Lema\u00eetre, C., Reyes, C.A., Gonz\u00e1lez, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol.\u00a03315, pp. 397\u2013407. Springer, Heidelberg (2004)"},{"key":"46_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-30204-9_2","volume-title":"Advances in Databases and Information Systems","author":"A. Behrend","year":"2004","unstructured":"Behrend, A., Manthey, R.: Update propagation in deductive databases using soft stratification. In: Bencz\u00far, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol.\u00a03255, pp. 22\u201336. Springer, Heidelberg (2004)"},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-69611-7_7","volume-title":"Practical Aspects of Declarative Languages","author":"M. Eichberg","year":"2007","unstructured":"Eichberg, M., Kahl, M., Saha, D., Mezini, M., Ostermann, K.: Automatic incrementalization of Prolog based static analyses. In: Hanus, M. (ed.) PADL 2007. LNCS, vol.\u00a04354, pp. 109\u2013123. Springer, Heidelberg (2007)"},{"key":"46_CR7","unstructured":"Griefahn, U.: Reactive Model Computation - A Uniform Approach to the Implementation of Deductive Databases. PhD thesis, University of Bonn (1997)"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Grosof, B.N., Swift, T.: Radial restraint: A semantically clean approach to bounded rationality for logic programs. In: AAAI 2013. The AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8682"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-28717-6_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T.A. Han","year":"2012","unstructured":"Han, T.A., Saptawijaya, A., Moniz Pereira, L.: Moral reasoning under uncertainty. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol.\u00a07180, pp. 212\u2013227. Springer, Heidelberg (2012)"},{"issue":"2","key":"46_CR10","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 Transactions on Programming Languages and Systems\u00a022(2), 187\u2013223 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"46_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10472-011-9253-y","volume":"62","author":"R. Kowalski","year":"2011","unstructured":"Kowalski, R., Sadri, F.: Abductive logic programming agents with destructive databases. Annals of Mathematics and Artificial Intelligence\u00a062(1), 129\u2013158 (2011)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-29414-3_3","volume-title":"Logic Programs, Norms and Action","author":"R.A. Kowalski","year":"2012","unstructured":"Kowalski, R.A., Sadri, F.: Teleo-reactive abductive logic programs. In: Artikis, A., Craven, R., Kesim \u00c7i\u00e7ekli, N., Sadighi, B., Stathis, K. (eds.) Sergot Festschrift 2012. LNCS, vol.\u00a07360, pp. 12\u201332. Springer, Heidelberg (2012)"},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-55015-1_26","volume-title":"Deductive and Object-Oriented Databases","author":"V. K\u00fcchenhoff","year":"1991","unstructured":"K\u00fcchenhoff, V.: On the efficient computation of the difference between consecutive database states. In: Delobel, C., Masunaga, Y., Kifer, M. (eds.) DOOD 1991. LNCS, vol.\u00a0566, pp. 478\u2013502. Springer, Heidelberg (1991)"},{"key":"46_CR14","unstructured":"Logic Programming Associates Ltd. LPA prolog, http:\/\/www.lpa.co.uk\/"},{"key":"46_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1613\/jair.30","volume":"1","author":"N. Nilsson","year":"1994","unstructured":"Nilsson, N.: Teleo-reactive programs for agent control. Journal of Artificial Intelligence Research\u00a01, 139\u2013158 (1994)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"46_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","volume":"36","author":"D.L. Poole","year":"1988","unstructured":"Poole, D.L.: A logical framework for default reasoning. Artificial Intelligence\u00a036(1), 27\u201347 (1988)","journal-title":"Artificial Intelligence"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Saha, D.: Incremental Evaluation of Tabled Logic Programs. PhD thesis, SUNY Stony Brook (2006)","DOI":"10.1007\/11799573_7"},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental and demand-driven points-to analysis using logic programming. In: ACM PPDP 2005, pp. 117\u2013128. ACM (2005)","DOI":"10.1145\/1069774.1069785"},{"key":"46_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/11799573_7","volume-title":"Logic Programming","author":"D. Saha","year":"2006","unstructured":"Saha, D., Ramakrishnan, C.R.: A local algorithm for incremental evaluation of tabled logic programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 56\u201371. Springer, Heidelberg (2006)"},{"key":"46_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-642-40564-8_47","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"A. Saptawijaya","year":"2013","unstructured":"Saptawijaya, A., Pereira, L.M.: Program updating by incremental and answer subsumption tabling. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol.\u00a08148, pp. 479\u2013484. Springer, Heidelberg (2013)"},{"key":"46_CR21","unstructured":"Saptawijaya, A., Pereira, L.M.: Tabled abduction in logic programs (technical communication of ICLP 2013). Theory and Practice of Logic Programming, Online Supplement\u00a013(4-5) (2013)"},{"key":"46_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-15675-5_26","volume-title":"Logics in Artificial Intelligence","author":"T. Swift","year":"2010","unstructured":"Swift, T., Warren, D.S.: Tabling with answer subsumption: Implementation, applications and performance. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol.\u00a06341, pp. 300\u2013312. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"46_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1017\/S1471068411000500","volume":"12","author":"T. Swift","year":"2012","unstructured":"Swift, T., Warren, D.S.: XSB: Extending Prolog with tabled logic programming. Theory and Practice of Logic Programming\u00a012(1-2), 157\u2013187 (2012)","journal-title":"Theory and Practice of Logic Programming"},{"key":"46_CR24","unstructured":"Swift, T., Warren, D.S., Sagonas, K., Freire, J., Rao, P., Cui, B., Johnson, E., de Castro, L., Marques, R.F., Saha, D., Dawson, S., Kifer, M.: The XSB System Version 3.3.x, vol.\u00a01. Programmer\u2019s Manual (2012)"},{"issue":"3","key":"46_CR25","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder van","year":"1991","unstructured":"van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45221-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T18:30:29Z","timestamp":1688841029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45221-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452208","9783642452215"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45221-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}