Axiom pinpointing is hard

CEUR Workshop Proceedings

Volumn 477, Issue , 2009, Pages

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

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTING PROBLEMS; DESCRIPTION LOGIC; HARDNESS RESULT; HORN FRAGMENTS; HYPERGRAPH; LEXICOGRAPHIC ORDER; MINIMAL SUBSET; NP-HARD;

FORMAL LANGUAGES;

DATA DESCRIPTION;

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

References (21)

1. F. Baader and B. Hollunder. Embedding defaults into terminological representation systems. Journal of Automated Reasoning, 14:149-180, 1995.
2. +. In J. Hertzberg, M. Beetz, and R. Englert, editors, Proceedings of the 30th German Conference on Artificial Intelligence (KI2007), volume 4667 of Lecture Notes in Artificial Intelligence, pages 52-67. Springer-Verlag, 2007.
3. +. In Proceedings of the International Conference on Representing and Sharing Knowledge Using SNOMED (KR-MED'08), Phoenix, Arizona, 2008.
4. C. Berge. Hypergraphs. Elsevier Science Publishers B.V. (North Holland), 1989.
5. D. Calvanese, G. D. Giacomo, M. Lenzerini, R. Rosati, and G. Vetere. DL-Lite: Practical reasoning for rich DLs. In Proceedings of the 2004 Description Logic Workshop (DL 2004), volume 104 of CEUR Electronic Workshop Proceedings, http://ceur-ws.org/2004.
6. A. Durand and M. Hermann. On the counting complexity of propositional circumscription. Information Processing Letters, 106(4):164-170, 2008.
7. T. Eiter and G. Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3-42, 1995.
8. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6):1278-1304, 1995.
9. T. Eiter and G. Gottlob. Hypergraph transversal computation and related problems in logic and AI. In S. Flesca, S. Greco, N. Leone, and G. Ianni, editors, Proceedings of the European Conference on Logics in Artificial Intelligence (JELIA 2002), volume 2424 of Lecture Notes in Computer Science, pages 549-564. Springer- Verlag, 2002.
10. M. L. Fredman and L. Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21(3):618-628, 1996.
11. G. Friedrich, G. Gottlob, and W. Nejdl. Hypothesis classification, abductive diagnosis and therapy. In G. Gottlob and W. Nejdl, editors, Proceedings of the International Workshop on Expert Systems in Engineering, Principles and Applications, volume 462 of Lecture Notes in Computer Science, pages 69-78, Viena, Austria, 1990. Springer-Verlag.
12. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, New York, NY, USA, 1990.
13. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27(3):119-123, 1988.
14. K. Lee, T. Meyer, and J. Z. Pan. Computing maximally satisfiable terminologies for the description logic ALC with GCIs. In B. Parsia, U. Sattler, and D. Toman, editors, Proceedings of the International Workshop on Description Logics (DL'06), Lake District, UK, 2006.
15. B. Parsia, E. Sirin, and A. Kalyanpur. Debugging OWL ontologies. In A. Ellis and T. Hagino, editors, Proceedings of the 14th international conference on World Wide Web (WWW 2005), pages 633-640. ACM, 2005.
16. R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57-95, 1987.
17. R. Rymon. Search through systematic set enumeration. In B. Nebel, C. Rich, and W. Swartout, editors, Proceedings of the International Conference on the Principles of Knowledge Representation and Reasoning (KR'92), pages 539-550, Cambridge, MA, USA, 1992.
18. S. Schlobach and R. Cornet. Non-standard reasoning services for the debugging of description logic terminologies. In G. Gottlob and T. Walsh, editors, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJ- CAI'03), pages 355-362. Morgan Kaufmann, 2003.
19. S. Schlobach, Z. Huang, R. Cornet, and F. Harmelen. Debugging incoherent terminologies. Journal of Automated Reasoning, 39(3):317-349, 2007.
20. B. Suntisrivaraporn, G. Qi, Q. Ji, and P. Haase. A modularization-based approach to finding all justifications for OWL DL entailments. In J. Domingue and C. Anutariya, editors, Proceedings of the 3rd Asian Semantic Web Conference (ASWC'08), volume 5367 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, 2008.
21. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8(2):189-201, 1979.