{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:24:40Z","timestamp":1742966680811,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_14","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"151-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Framework for Goal-Directed Query Evaluation with Negation"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Brass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Beeri, C., Ramakrishnan, R.: On the power of magic. In: Proceedings of Sixth ACM Symposium on Principles of Database Systems (PODS 1987), pp. 269\u2013284. ACM (1987)","key":"14_CR1","DOI":"10.1145\/28659.28689"},{"unstructured":"Bonatti, P.A., Pontelli, E., Son, T.C.: Credulous resolution for answer set programming. In: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI 2008), vol. 1, pp. 418\u2013423. AAAI Press (2008)","key":"14_CR2"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/3-540-44957-4_71","volume-title":"Computational Logic \u2014 CL 2000","author":"S Brass","year":"2000","unstructured":"Brass, S.: SLDMagic \u2014 the real magic (with applications to web queries). In: Lloyd, W., et al. (eds.) CL 2000. LNCS, vol. 1861, pp. 1063\u20131077. Springer, Heidelberg (2000)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-59487-6_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"S Brass","year":"1995","unstructured":"Brass, S., Dix, J.: Characterizations of the stable semantics by partial evaluation. In: Marek, V.W., Nerode, A., Truszczy\u0144ski, M. (eds.) LPNMR 1995. LNCS (LNAI), vol. 928, pp. 85\u201398. Springer, Heidelberg (1995)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BFb0030663","volume-title":"Nonmonotonic Extensions of Logic Programming","author":"S Brass","year":"1995","unstructured":"Brass, S., Dix, J.: A general approach to bottom-up computation of disjunctive semantics. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds.) Nonmonotonic Extensions of Logic Programming. LNCS (LNAI), vol. 927, pp. 127\u2013155. Springer, Heidelberg (1995)"},{"issue":"5","key":"14_CR6","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1017\/S147106840100103X","volume":"1","author":"S Brass","year":"2001","unstructured":"Brass, S., Dix, J., Freitag, B., Zukowski, U.: Transformation-based bottom-up computation of the well-founded model. Theor. Pract. Logic Program. 1(5), 497\u2013538 (2001)","journal-title":"Theor. Pract. Logic Program."},{"doi-asserted-by":"crossref","unstructured":"Bry, F.: Logic programming as constructivism: a formalization and its application to databases. In: Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1989), pp. 34\u201350 (1989)","key":"14_CR7","DOI":"10.1145\/73721.73725"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0743-1066(93)90034-E","volume":"17","author":"W Chen","year":"1993","unstructured":"Chen, W., Warren, D.S.: A goal-oriented approach to computing the well-founded semantics. J. Logic Program. 17, 279\u2013300 (1993)","journal-title":"J. Logic Program."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/3-540-58495-1_51","volume-title":"Methodologies for Intelligent Systems","author":"J Dix","year":"1994","unstructured":"Dix, J., M\u00fcller, M.: Partial evaluation and relevance for approximations of the stable semantics. In: Ra\u015b, Z.W., Zemankova, M. (eds.) MIS 1994. LNCS (LNAI), vol. 869, pp. 511\u2013520. Springer, Heidelberg (1994)"},{"unstructured":"Dung, P.M., Kanchansut, K.: A fixpoint approach to declarative semantics of logic programs. In: Proceedings of North American Conference on Logic Programming (NACLP 1989), pp. 604\u2013625 (1989)","key":"14_CR10"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-38197-3_9","volume-title":"Logic-Based Program Synthesis and Transformation","author":"K Marple","year":"2013","unstructured":"Marple, K., Gupta, G.: Galliwasp: a goal-directed answer set solver. In: Albert, E. (ed.) LOPSTR 2012. LNCS, vol. 7844, pp. 122\u2013136. Springer, Heidelberg (2013)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-58792-6_11","volume-title":"Logic Program Synthesis and Transformation \u2014 Meta-Programming in Logic","author":"C Sakama","year":"1994","unstructured":"Sakama, C., Seki, H.: Partial deduction of disjunctive logic programs: a declarative approach. In: Fribourg, L., Seki, H. (eds.) LOPSTR 1994 and META 1994. LNCS, vol. 883, pp. 170\u2013182. Springer, Heidelberg (1994)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1018990308362","volume":"25","author":"T Swift","year":"1999","unstructured":"Swift, T.: Tabling for non-monotonic programming. Ann. Math. Artif. Intell. 25, 201\u2013240 (1999)","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T15:41:14Z","timestamp":1676475674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}