Logic-based ontology comparison and module extraction, with an application to DL-Lite

Artificial Intelligence

Volumn 174, Issue 15, 2010, Pages 1093-1141

  Kontchakov, Roman ^a   Wolter, Frank ^b   Zakharyaschev, Michael ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Computational complexity; Description logic; Entailment; Forgetting; Module extraction; Ontology; Uniform interpolation

Indexed keywords

DESCRIPTION LOGIC; ENTAILMENT; FORGETTING; MODULE EXTRACTION; UNIFORM INTERPOLATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA DESCRIPTION; FORMAL LOGIC; INTERPOLATION; XML;

ONTOLOGY;

EID: 77955853143     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2010.06.003     Document Type: Article

References (64)

1. B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U. Sattler Modular reuse of ontologies: Theory and practice J. Artificial Intelligence Research 31 2008 273 318
2. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, P.F. Patel-Schneider, The Description Logic Handbook: Theory, Implementation and Applications 2003 Cambridge University Press
3. N. Noy, M. Musen, Promptdiff: A fixed-point algorithm for comparing ontology versions, in: Proc. of the 18th Nat. Conf. on Artificial Intelligence (AAAI 2002), 2002, pp. 744-750.
4. B. Cuenca Grau, I. Horrocks, Y. Kazakov, U. Sattler, A logical framework for modularity of ontologies, in: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI 2007), 2007, pp. 298-303.
5. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati, DL-Lite: Tractable description logics for ontologies, in: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), 2005, pp. 602-607.
6. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati, Data complexity of query answering in description logics, in: Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006), 2006, pp. 260-270.
7. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati Tractable reasoning and efficient query answering in description logics: The DL-Lite family J. Automated Reasoning 39 3 2007 385 429
8. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati Linking data to ontologies J. Data Semantics X 2008 133 173
9. A. Artale, D. Calvanese, R. Kontchakov, V. Ryzhikov, and M. Zakharyaschev Reasoning over extended ER models Proc. of the 26th Int. Conf. on Conceptual Modeling (ER 2007) Lecture Notes in Computer Science vol. 4801 2007 Springer 277 292
10. A. Artale, D. Calvanese, R. Kontchakov, M. Zakharyaschev, DL-Lite in the light of first-order logic, in: Proc. of the 22nd Nat. Conf. on Artificial Intelligence (AAAI 2007), 2007, pp. 361-366.
11. A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev The DL-Lite family and relations J. Artificial Intelligence Research 36 2009 1 69
12. H. Stuckenschmidt, C. Parent, S. Spaccapietra, Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization Lecture Notes in Computer Science vol. 5445 2009 Springer
13. P. Haase, V. Honavar, O. Kutz, Y. Sure, A. Tamilin (Eds.), Proc. of the 1st Int. Workshop on Modular Ontologies, WoMO'06, co-located with the International Semantic Web Conference (ISWC'06), Athens, Georgia, USA, November 5, 2006, CEUR Workshop Proceedings, vol. 232, CEUR-WS.org, 2007.
14. B. Cuenca Grau, V. Honavar, A. Schlicht, F. Wolter (Eds.), Proc. of the 2nd Int. Workshop on Modular Ontologies (WoMO 2007), Whistler, Canada, October 28, 2007, CEUR Workshop Proceedings, vol. 315, CEUR-WS.org, 2008.
15. N.F. Noy, and M.A. Musen Specifying ontology views by traversal S.A. McIlraith, D. Plexousakis, F. van Harmelen, Proc. of the 3rd Int. Semantic Web Conf. ISWC 2004 Lecture Notes in Computer Science vol. 3298 2004 Springer 713 725
16. J. Seidenberg, and A. Rector Web ontology segmentation: Analysis, classification and use L. Carr, D.D. Roure, A. Iyengar, C.A. Goble, M. Dahlin, Proc. of the 15th Int. Conf. on World Wide Web (WWW 2006) 2006 ACM Press New York, NY, USA 13 22
17. B. Cuenca Grau, B. Parsia, E. Sirin, and A. Kalyanpur Modularity and web ontologies P. Doherty, J. Mylopoulos, C.A. Welty, Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006) 2006 AAAI Press 198 209
18. B. Konev, C. Lutz, D. Walther, and F. Wolter Semantic modularity and module extraction in description logics M. Ghallab, C.D. Spyropoulos, N. Fakotakis, N. Avouris, Proc. of the 18th Europ. Conf. on Artificial Intelligence (ECAI08) Frontiers in Artificial Intelligence and Applications vol. 178 2008 IOS Press 55 59
19. J. Lang, P. Liberatore, and P. Marquis Propositional independence: Formula-variable independence and forgetting J. Artificial Intelligence Research 18 2003 391 443
20. F. Lin, R. Reiter, Forget it!, in: Proc. of the AAAI Fall Symposium on Relevance, 1994, pp. 154-159.
21. T. Eiter, and K. Wang Semantic forgetting in answer set programming Artificial Intelligence 172 3 2008 1644 1672
22. A. Pitts On an interpretation of second-order quantification in first-order intuitionistic propositional logic J. Symbolic Logic 57 1 1992 33 52
23. A. Visser Uniform interpolation and layered bisimulation P. Hájek, Gödel'96 Lecture Notes in Logic vol. 6 1996 Springer 139 164
24. S. Ghilardi, C. Lutz, F. Wolter, Did I damage my ontology? A case for conservative extensions in description logic, in: Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006), 2006, pp. 187-197.
25. B. Konev, C. Lutz, D. Walther, and F. Wolter Formal properties of modularisation Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization 2009 Springer 25 66
26. B. Konev, D. Walther, F. Wolter, Forgetting and uniform interpolation in large-scale description logic terminologies, in: Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI 2009), 2009, pp. 830-835.
27. Z. Wang, K. Wang, R.W. Topor, and J.Z. Pan Forgetting concepts in DL-Lite S. Bechhofer, M. Hauswirth, J. Hoffmann, M. Koubarakis, Proc. of the 5th Europ. Semantic Web Conf. ESWC 2008 Lecture Notes in Computer Science vol. 5021 2008 Springer 245 257
28. L. Pulina, and A. Tacchella A self-adaptive multi-engine solver for quantified Boolean formulas Constraints 14 1 2009 80 116
29. R. Kontchakov, F. Wolter, M. Zakharyaschev, Can you tell the difference between DL-Lite ontologies?, in: Proc. of the 11th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2008), 2008, pp. 285-295.
30. R. Kontchakov, L. Pulina, U. Sattler, T. Schneider, P. Selmer, F. Wolter, M. Zakharyaschev, Minimal module extraction from DL-Lite ontologies using QBF solvers, in: Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI 2009), 2009, pp. 836-840.
31. A. Acciarri, D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, M. Palmieri, R. Rosati, QuOnto: Querying ontologies, in: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), 2005, pp. 1670-1671.
32. A. Poggi, M. Rodriguez, M. Ruzzi, Ontology-based database access with DIG-Mastro and the OBDA Plugin for Protégé, in: K. Clark, P.F. Patel-Schneider (Eds.), Proc. of the 4th Int. Workshop on OWL: Experiences and Directions (OWLED 2008 DC), 2008.
33. C. Lutz, D. Walther, F. Wolter, Conservative extensions in expressive description logics, in: Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI 2007), 2007, pp. 453-458.
34. C. Lutz, and F. Wolter Mathematical logic for life science ontologies H. Ono, M. Kanazawa, R.J.G.B. de Queiroz, Logic, Language, Information and Computation, 16th Int. Workshop (WoLLIC 2009) Lecture Notes in Computer Science vol. 5514 2009 Springer 37 47
35. R. Diaconescu, J. Goguen, and P. Stefaneas Logical support for modularisation G. Huet, G. Plotkin, Logical Environments 1993 Cambridge University Press New York 83 130
36. P. Mosses, CASL Reference Manual: The Complete Documentation of the Common Algebraic Specification Language Lecture Notes in Computer Science vol. 2960 2004 Springer
37. P. Byers, and D.H. Pitt Conservative extensions: A cautionary note Bulletin of the EATCS 41 1990 196 201
38. T. Maibaum Conservative extensions, interpretations between theories and all that! M. Bidoit, M. Dauchet, Proc. of the 7th Int. Joint Conf. CAAP/FASE on Theory and Practice of Software Development (TAPSOFT '97) Lecture Notes in Computer Science vol. 1214 1997 Springer 40 66
39. G. Antoniou, and A. Kehagias A note on the refinement of ontologies Int. J. Intelligent Systems 15 7 2000 623 632
40. T. Eiter, M. Fink, S. Woltran, Semantical characterizations and complexity of equivalences in answer set programming, ACM Trans. Comput. Log. 8 (3).
41. M. Fink Equivalences in answer-set programming by countermodels in the logic of here-and-there M.G. de la Banda, E. Pontelli, Proc. of the 24th Int. Conf. on Logic Programming (ICLP 2008) Lecture Notes in Computer Science vol. 5366 2008 Springer 99 113
42. D. Pearce, A. Valverde, Synonymous theories in answer set programming and equilibrium logic, in: Proc. of the 16th European Conf. on Artificial Intelligence (ECAI 2004), 2004, pp. 388-392.
43. V. Lifschitz, D. Pearce, A. Valverde, A characterization of strong equivalence for logic programs with variables, in: Proc. of the 9th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2007, pp. 188-200.
44. C. Lutz, and F. Wolter Deciding inseparability and conservative extensions in the description logic EL J. Symbolic Computation 45 2 2010 194 228
45. R. Rosati Finite model reasoning in DL-Lite S. Bechhofer, M. Hauswirth, J. Hoffmann, M. Koubarakis, Proc. of the 5th Europ. Semantic Web Conf. (ESWC 2008) Lecture Notes in Computer Science vol. 5021 2008 Springer 215 229
46. C. Chang, and H. Keisler Model Theory 1990 Elsevier
47. C. Areces, and B. ten Cate Hybrid logics P. Blackburn, J. van Benthem, F. Wolter, Handbook of Modal Logic 2006 Elsevier 821 868
48. C. Papadimitriou Computational Complexity 1994 Addison-Wesley
49. D. Kozen Theory of Computation 2006 Springer
50. H. Kleine Büning, and T. Lettman Propositional Logic: Deduction and Algorithms 1999 Cambridge University Press
51. C. Lutz, and F. Wolter Conservative extensions in the lightweight description logic EL F. Pfenning, Proc. of the 21st Conf. on Automated Deduction (CADE-21) Lecture Notes in Computer Science vol. 4603 2007 Springer 84 99
52. B. Konev, D. Walther, and F. Wolter The logical difference problem for description logic terminologies Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR-08) LNAI 2008 Springer 259 274
53. S. Feferman, and R.L. Vaught The first-order properties of algebraic systems Fundamenta Mathematicae 47 1959 57 103
54. V. Kuncak, H.H. Nguyen, and M.C. Rinard Deciding Boolean algebra with Presburger arithmetic J. Automated Reasoning 36 3 2006 213 239
55. S. Ghilardi, C. Lutz, F. Wolter, and M. Zakharyaschev Conservative extensions in modal logics G. Governatori, I. Hodkinson, Y. Venema, Advances in Modal Logics, vol. 6 2006 College Publications 187 207
56. H. Liu, C. Lutz, M. Miličić, F. Wolter, Updating description logic ABoxes, in: Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006), 2006, pp. 46-56.
57. A. Remshagen, and K. Truemper The complexity of futile questioning H.R. Arabnia, P.L. Zhou, Proc. of the Int. Conf. on Foundations of Computer Science (FCS 2007) 2007 CSREA Press 132 138
58. M. Benedetti sKizzo: A suite to evaluate and certify QBFs R. Nieuwenhuis, Proc. of the 20th Int. Conf. on Automated Deduction (CADE-20) Lecture Notes in Computer Science vol. 3632 2005 Springer 369 376
59. H. Samulowitz, and F. Bacchus Binary clause reasoning in QBF A. Biere, C.P. Gomes, Proc. of the 9th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2006) Lecture Notes in Computer Science vol. 4121 2006 Springer 353 367
60. L. Zhang, and S. Malik Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation P.V. Hentenryck, Proc. of the 8th Int. Conf. on Principles and Practice of Constraint Programming (CP 2002) Lecture Notes in Computer Science vol. 2470 2002 Springer 200 215
61. L. Zhang, and S. Malik Conflict driven learning in a quantified Boolean satisfiability solver L.T. Pileggi, A. Kuehlmann, Proc. of the IEEE/ACM Int. Conf. on Computer-aided Design (ICCAD) 2002 ACM 442 449
62. E. Giunchiglia, M. Narizzano, and A. Tacchella Clause-term resolution and learning in quantified Boolean logic satisfiability J. Artificial Intelligence Research 26 2006 371 416
63. F. Lonsing, A. Biere, DepQBF: A dependency-aware QBF solver, J. Satisfiability, Boolean Modeling and Computation (2010), in press.
64. C. Peschiera, L. Pulina, A. Tacchella, U. Bubeck, O. Kullmann, and I. Lynce The seventh QBF solvers evaluation (QBFEVAL'10) O. Strichman, S. Szeider, Proc. of the 13th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'10) Lecture Notes in Computer Science vol. 6175 2010 Springer 237 250 see also http://www.qbflib.org/index-eval.php