On the complexity of axiom pinpointing in the EL family of description logics

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2010, Pages 280-289

  Peñaloza, Rafael ^a   Sertkaya, Bariş ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LANGUAGES; HARDNESS; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION;

COMPLEXITY RESULTS; DESCRIPTION LOGIC; ENUMERATION PROBLEMS; HARDNESS RESULT; HORN FRAGMENTS; KNOWLEDGE BASE; MINIMAL SUBSET;

DATA DESCRIPTION;

EID: 84860582958     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Baader, F., and Hollunder, B. 1995. Embedding defaults into terminological representation systems. Journal of Automated Reasoning 14:149-180.
2. Baader, F., and Peñaloza, R. 2007. Axiom pinpointing in general tableaux. In Olivetti, N., ed., Proceedings of the 16th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, (TABLEAUX 2007), volume 4548 of Lecture Notes in Computer Science, 11-27. Springer-Verlag.
3. Baader, F., and Peñaloza, R. 2008. Automata-based axiom pinpointing. In Armando, A.; Baumgartner, P.; and Dowek, G., eds., Proceedings of the 4th International Joint Conference on Automated Reasoning, (IJCAR 2008), volume 5195 of Lecture Notes in Computer Science, 226-241. Springer-Verlag.
4. Baader, F., and Peñaloza, R. 2010a. Automata-based axiom pinpointing. Journal of Automated Reasoning. To appear.
5. Baader, F., and Peñaloza, R. 2010b. Axiom pinpointing in general tableaux. Journal of Logic and Computation. To appear.
6. Baader, F.; Calvanese, D.; McGuinness, D.; Nardi, D.; and Patel-Schneider, P. F., eds. 2003. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press.
7. +. InHertzberg, J.; Beetz, M.; and Englert, R., eds., Proceedings of the 30th German Conference on Artificial Intelligence (KI2007), volume 4667 of Lecture Notes in Artificial Intelligence, 52-67. Springer-Verlag.
8. Baader, F. 2003. Terminological cycles in a description logic with existential restrictions. In Gottlob, G., andWalsh, T., eds., Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI'03), 325-330. Morgan Kaufmann.
9. Brandt, S. 2004. Polynomial time reasoning in a description logic with existential restrictions, gci axioms, and - what else? In deMántaras, R. L., and Saitta, L., eds., Proceedings of the 16th Eureopean Conference on Artificial Intelligence, (ECAI 2004), 298-302. IOS Press.
10. Danielson, G. H. 1968. On finding the simple paths and circuits in a graph. IEEE Transactions on Circuit Theory 15(3):294-295.
11. Dowling, W. F., and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 3:267-284.
12. Eiter, T., and Gottlob, G. 1991. Identifying the minimal transversals of a hypergraph and related problems. Technical Report CD-TR 91/16, Christian Doppler Laboratory for Expert Systems, TU Vienna.
13. Eiter, T., and Gottlob, G. 1995a. The complexity of logicbased abduction. Journal of the ACM 42(1):3-42.
14. Eiter, T., and Gottlob, G. 1995b. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6):1278-1304.
15. Fredman, M. L., and Khachiyan, L. 1996. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21(3):618-628.
16. Garey, M. R., and Johnson, D. S. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Company.
17. Hagen, M. 2008. Algorithmic and Computational Complexity Issues of MONET. Ph.D. dissertation, Institut für Informatik, Friedrich-Schiller- Universität Jena.
18. Horridge, M.; Parsia, B.; and Sattler, U. 2008. Laconic and precise justifications in owl. In Sheth, A. P.; Staab, S.; Dean, M.; Paolucci, M.; Maynard, D.; Finin, T. W.; and Thirunarayan, K., eds., Proceedings of the 7th International Semantic Web Conference, (ISWC 2008), volume 5318 of Lecture Notes in Computer Science, 323-338. Springer-Verlag.
19. Horridge, M.; Parsia, B.; and Sattler, U. 2009. Explaining inconsistencies in owl ontologies. In Godo, L., and Pugliese, A., eds., Proceedings of the Third International Conference on Scalable Uncertainty Management, (SUM 2009), volume 5785 of Lecture Notes in Computer Science, 124-137. Springer-Verlag.
20. Horridge, M.; Tsarkov, D.; and Redmond, T. 2006. Supporting early adoption of OWL 1.1 with Protege-OWL and FaCT++. In Proceedings of the Second International Workshop OWL: Experiences and Directions (OWLED 2006). CEUR-WS.
21. Horrocks, I.; Patel-Schneider, P. F.; and van Harmelen, F. 2003. From SHIQ and RDF to OWL: the making of a web ontology language. Journal of Web Semantics 1(1):7-26.
22. Johnson, D. S.; Yannakakis, M.; and Papadimitriou, C. H. 1988. On generating all maximal independent sets. Information Processing Letters 27(3):119-123.
23. Kalyanpur, A.; Parsia, B.; Sirin, E.; Grau, B. C.; and Hendler, J. A. 2006. Swoop: A web ontology editing browser. Journal of Web Semantics 4(2):144-153.
24. Kalyanpur, A.; Parsia, B.; Horridge, M.; and Sirin, E. 2007. Finding all justifications of owl dl entailments. In Proceedings of the 6th International Semantic Web Conference, 2nd Asian Semantic Web Conference, (ISWC 2007 + ASWC 2007), volume 4825 of Lecture Notes in Computer Science, 267-280. Springer-Verlag.
25. Knublauch, H.; Fergerson, R. W.; Noy, N. F.; and Musen, M. A. 2004. The protégé OWL plugin: An open development environment for semantic web applications. In McIlraith, S. A.; Plexousakis, D.; and van Harmelen, F., eds., Proceedings of the 3rd International Semantic Web Conference, (ISWC 2004), volume 3298 of Lecture Notes in Computer Science, 229-243. Springer-Verlag.
26. Meyer, T.; Lee, K.; Booth, R.; and Pan, J. Z. 2006. Finding maximally satisfiable terminologies for the description logic ALC. In Proceedings of the 21st Natonal Conference on Artificial Intelligence (AAAI 2006), 269-274. AAAI Press/The MIT Press.
27. Nielsen, L. R.; Pretolani, D.; and Andersen, K. A. 2006. Finding the shortest hyperpaths using reoptimization. Oper. Res. Lett. 34(2):155-164.
28. Parsia, B.; Sirin, E.; and Kalyanpur, A. 2005. Debugging OWL ontologies. In Ellis, A., and Hagino, T., eds., Proceedings of the 14th international conference onWorld WideWeb (WWW 2005), 633-640. ACM.
29. Peñaloza, R., and Sertkaya, B. 2009. Axiom pinpointing is hard. In Grau, B. C.; Horrocks, I.; Motik, B.; and Sattler, U., eds., Proceedings of the 2009 InternationalWorkshop on Description Logics (DL2009), volume 477 of CEUR-WS.
30. Reiter, R. 1987. A theory of diagnosis from first principles. Artificial Intelligence 32(1):57-95.
31. Schlobach, S., and Cornet, R. 2003. Non-standard reasoning services for the debugging of description logic termi-nologies. In Gottlob, G., andWalsh, T., eds., Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03), 355-362. Morgan Kaufmann.
32. Schmidt-Schauß, M., and Smolka, G. 1991. Attributive concept descriptions with complements. Artificial Intelligence 48(1):1-26.
33. Sebastiani, R., and Vescovi, M. 2009. Axiom pinpointing in lightweight description logics via horn-sat encoding and conflict analysis. In Schmidt, R. A., ed., Proceedings of the 22nd International Conference on Automated Deduction, (CADE-22), volume 5663 of Lecture Notes in Computer Science, 84-99. Springer-Verlag.
34. Suntisrivaraporn, B.; Qi, G.; Ji, Q.; and Haase, P. 2008. A modularization-based approach to finding all justifications for OWL DL entailments. In Domingue, J., and Anutariya, C., eds., Proceedings of the 3rd Asian Semantic Web Conference (ASWC'08), volume 5367 of Lecture Notes in Computer Science, 1-15. Springer-Verlag.
35. Yen, J. Y. 1971. Finding K shortest loopless paths in a network. Management Science 17(11):712-716.