{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:38:23Z","timestamp":1743003503888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031314759"},{"type":"electronic","value":"9783031314766"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-31476-6_11","type":"book-chapter","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T07:02:46Z","timestamp":1684220566000},"page":"206-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Layerings of Logic Programs - Layer Decomposable Semantics and Incremental Model Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0577-0939","authenticated-orcid":false,"given":"Alexandre Miguel","family":"Pinto","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7880-4322","authenticated-orcid":false,"given":"Lu\u00eds Moniz","family":"Pereira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,17]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.3233\/FI-1991-14307","volume":"14","author":"KR Apt","year":"1991","unstructured":"Apt, K.R., Blair, H.A.: Arithmetic classification of perfect models of stratified programs. Fundam. Inform. 14(3), 339\u2013343 (1991)","journal-title":"Fundam. Inform."},{"key":"11_CR2","unstructured":"Costantini, S.: Comparing different graph representations of logic programs under the answer set semantics. In: Provetti, A., Son, T.C. (eds.) Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, Proc. of the 1st Intl. ASP\u201901 Workshop (2001)"},{"key":"11_CR3","unstructured":"Costantini, S., Lanzarone, G.A., Magliocco, G.: Layer supported models of logic programs. In: Maher, M. (ed.) Procs. 1996 Joint International Conference and Symposium on Logic Programming (JICSLP 1996), pp. 438\u2013452, MIT Press, Cambridge, USA (1996)"},{"issue":"1\u20132","key":"11_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","volume":"170","author":"Y Dimopoulos","year":"1996","unstructured":"Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theor. Comput. Sci. 170(1\u20132), 209\u2013244 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.3233\/FI-1995-2233","volume":"22","author":"J Dix","year":"1995","unstructured":"Dix, J.: A classification theory of semantics of normal logic programs: I. strong properties. Fundam. Inform. 22(3), 227\u2013255 (1995)","journal-title":"Fundam. Inform."},{"key":"11_CR6","first-page":"51","volume":"1","author":"F Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. J. Methods Log. Comput. Sci. 1, 51\u201360 (1994)","journal-title":"J. Methods Log. Comput. Sci."},{"issue":"3","key":"11_CR7","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"11_CR8","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Procs. ICLP 1988, pp. 1070\u20131080 (1988)"},{"key":"11_CR9","series-title":"volume 2005\u201301 of Ulmer Informatik-Berichte","first-page":"65","volume-title":"W(C)LP","author":"P Hitzler","year":"2005","unstructured":"Hitzler, P., Schwarz, S.: Level mapping characterizations of selector generated models for logic programs. In: Wolf, A., Fr\u00fchwirth, T.W., Meister, M. (eds.) W(C)LP. volume 2005\u201301 of Ulmer Informatik-Berichte, pp. 65\u201375. Universit\u00e4t Ulm, Germany (2005)"},{"issue":"1\u20132","key":"11_CR10","first-page":"93","volume":"5","author":"P Hitzler","year":"2005","unstructured":"Hitzler, P., Wendt, M.: A uniform approach to logic programming semantics. TPLP 5(1\u20132), 93\u2013121 (2005)","journal-title":"TPLP"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer set planning. In: Proceedings of the International Conference on Logic Programming, pp. 23\u201337 (1999)","DOI":"10.1007\/3-540-46767-X_28"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0020-0190(94)90047-7","volume":"49","author":"E Nuutila","year":"1994","unstructured":"Nuutila, E., Soisalon-Soininen, E.: On finding the strongly connected components in a directed graph. Inf. Process. Lett. 49, 9\u201314 (1994)","journal-title":"Inf. Process. Lett."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-04238-6_41","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"LM Pereira","year":"2009","unstructured":"Pereira, L.M., Pinto, A.M.: Layer supported models of logic programs. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 450\u2013456. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04238-6_41"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Przymusinski, T.C.: Every logic program has a natural stratification and an iterated least fixed point model. In: PODS, pp. 11\u201321. ACM Press (1989)","DOI":"10.1145\/73721.73723"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00243002","volume":"5","author":"TC Przymusinski","year":"1989","unstructured":"Przymusinski, T.C.: On the declarative and procedural semantics of logic programs. J. Autom. Reason. 5(2), 167\u2013205 (1989)","journal-title":"J. Autom. Reason."}],"container-title":["Lecture Notes in Computer Science","Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31476-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T07:04:02Z","timestamp":1684220642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31476-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031314759","9783031314766"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31476-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}