{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:35:01Z","timestamp":1725748501133},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_41","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T11:21:30Z","timestamp":1378984890000},"page":"414-426","source":"Crossref","is-referenced-by-count":1,"title":["Concrete Results on Abstract Rules"],"prefix":"10.1007","author":[{"given":"Markus","family":"Kr\u00f6tzsch","sequence":"first","affiliation":[]},{"given":"Despoina","family":"Magka","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Horrocks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley (1994)"},{"key":"41_CR2","unstructured":"Baget, J.F.: Improving the forward chaining algorithm for conceptual graphs rules. In: Dubois, D., Welty, C.A., Williams, M.A. (eds.) Proc. 9th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2004, pp. 407\u2013414. AAAI Press (2004)"},{"issue":"9-10","key":"41_CR3","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","volume":"175","author":"J.F. Baget","year":"2011","unstructured":"Baget, J.F., Lecl\u00e8re, M., Mugnier, M.L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artificial Intelligence\u00a0175(9-10), 1620\u20131654 (2011)","journal-title":"Artificial Intelligence"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: Lenzerini, M., Lembo, D. (eds.) Proc. 27th Symposium on Principles of Database Systems, PODS 2008, pp. 149\u2013158. ACM (2008)","DOI":"10.1145\/1376916.1376938"},{"key":"41_CR5","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: On eliminating disjunctions in stable logic programming. In: Dubois, D., Welty, C.A., Williams, M.A. (eds.) Proc. 9th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2004, pp. 447\u2013458. AAAI Press (2004)"},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-28472-4_1","volume-title":"Foundations of Information and Knowledge Systems","author":"T. Eiter","year":"2012","unstructured":"Eiter, T., Krennwallner, T., Schneider, P., Xiao, G.: Uniform evaluation of nonmonotonic DL-programs. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS 2012. LNCS, vol.\u00a07153, pp. 1\u201322. Springer, Heidelberg (2012)"},{"issue":"3\/4","key":"41_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF03037172","volume":"9","author":"F. Fages","year":"1991","unstructured":"Fages, F.: A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Comput.\u00a09(3\/4), 425\u2013444 (1991)","journal-title":"New Generation Comput."},{"issue":"1","key":"41_CR8","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Meth. of Logic in CS\u00a01(1), 51\u201360 (1994)","journal-title":"Meth. of Logic in CS"},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R. Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theoretical Computer Science\u00a0336(1), 89\u2013124 (2005)","journal-title":"Theoretical Computer Science"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Kr\u00f6tzsch, M., Magka, D., Horrocks, I.: Concrete results on abstract rules. Tech. rep., University of Oxford (2013), \n                  \n                    http:\/\/korrekt.org\/page\/Publications","DOI":"10.1007\/978-3-642-40564-8_41"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-02846-5_40","volume-title":"Logic Programming","author":"Y. Lierler","year":"2009","unstructured":"Lierler, Y., Lifschitz, V.: One more decidable class of finitely ground programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 489\u2013493. Springer, Heidelberg (2009)"},{"issue":"4","key":"41_CR12","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer (1988)","DOI":"10.1007\/978-3-642-83189-8"},{"key":"41_CR14","unstructured":"Magka, D., Kr\u00f6tzsch, M., Horrocks, I.: Computing stable models for nonmonotonic existential rules. In: Proc. 23rd Int. Joint Conf. on Artificial Intelligence, IJCAI 2013. AAAI Press\/IJCAI (to appear, 2013)"},{"issue":"2","key":"41_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00243002","volume":"5","author":"T.C. Przymusinski","year":"1989","unstructured":"Przymusinski, T.C.: On the declarative and procedural semantics of logic programs. J. Autom. Reasoning\u00a05(2), 167\u2013205 (1989)","journal-title":"J. Autom. Reasoning"},{"issue":"4-5","key":"41_CR16","first-page":"609","volume":"3","author":"H. Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. TPLP\u00a03(4-5), 609\u2013622 (2003)","journal-title":"TPLP"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40564-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T06:36:59Z","timestamp":1558075019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}