{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:39:51Z","timestamp":1725518391488},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540710691"},{"type":"electronic","value":"9783540710707"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71070-7_19","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T09:56:30Z","timestamp":1220003790000},"page":"226-241","source":"Crossref","is-referenced-by-count":12,"title":["Automata-Based Axiom Pinpointing"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pe\u00f1aloza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Baader, F.: Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In: Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI 1991) (1991)"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"19_CR2","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Hladik, J., Pe\u00f1aloza, R.: Automata can show PSPACE results for description logics. Information and Computation (to appear, 2008)","DOI":"10.1016\/j.ic.2008.03.006"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00883932","volume":"14","author":"F. Baader","year":"1995","unstructured":"Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms. J. of Automated Reasoning\u00a014, 149\u2013180 (1995)","journal-title":"J. of Automated Reasoning"},{"key":"19_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-73099-6_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"F. Baader","year":"2007","unstructured":"Baader, F., Pe\u00f1aloza, R.: Axiom pinpointing in general tableaux. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol.\u00a04548, pp. 11\u201327. Springer, Heidelberg (2007)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Pe\u00f1aloza, R.: Blocking and pinpointing in forest tableaux. LTCS-Report LTCS-08-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany (2008), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.25368\/2022.165"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Baader, F., Pe\u00f1aloza, R.: Pinpointing in terminating forest tableaux. LTCS-Report LTCS-08-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany (2008), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.25368\/2022.166"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013882326814","volume":"69","author":"F. Baader","year":"2001","unstructured":"Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica\u00a069, 5\u201340 (2001)","journal-title":"Studia Logica"},{"key":"19_CR9","unstructured":"Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT using axiom pinpointing in the description logic $\\mathcal{EL}^+$ . In: Proceedings of the International Conference on Representing and Sharing Knowledge Using SNOMED (KR-MED 2008), Phoenix, Arizona (2008)"},{"key":"19_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-45744-5_8","volume-title":"Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Tobies, S.: The inverse method implements the automata approach for modal satisfiability. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 92\u2013106. Springer, Heidelberg (2001)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11779148_6","volume-title":"Developments in Language Theory","author":"M. Droste","year":"2006","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics on infinite words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 49\u201358. Springer, Heidelberg (2006)"},{"key":"19_CR12","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory, 2nd edn. Birkh\u00e4user, Basel (1998)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Haarslev, V., M\u00f6ller, R.: RACER system description. In: Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2001) (2001)","DOI":"10.1007\/3-540-45744-5_59"},{"key":"19_CR14","unstructured":"Horrocks, I.: Using an expressive description logic: FaCT or fiction. In: Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 1998), pp. 636\u2013647 (1998)"},{"issue":"1","key":"19_CR15","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.websem.2003.07.001","volume":"1","author":"I. Horrocks","year":"2003","unstructured":"Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From SHIQ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics\u00a01(1), 7\u201326 (2003)","journal-title":"Journal of Web Semantics"},{"key":"19_CR16","unstructured":"Lee, K., Meyer, T., Pan, J.Z.: Computing maximally satisfiable terminologies for the description logic $\\mathcal{ALC}$ with GCIs. In: Proc. of the 2006 Description Logic Workshop (DL\u00a02006), CEUR Electronic Workshop Proceedings (2006)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/1060745.1060837","volume-title":"Proc. of the 14th International Conference on World Wide Web (WWW 2005)","author":"B. Parsia","year":"2005","unstructured":"Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Ellis, A., Hagino, T. (eds.) Proc. of the 14th International Conference on World Wide Web (WWW 2005), pp. 633\u2013640. ACM Press, New York (2005)"},{"key":"19_CR18","unstructured":"Schlobach, S.: Diagnosing terminologies. In: Veloso, M.M., Kambhampati, S. (eds.) Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI\u00a02005), pp. 670\u2013675. AAAI Press\/The MIT Press (2005)"},{"key":"19_CR19","first-page":"355","volume-title":"Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003)","author":"S. Schlobach","year":"2003","unstructured":"Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob, G., Walsh, T. (eds.) Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico, pp. 355\u2013362. Morgan Kaufmann, Los Altos (2003)"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M. Schmidt-Schau\u00df","year":"1991","unstructured":"Schmidt-Schau\u00df, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence\u00a048(1), 1\u201326 (1991)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)90271-2","volume":"126","author":"H. Seidl","year":"1994","unstructured":"Seidl, H.: Finite tree automata with cost functions. Theor. Comput. Sci.\u00a0126(1), 113\u2013142 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR22","unstructured":"Sirin, E., Parsia, B.: Pellet: An OWL DL reasoner. In: Proc. of the 2004 Description Logic Workshop (DL\u00a02004), pp. 212\u2013213 (2004)"},{"key":"19_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. of Computer and System Sciences\u00a032, 183\u2013221 (1986); A preliminary version appeared in Proc. of the 16th ACM SIGACT Symp. on Theory of Computing (STOC 1984)","journal-title":"J. of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71070-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T19:48:52Z","timestamp":1684525732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71070-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540710691","9783540710707"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71070-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}