Pinpointing in the description logic εℒ+

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4667 LNAI, Issue , 2007, Pages 52-67

  Baader, Franz ^a   Peñaloza, Rafael ^b   Suntisrivaraporn, Boontawee ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

DESCRIPTION LOGICS (DL); KNOWLEDGE BASE; MINIMAL SUBSETS; POLYNOMIAL TIME;

FORMAL LOGIC;

EID: 38149084728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74565-5_7     Document Type: Conference Paper

References (26)

1. Baader, F., Brandt, S., Lutz, C.: Pushing the εℒ envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), Edinburgh (UK), pp. 364-369. Morgan Kaufmann, Los Altos (2005)
2. 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)
3. Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms. J. of Automated Reasoning 14, 149-180 (1995)
4. Baader, F., Lutz, C., Suntisrivaraporn, B.: CEL - a polynomial-time reasoner for life science ontologies. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 287-291. Springer, Heidelberg (2006)
5. Baader, F., Lutz, C., Suntisrivaraporn, B.: Is tractable reasoning in extensions of the description logic εℒ useful in practice. Journal of Logic, Language and Information, Special Issue on Method for Modality on M4M (to appear, 2007)
6. Baader, F., Penaloza, R.: Axiom pinpointing in general tableaux. LTCS-Report LTCS-07-01, Germany, See (2006), http://lat.inf.tu-dresden.de/ research/reports.html
7. Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) Practical Aspects of Declarative Languages. LNCS, vol. 3350, pp. 174-186. Springer, Heidelberg (2005)
8. Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: de Mántaras, R.L., Saitta, L. (eds.) Proc. of the 16th Eur. Conf. on Artificial Intelligence (ECAI 2004), pp. 298-302 (2004)
9. Davydov, G., Davydova, I., Büning, H.K.: 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)
10. Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming 1(3), 267-284 (1984)
11. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. Technical Report CD-TR 91/16, Christian Doppler Labor für Expertensysteme, TU-Wien (1991)
12. Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278-1304 (1995)
13. Garey, M.R., Johnson, D.S.: Computers and Intractability - A guide to NP-completeness. W. H. Freeman and Company, San Francisco (1979)
14. Hollunder, B.: Hybrid inferences in KL-ONE-based knowledge representation systems. In: Proc. of the German Workshop on Artificial Intelligence, pp. 38-47. Springer, Heidelberg (1990)
15. 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 1(1), 7-26 (2003)
16. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. (1988)
17. Kavvadias, D.J., Sideri, M., Stavropoulos, E.C.: Generating all maximal models of a Boolean expression. Inf. Process. Lett. (2000)
18. Liffiton, M.H., Sakallah, K.A.: On finding all minimally unsatisfiable subformulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 173-186. Springer, Heidelberg (2005)
19. Meyer, T., Lee, K., Booth, R., Pan, J.Z.: Finding maximally satisfiable terminologies for the description logic ACC. In: Proc. of the 21st Nat. Conf. on Artificial Intelligence (AAAI 2006), AAAI Press/The MIT Press (2006)
20. 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'05), pp. 633-640. ACM Press, New York (2005)
21. Rector, A., Horrocks, I.: Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In: Proceedings of the Workshop on Ontological Engineering, AAAI Spring Symposium (AAAF97), Stanford, CA, AAAI Press (1997)
22. 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-362. Morgan Kaufmann, Los Altos (2003)
23. Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence 48(1), 1-26 (1991)
24. Spackman, K.A., Campbell, K.E., Cote, R.A.: SNOMED RT: A reference terminology for health care. J. of the American Medical Informatics Association (Fall Symposium Supplement), 640-644 (1997)
25. The Gene Ontology Consortium. Gene Ontology: Tool for the unification of biology. Nature Genetics, 25, 25-29 (2000)
26. Zhang, L., Malik, S.: Validating SAT solvers using an independent resolutionbased checker: Practical implementations and other applications. In: Proc. of the Conference on Design, Automation and Test in Europe (DATE'03), pp. 10880-10885. IEEE Computer Society Press, Los Alamitos (2003)