Axiom pinpointing in general tableaux

Journal of Logic and Computation

Volumn 20, Issue 1, 2010, Pages 5-34

  Baader, Franz ^a   Pealoza, Rafael ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Automated reasoning; Explanation; Pinpointing; Tableau methods

Indexed keywords

AUTOMATED REASONING; DESCRIPTION LOGIC; GENERAL APPROACH; KNOWLEDGE BASE; KNOWLEDGE BASIS; REASONING ALGORITHMS; REASONING PROCEDURES; TABLEAU ALGORITHM; TABLEAU METHOD;

AUTOMATA THEORY; DATA DESCRIPTION; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING;

ALGORITHMS;

EID: 76649145102     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exn058     Document Type: Conference Paper

References (34)

1. F. Baader, S. Brandt, and C. Lutz. Pushing the EL envelope. In Proceedings of IJCAI 2005, L. P. Kaelbling and A. Saffiotti, eds, pp. 364-369. Morgan Kaufmann, Los Altos, 2005.
2. F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88, 195-213, 1996.
3. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, eds. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York, 2003.
4. F. Baader, J. Hladik, C. Lutz, and F. Wolter. From tableaux to automata for description logics. Fundamenta Informaticae, 57, 247-279, 2003.
5. F. Baader and B. Hollunder. Embedding defaults into terminological knowledge representation formalisms. Journal of Automated Reasoning, 14, 149-180, 1995.
6. F. Baader and R. Penaloza. Axiom pinpointing in general tableaux. In Proceedings of Tableaux 07, LNAI 4548, N. Olivetti, ed., pp. 11-27. Springer-Verlag, Aix-en-Provence, France, 2007.
7. F. Baader, R. Peñaloza, and B. Suntisrivaraporn. Pinpointing in the description logic EL+. In Proceedings of KI2007, LNAI 4667, J. Hertzberg, M. Beetz and R. Englert, eds, pp. 52-67. Springer-Verlag, Osnabrueck, Germany, 2007.
8. F. Baader and U. Sattler. An overview of tableau algorithms for description logics. Studia Logica, 69, 5-40, 2001.
9. F. Baader and B. Suntisrivaraporn. Debugging SNOMED CT using axiom pinpointing in the description logic EL+. In Proceedings of KR-MED'08. R. Cornet, K. Spackman, eds, Poenix, Arizona, 2008.
10. J. Bailey and P. J. Stuckey. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In Proceedings of PADL'05, LNCS 3350, M. V. Hermenegildo, D. Cabeza, eds, pp. 174-186. Springer-Verlag, Long Beach, California, 2005.
11. G. Davydov, I. Davydova, and H. Kleine Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Annals of Mathematics and Artificial Intelligence, 23, 229-245, 1998.
12. M. R. Garey and D. S. Johnson. Computers and Intractability-A Guide to NP-completeness. W. H. Freeman and Company, San Francisco (CA, USA), 1979.
13. V. Haarslev and R. Möller. RACER system description. In Proceedings of IJCAR 2001, LNCS 2083, R. Goré,A. Leitsch, and T. Nipkow, eds, pp. 701-706. Springer-Verlag, Siena, Italy, 2001.
14. B. Hollunder. Consistency checking reduced to satisfiability of concepts in terminological systems. Annals of Mathematics and Artificial Intelligence, 18, 133-157, 1996. (Pubitemid 126716939)
15. B. Hollunder and F. Baader. Qualifying number restrictions in concept languages. In Proceedings of KR'91, J. F. Allen, R. Fikes, and E. Sandewall, eds, pp. 335-346. Morgan Kaufmann Publishers, Cambridge, MA, 1991.
16. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proceedings of KR'98, A. G. Cohn, L. K. Schubert, and S. C. Shapiro, eds, pp. 636-647, Trento, Italy, 1998.
17. I. Horrocks, P. F. Patel-Schneider, and F. van Harmelen. From SHIQ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics, 1, 7-26, 2003.
18. I. Horrocks and U. Sattler. A description logic with transitive and inverse roles and role hierarchies. Journal of Logic and Computation, 9, 385-410, 1999.
19. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. Journal of the Interest Group in Pure and Applied Logic, 8, 239-264, 2000.
20. A. Kalyanpur, B. Parsia, E. Sirin, B. Cuenca-Grau, and J. Hendler. Swoop: a web ontology editing browser. Journal of Web Semantics, 4, 144-153, 2005.
21. H. Knublauch, R. W. Fergerson, N. F. Noy, and M. A. Musen. The Protégé OWL plugin: an open development environment for semantic web applications. In Proceedings of the Third International Semantic Web Conference, LNCS 3298, S. A. McIlraith, D. Plexousakis, and F. Van Harmelen, eds, pp. 229-243. Springer-Verlag, Hiroshima, Japan, 2004.
22. K. Lee, T. Meyer, and J. Pan. Computing maximally satisable terminologies for the description logic ALC with GCIs. In Proceedings of DL 2006, CEUR Electronic Workshop Proceedings, B. Parsia, U. Sattler, and D. Toman, eds, Lake District, UK, 2006.
23. M. H. Liffiton and K. A. Sakallah. On finding all minimally unsatisfiable subformulas. In Proceedings of SAT'05, LNCS 3569, F. Bacchus and T. Walsh, eds, pp. 173-186. Springer-Verlag, St. Andrews, UK, 2005.
24. R. Nieuwenhuis and A. Oliveras. Fast congruence closure and extensions. Information and Computation, 205, 2007.
25. R. Nieuwenhuis,A. Oliveras, E. Rodríguez-Carbonell, andA. Rubio. Challenges in satisfiability modulo theories. In Proceedings of RTA'07, LNCS 4533, F. Baader, ed. pp. 2-18. Springer-Verlag, Paris, France, 2007.
26. D. Oberle, R. Volz, B. Motik, and S. Staab. An extensible ontology software environment. In Handbook on Ontologies, S. Staab and R. Studer, eds, pp. 311-333. Springer-Verlag, Berlin/Heidelberg, 2004.
27. B. Parsia, E. Sirin, and A. Kalyanpur. DebuggingOWLontologies. In Proceedings ofWWW'05, A. Ellis, and T. Hagino, eds, pp. 633-640. ACM, Chiba, Japan, 2005.
28. R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32, 57-95, 1987.
29. S. Schlobach. Diagnosing terminologies. In Proceedings of AAAI 2005, M. M. Veloso and S. Kambhampati, eds, pp. 670-675. AAAI Press/The MIT Press, Pittsburgh, Pennsylvania, 2005.
30. S. Schlobach and R. Cornet. Non-standard reasoning services for the debugging of description logic terminologies. In Proceedings of IJCAI 2003, G. Gottlob and T.Walsh, eds, pp. 355-362. MK, Acapulco, Mexico, 2003.
31. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48, 1-26, 1991.
32. E. Sirin and B. Parsia. Pellet: an OWL DL reasoner. In Proceedings of DL 2004, V. Haarslev and R. Möller, eds, pp. 212-213, 2004.
33. K. A. Spackman, K. E. Campbell, and R. A. Cote. SNOMED RT: a reference terminology for health care. Journal of the American Medical Informatics Association (Fall Symposium Supplement), pp. 640-644, 1997.
34. L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications. In Proceedings of DATE'03, pp. 10880-10885. IEEE Computer Society Press, Munich, Germany, 2003.