{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:51:47Z","timestamp":1743076307393,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319234847"},{"type":"electronic","value":"9783319234854"}],"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-23485-4_37","type":"book-chapter","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T16:07:15Z","timestamp":1440432435000},"page":"363-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Allowing Cyclic Dependencies in Modular Logic Programming"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o","family":"Moura","sequence":"first","affiliation":[]},{"given":"Carlos Viegas","family":"Dam\u00e1sio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,25]]},"reference":[{"issue":"4\u20135","key":"37_CR1","first-page":"719","volume":"12","author":"J Babb","year":"2012","unstructured":"Babb, J., Lee, J.: Module theorem for the general theory of stable models. TPLP 12(4\u20135), 719\u2013735 (2012)","journal-title":"TPLP"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"issue":"20","key":"37_CR3","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0743-1066(94)90032-9","volume":"19","author":"M Bugliesi","year":"1994","unstructured":"Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. J. Log. Program. 19(20), 443\u2013502 (1994)","journal-title":"J. Log. Program."},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-20895-9_4","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Viegas Dam\u00e1sio","year":"2011","unstructured":"Viegas Dam\u00e1sio, C., Moura, J.: Modularity of P-log programs. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 13\u201325. Springer, Heidelberg (2011)"},{"key":"37_CR5","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. 5649, pp. 145\u2013159. Springer, Heidelberg (2009)"},{"key":"37_CR6","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred and weakly preferred answer sets bymeta-interpretation in answer set programming. In: Proceedings AAAI 2001 Spring Symposium on Answer Set Programming, pp. 45\u201352. AAAI Press (2001)"},{"issue":"1\u20132","key":"37_CR7","first-page":"45","volume":"5","author":"P Ferraris","year":"2005","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. TPLP 5(1\u20132), 45\u201374 (2005)","journal-title":"TPLP"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Gaifman, H., Shapiro, E.: Fully abstract compositional semantics for logic programs. In: Symposium on Principles of Programming Languages, POPL, pp. 134\u2013142. ACM, New York (1989)","DOI":"10.1145\/75277.75289"},{"key":"37_CR9","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference on Logic Program. MIT Press (1988)"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0743-1066(94)90001-9","volume":"21","author":"L Giordano","year":"1994","unstructured":"Giordano, L., Martelli, A.: Structuring logic programs: a modal approach. The Journal of Logic Programming 21(2), 59\u201394 (1994)","journal-title":"The Journal of Logic Programming"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-04238-6_15","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M J\u00e4rvisalo","year":"2009","unstructured":"J\u00e4rvisalo, M., Oikarinen, E., Janhunen, T., Niemel\u00e4, I.: A module-based framework for multi-language constraint modeling. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 155\u2013168. Springer, Heidelberg (2009)"},{"issue":"1\u20132","key":"37_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138(1\u20132), 39\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"37_CR13","first-page":"2001","volume":"2","author":"V Lifschitz","year":"2000","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 2001 (2000)","journal-title":"ACM Transactions on Computational Logic"},{"key":"37_CR14","unstructured":"Mancarella, P., Pedreschi, D.: An algebra of logic programs. In: ICLP\/SLP, pp. 1006\u20131023 (1988)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Miller, D.: A theory of modules for logic programming. In. In Symp. Logic Programming, pp. 106\u2013114 (1986)","DOI":"10.1007\/3-540-16492-8_94"},{"key":"37_CR17","unstructured":"Moura, J., Dam\u00e1sio, C.V.: Generalising modular logic programs. In: 15th International Workshop on Non-Monotonic Reasoning (NMR 2014) (2014)"},{"key":"37_CR18","first-page":"72","volume":"25","author":"I Niemel\u00e4","year":"1998","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 72\u201379 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"5\u20136","key":"37_CR19","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1017\/S147106840800358X","volume":"8","author":"E Oikarinen","year":"2008","unstructured":"Oikarinen, E., Janhunen, T.: Achieving compositionality of the stable model semantics for smodels programs. Theory Pract. Log. Program. 8(5\u20136), 717\u2013761 (2008)","journal-title":"Theory Pract. Log. Program."},{"key":"37_CR20","unstructured":"O\u2019Keefe, R.A.: Towards an algebra for constructing logic programs. In: SLP, pp. 152\u2013160 (1985)"},{"key":"37_CR21","unstructured":"Slota, M., Leite, J.: Robust equivalence models for semantic updates of answer-set programs. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proc. of KR 2012. AAAI Press (2012)"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Tasharrofi, S., Ternovska, E.: A semantic account for modularity in multi-language modelling of search problems. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS, vol. 6989, pp. 259\u2013274. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24364-6_18"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23485-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:15:44Z","timestamp":1676967344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23485-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319234847","9783319234854"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23485-4_37","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":"25 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}