{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:43:54Z","timestamp":1743083034317,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"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_29","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"346-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reasoning with Forest Logic Programs Using Fully Enriched Automata"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Feier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-4(3:11)2008","volume":"4","author":"PA Bonatti","year":"2008","unstructured":"Bonatti, P.A., Lutz, C., Murano, A., Vardi, M.Y.: The complexity of enriched $$\\mu $$-calculi. Log. Methods Comput. Sci. 4(3), 1\u201327 (2008)","journal-title":"Log. Methods Comput. Sci."},{"key":"29_CR2","unstructured":"Feier, C.: Worst-case optimal reasoning with forest logic programs. In: Proceedings of the KR, 2012, 208\u2013212 (2012)"},{"key":"29_CR3","unstructured":"Feier, C.: Reasoning with Forest Logic Programs, Ph.D thesis, TU Wien (2014)"},{"issue":"13","key":"29_CR4","first-page":"395","volume":"3","author":"C Feier","year":"2013","unstructured":"Feier, C., Heymans, S.: Reasoning with forest logic programs and f-hybrid knowledge bases. TPLP 3(13), 395\u2013463 (2013)","journal-title":"TPLP"},{"key":"29_CR5","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070\u20131080 (1988)"},{"key":"29_CR6","unstructured":"Heymans, S.: Decidable Open Answer Set Programming. Ph.D thesis, Theoretical Computer Science Lab (TINF), Department of Computer Science, Vrije Universiteit Brussel (2006)"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jal.2006.02.001","volume":"5","author":"S Heymans","year":"2007","unstructured":"Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming for the semantic web. J. Appl. Logic 5(1), 144\u2013169 (2007)","journal-title":"J. Appl. Logic"},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1380572.1380575","volume":"9","author":"S Heymans","year":"2008","unstructured":"Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming with guarded programs. Trans. Comput. Logic 9(4), 1\u201353 (2008)","journal-title":"Trans. Comput. Logic"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.websem.2005.05.001","volume":"3","author":"B Motik","year":"2005","unstructured":"Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Semant. 3(1), 41\u201360 (2005)","journal-title":"J. Web Semant."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Rosati, R.: On combining description logic ontologies and nonrecursive datalog rules. In: Proceedings of the RR, pp. 13\u201327 (2008)","DOI":"10.1007\/978-3-540-88737-9_3"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:27:52Z","timestamp":1676978872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_29","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"}}]}}