{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:57Z","timestamp":1725490197595},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74610-2_46","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T22:33:31Z","timestamp":1187908411000},"page":"462-463","source":"Crossref","is-referenced-by-count":2,"title":["Modular Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Emilia","family":"Oikarinen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-45757-7_41","volume-title":"Logics in Artificial Intelligence","author":"T. Janhunen","year":"2002","unstructured":"Janhunen, T., Oikarinen, E.: Testing the equivalence of logic programs under stable model semantics. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 493\u2013504. Springer, Heidelberg (2002)"},{"key":"46_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-540-24609-1_17","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"E. Oikarinen","year":"2003","unstructured":"Oikarinen, E., Janhunen, T.: Verifying the equivalence of logic programs in the disjunctive case. In: Lifschitz, V., Niemel\u00e4, I. (eds.) Logic Programming and Nonmonotonic Reasoning. LNCS (LNAI), vol.\u00a02923, pp. 180\u2013193. Springer, Heidelberg (2003)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Oikarinen, E.: Automated verification of weak equivalence within the smodels system. Theory and Practice of Logic Programming (to appear)","DOI":"10.1017\/S1471068407003031"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0743-1066(94)90032-9","volume":"19\/20","author":"M. Bugliesi","year":"1994","unstructured":"Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. Journal of Logic Programming\u00a019\/20, 443\u2013502 (1994)","journal-title":"Journal of Logic Programming"},{"key":"46_CR5","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)"},{"key":"46_CR6","unstructured":"Tari, L., Baral, C., Anwar, S.: A language for modular answer set programming: Application to ACC tournament scheduling. In: ASP 2005, CEUR-WS.org (2005)"},{"key":"46_CR7","unstructured":"Oikarinen, E.: Modular answer set programming. Research Report A106, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland (2006)"},{"key":"46_CR8","first-page":"412","volume-title":"ECAI 2006","author":"E. Oikarinen","year":"2006","unstructured":"Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: ECAI 2006, pp. 412\u2013416. IOS Press, Amsterdam (2006)"},{"key":"46_CR9","first-page":"321","volume-title":"LPNMR 2007","author":"E. Oikarinen","year":"2007","unstructured":"Oikarinen, E.: Modularity in smodels programs. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007, vol.\u00a04483, pp. 321\u2013326. Springer, Heidelberg (2007)"},{"key":"46_CR10","first-page":"175","volume-title":"LPNMR 2007","author":"T. Janhunen","year":"2007","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007, vol.\u00a04483, pp. 175\u2013187. Springer, Heidelberg (2007)"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/75277.75289","volume-title":"POPL 1989","author":"H. Gaifman","year":"1989","unstructured":"Gaifman, H., Shapiro, E.Y.: Fully abstract compositional semantics for logic programs. In: POPL 1989, pp. 134\u2013142. ACM Press, New York (1989)"},{"key":"46_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-30227-8_14","volume-title":"Logics in Artificial Intelligence","author":"T. Janhunen","year":"2004","unstructured":"Janhunen, T., Oikarinen, E.: Capturing parallel circumscription with disjunctive logic programs. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 134\u2013146. Springer, Heidelberg (2004)"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Oikarinen, E., Janhunen, T.: A linear transformation from prioritized circumscription to disjunctive logic programming. In: ICLP 2007 (to appear)","DOI":"10.1007\/978-3-540-74610-2_36"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74610-2_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:30:21Z","timestamp":1619505021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74610-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746089"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74610-2_46","relation":{},"subject":[]}}