{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:48:48Z","timestamp":1753886928929},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408847"},{"type":"electronic","value":"9783642408854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40885-4_7","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T07:20:19Z","timestamp":1378884019000},"page":"87-102","source":"Crossref","is-referenced-by-count":13,"title":["Uniform Interpolation of $\\mathcal{ALC}$ -Ontologies Using Fixpoints"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Koopmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renate A.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF01448035","volume":"110","author":"W. Ackermann","year":"1935","unstructured":"Ackermann, W.: Untersuchungen \u00fcber das Eliminationsproblem der mathematischen Logik. Mathematische Annalen\u00a0110(1), 390\u2013413 (1935)","journal-title":"Mathematische Annalen"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Handbook of Automated Reasoning, pp. 19\u201399. Elsevier, MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50004-7"},{"key":"7_CR3","unstructured":"Calvanese, D., Giacomo, G.D., Lenzerini, M.: Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: Proc. IJCAI 1999, pp. 84\u201389. Morgan Kaufmann (1999)"},{"key":"7_CR4","unstructured":"D\u2019Agonstino, G., Hollenberg, M.: Uniform interpolation, automata and the modal \u03bc-calculus. In: AiML, vol.\u00a01, pp. 73\u201384. CSLI Pub. (1998)"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.jal.2005.06.008","volume":"4","author":"G. D\u2019Agostino","year":"2006","unstructured":"D\u2019Agostino, G., Lenzi, G.: On modal \u03bc-calculus with explicit interpolants. J. Applied Logic\u00a04(3), 256\u2013278 (2006)","journal-title":"J. Applied Logic"},{"key":"7_CR6","unstructured":"Gabbay, D., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. In: Proc. KR 1992, pp. 425\u2013435. Morgan Kaufmann (1992)"},{"key":"7_CR7","unstructured":"Gabbay, D.M., Schmidt, R.A., Sza\u0142as, A.: Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications. College Publ. (2008)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-24771-5_13","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"V. Goranko","year":"2004","unstructured":"Goranko, V., Hustadt, U., Schmidt, R.A., Vakarelov, D.: SCAN is complete for all Sahlqvist formulae. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol.\u00a03051, pp. 149\u2013162. Springer, Heidelberg (2004)"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1613\/jair.3579","volume":"45","author":"B.C. Grau","year":"2012","unstructured":"Grau, B.C., Motik, B.: Reasoning over ontologies with hidden content: The import-by-query approach. J. Artificial Intelligence Research\u00a045, 197\u2013255 (2012)","journal-title":"J. Artificial Intelligence Research"},{"key":"7_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-87803-2_19","volume-title":"Logics in Artificial Intelligence","author":"A. Herzig","year":"2008","unstructured":"Herzig, A., Mengin, J.: Uniform interpolation by resolution in modal logic. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol.\u00a05293, pp. 219\u2013231. Springer, Heidelberg (2008)"},{"key":"7_CR11","unstructured":"Lutz, C., Piro, R., Wolter, F.: \n                    \n                      \n                    \n                    $\\mathcal{EL}$\n                  -concepts go second-order: Greatest fixpoints and simulation quantifiers. In: Proc. DL 2010, pp. 43\u201354. CEUR-WS.org (2010)"},{"key":"7_CR12","unstructured":"Lutz, C., Wolter, F.: Foundations for uniform interpolation and forgetting in expressive description logics. In: Proc. IJCAI 2011, pp. 989\u2013995. AAAI Press (2011)"},{"key":"7_CR13","unstructured":"Nikitina, N.: Forgetting in General EL Terminologies. In: Description Logics. Proc. DL 2011. CEUR-WS.org (2011)"},{"key":"7_CR14","unstructured":"Nonnengart, A., Sza\u0142as, A.: A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In: Logic at Work, pp. 307\u2013328. Springer (1999)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.jal.2012.01.001","volume":"10","author":"R.A. Schmidt","year":"2012","unstructured":"Schmidt, R.A.: The Ackermann approach for modal logic, correspondence theory and second-order reduction. J. Appl. Logic\u00a010(1), 52\u201374 (2012)","journal-title":"J. Appl. Logic"},{"key":"7_CR16","unstructured":"Simancik, F., Kazakov, Y., Horrocks, I.: Consequence-based reasoning beyond Horn ontologies. In: Proc. IJCAI 2011, pp. 1093\u20131098. AAAI Press (2011)"},{"issue":"3-4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.3166\/jancl.16.517-530","volume":"16","author":"A. Sza\u0142as","year":"2006","unstructured":"Sza\u0142as, A.: Second-order reasoning in description logics. J. Appl. Non-Classical Logics\u00a016(3-4), 517\u2013530 (2006)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"7_CR18","unstructured":"Wang, Z., Wang, K., Topor, R., Zhang, X.: Tableau-based forgetting in \n                    \n                      \n                    \n                    $\\mathcal{ALC}$\n                   ontologies. In: Proc. ECAI 2010, pp. 47\u201352. IOS Press (2010)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40885-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T01:12:42Z","timestamp":1558055562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40885-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408847","9783642408854"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40885-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}