{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:47:55Z","timestamp":1725655675673},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242052"},{"type":"electronic","value":"9783642242069"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24206-9_4","type":"book-chapter","created":{"date-parts":[[2012,1,27]],"date-time":"2012-01-27T08:23:02Z","timestamp":1327652582000},"page":"59-77","source":"Crossref","is-referenced-by-count":1,"title":["First-Order Encodings for Modular Nonmonotonic Datalog Programs"],"prefix":"10.1007","author":[{"given":"Minh","family":"Dao-Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Fink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Krennwallner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1988","unstructured":"Apt, K., Blair, H., Walker, A.: Towards a Theory of Declarative Knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann, San Francisco (1988)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1017\/S1471068402001515","volume":"3","author":"F. Arni","year":"2003","unstructured":"Arni, F., et al.: The deductive database system LDL++. Theor. Pract. Log. Prog.\u00a03(1), 61\u201394 (2003)","journal-title":"Theor. Pract. Log. Prog."},{"key":"4_CR3","first-page":"249","volume-title":"AAAI 2010","author":"V. Asuncion","year":"2010","unstructured":"Asuncion, V., Lin, F., Zhang, Y., Zhou, Y.: Ordered completion for first-order logic programs on finite structures. In: AAAI 2010, pp. 249\u2013254. AAAI Press, Menlo Park (2010)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-02846-5_15","volume-title":"Logic Programming","author":"X. Chen","year":"2009","unstructured":"Chen, X., Ji, J., Lin, F.: Computing loops with at most one external support rule for disjunctive logic programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 130\u2013144. Springer, Heidelberg (2009)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Clark, K.L.: Negation as failure. In: Logic and Data Bases, pp. 293\u2013322 (1978)","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-02846-5_16","volume-title":"Logic Programming","author":"M. Dao-Tran","year":"2009","unstructured":"Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Modular Nonmonotonic Logic Programming Revisited. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 145\u2013159. Springer, Heidelberg (2009)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM T. Database Syst.\u00a022(3), 364\u2013417 (1997)","journal-title":"ACM T. Database Syst."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","first-page":"290","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Veith, H.: Modular Logic Programming and Generalized Quantifiers. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, pp. 290\u2013309. Springer, Heidelberg (1997)"},{"issue":"1\/2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1018947420290","volume":"19","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Leone, N., Sacc\u00e0, D.: On the Partial Semantics for Disjunctive Deductive Databases. Ann. Math. Artif. Intell.\u00a019(1\/2), 59\u201396 (1997)","journal-title":"Ann. Math. Artif. Intell."},{"key":"4_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11546207_4","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"W. Faber","year":"2005","unstructured":"Faber, W.: Unfounded sets for disjunctive logic programs with arbitrary aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 40\u201352. Springer, Heidelberg (2005)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W. Faber","year":"2011","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell.\u00a0175(1), 278\u2013298 (2011)","journal-title":"Artif. Intell."},{"issue":"1-2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10472-006-9025-2","volume":"47","author":"P. Ferraris","year":"2006","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the Lin-Zhao theorem. Ann. Math. Artif. Intell.\u00a047(1-2), 79\u2013101 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"4_CR13","first-page":"134","volume-title":"POPL 1989","author":"H. Gaifman","year":"1989","unstructured":"Gaifman, H., Shapiro, E.: Fully abstract compositional semantics for logic programs. In: POPL 1989, pp. 134\u2013142. ACM, New York (1989)"},{"issue":"3-4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generat. Comput.\u00a09(3-4), 365\u2013385 (1991)","journal-title":"New Generat. Comput."},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1613\/jair.2810","volume":"35","author":"T. Janhunen","year":"2009","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res.\u00a035, 813\u2013857 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-24599-5_31","volume-title":"Logic Programming","author":"J. Lee","year":"2003","unstructured":"Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 451\u2013465. Springer, Heidelberg (2003)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-04238-6_17","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Lee","year":"2009","unstructured":"Lee, J., Meng, Y.: On reductive semantics of aggregates in answer set programming. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 182\u2013195. Springer, Heidelberg (2009)"},{"key":"4_CR18","first-page":"23","volume-title":"ICLP 1994","author":"V. Lifschitz","year":"1994","unstructured":"Lifschitz, V., Turner, H.: Splitting a Logic Program. In: ICLP 1994, pp. 23\u201338. MIT-Press, Cambridge (1994)"},{"issue":"1-2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell.\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artif. Intell."},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1145\/195613.195646","volume":"41","author":"K. Ross","year":"1994","unstructured":"Ross, K.: Modular Stratification and Magic Sets for Datalog Programs with Negation. J. ACM\u00a041(6), 1216\u20131267 (1994)","journal-title":"J. ACM"},{"issue":"16-17","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/j.artint.2010.08.004","volume":"174","author":"M. Truszczy\u0144ski","year":"2010","unstructured":"Truszczy\u0144ski, M.: Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs. Artif. Intell.\u00a0174(16-17), 1285\u20131306 (2010)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Datalog Reloaded"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24206-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T17:31:25Z","timestamp":1556213485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24206-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242052","9783642242069"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24206-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}