{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:38:36Z","timestamp":1725748716381},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_20","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T11:20:19Z","timestamp":1378898419000},"page":"279-294","source":"Crossref","is-referenced-by-count":2,"title":["Computing Minimal Models Modulo Subset-Simulation for Modal Logics"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Papacchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renate A.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: IJCAI 2003, pp. 319\u2013324. Morgan Kaufmann (2003)","DOI":"10.25368\/2022.125"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61630-6_1","volume-title":"Logics in Artificial Intelligence","author":"P. Baumgartner","year":"1996","unstructured":"Baumgartner, P., F\u00fcrbach, U., Niemel\u00e4, I.: Hyper tableaux. In: Or\u0142owska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS, vol.\u00a01126, pp. 1\u201317. Springer, Heidelberg (1996)"},{"key":"20_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-49545-2_9","volume-title":"Logics in Artificial Intelligence","author":"F. Bry","year":"1998","unstructured":"Bry, F., Torge, S.: A deduction method complete for refutation and finite satisfiability. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol.\u00a01489, pp. 122\u2013138. Springer, Heidelberg (1998)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1006291616338","volume":"25","author":"F. Bry","year":"2000","unstructured":"Bry, F., Yahya, A.: Positive unit hyperresolution tableaux and their application to minimal model generation. J. Automated Reasoning\u00a025(1), 35\u201382 (2000)","journal-title":"J. Automated Reasoning"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Schlingloff, B.: Model checking. In: Handbook of Automated Reasoning, pp. 1635\u20131790. Elsevier (2001)","DOI":"10.1016\/B978-044450813-3\/50026-6"},{"key":"20_CR6","unstructured":"Divroodi, A.R., Nguyen, L.A.: On bisimulations for description logics. CoRR abs\/1104.1964 (2011)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1027328830731","volume":"31","author":"R. Gentilini","year":"2002","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation - coarsest partition problems. J. Automated Reasoning\u00a031, 73\u2013103 (2002)","journal-title":"J. Automated Reasoning"},{"key":"20_CR8","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. FCS-36, pp. 453\u2013462. IEEE Computer Society (1995)"},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00244510","volume":"4","author":"J. Hintikka","year":"1988","unstructured":"Hintikka, J.: Model minimization - an alternative to circumscription. J. Automated Reasoning\u00a04(1), 1\u201313 (1988)","journal-title":"J. Automated Reasoning"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF00881950","volume":"13","author":"S. Lorenz","year":"1994","unstructured":"Lorenz, S.: A tableaux prover for domain minimization. J. Automated Reasoning\u00a013(3), 375\u2013390 (1994)","journal-title":"J. Automated Reasoning"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jsc.2008.10.007","volume":"45","author":"C. Lutz","year":"2010","unstructured":"Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic $\\mathcal{EL}$ . J. Symbolic Computation\u00a045(2), 194\u2013228 (2010)","journal-title":"J. Symbolic Computation"},{"key":"20_CR12","unstructured":"Niemel\u00e4, I.: Implementing circumscription using a tableau method. In: Proc. ECAI 1996, pp. 80\u201384. Wiley (1996)"},{"issue":"3","key":"20_CR13","first-page":"159","volume":"278","author":"F. Papacchini","year":"2011","unstructured":"Papacchini, F., Schmidt, R.A.: A tableau calculus for minimal modal model generation. ENTCS\u00a0278(3), 159\u2013172 (2011)","journal-title":"ENTCS"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence\u00a032(1), 57\u201395 (1987)","journal-title":"Artificial Intelligence"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T13:46:21Z","timestamp":1688478381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40885-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408847","9783642408854"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40885-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}