Pinpointing in the description logic EL

CEUR Workshop Proceedings

Volumn 250, Issue , 2007, Pages 171-178

  Baader, Franz ^a   Pẽnaloza, Rafael ^b   Suntisrivaraporn, Boontawee ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84872956730     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. F. Baader, S. Brandt, and C. Lutz. Pushing the EL envelope. In Proc. of IJCAI 2005, pages 364-369. Morgan Kaufmann, Los Altos, 2005.
2. F. Baader and B. Hollunder. Embedding defaults into terminological knowledge representation formalisms. J. of Automated Reasoning, 14:149-180, 1995.
3. F. Baader, C. Lutz, and B. Suntisrivaraporn. CEL-a polynomial-time reasoner for life science ontologies. In Proceedings of IJCAR'06, volume 4130 of LNAI, pages 287-291. Springer-Verlag, 2006.
4. F. Baader and R. Penaloza. Axiom pinpointing in general tableaux. LTCS-Report 07-01, Germany, 2007. See http://lat.inf.tu-dresden.de/research/ reports.html.
5. J. Bailey and P.J. Stuckey. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In Proc. of PADL'05, volume 3350 of LNCS, pages 174-186. Springer, 2005.
6. S. Brandt. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and-what else? In Proc. of ECAI 2004, pages 298-302.
7. G. Davydov, I. Davydova, and H. Kleine Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Ann. of Mathematics and Artificial Intelligence, 23(3-4):229-245, 1998.
8. M. R. Garey and D. S. Johnson. Computers and Intractability - A guide to NPcompleteness. W. H. Freeman and Company, San Francisco (CA, USA), 1979.
9. B. Hollunder. Hybrid inferences in KL-ONE-based knowledge representation systems. In Proc. of German Workshop on AI, pages 38-47. Springer, 1990.
10. M.H. Liffiton and K.A. Sakallah. On finding all minimally unsatisfiable subformulas. In Proc. of SAT'05, volume 3569 of LNCS, pages 173-186. Springer, 2005.
11. T. Meyer, K. Lee, R. Booth, and J. Z. Pan. Finding maximally satisfiable terminologies for the description logic ALC. In Proc. of AAAI 2006. AAAI Press.
12. B. Parsia, E. Sirin, and A. Kalyanpur. Debugging OWL ontologies. In Proc. of WWW'05, pages 633-640. ACM, 2005.
13. A. Rector and I. Horrocks. Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In Proceedings of AAAI'97, Stanford, CA, 1997. AAAI Press.
14. S. Schlobach and R. Cornet. Non-standard reasoning services for the debugging of description logic terminologies. In Proc. of IJCAI 2003, pages 355-362, Acapulco, Mexico, 2003. Morgan Kaufmann, Los Altos.
15. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1):1-26, 1991.
16. K.A. Spackman, K.E. Campbell, and R.A. Cote. SNOMED RT: A reference terminology for health care. J. of the Am. Med. Inf. Ass., pages 640-644, 1997.
17. The Gene Ontology Consortium. Gene Ontology: Tool for the unification of biology. Nature Genetics, 25:25-29, 2000.
18. L. Zhang and S. Malik. Validating SAT solvers using an independent resolutionbased checker: Practical implementations and other applications. In Proc. of DATE'03, pages 10880-10885. IEEE Computer Society Press, 2003.