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

We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of ‘lightweight’ description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Artificial intelligence Ročník 174; číslo 15; s. 1093 - 1141
Hlavní autoři:	Kontchakov, Roman, Wolter, Frank, Zakharyaschev, Michael
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 01.10.2010 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computational complexity Computer science; control theory; systems Description logic Encoding Entailment Exact sciences and technology Extraction Forgetting Inclusions Information systems. Data bases Language theory and syntactical analysis Logic Logical, boolean and switching functions Mathematical logic Memory organisation. Data processing Module extraction Modules Ontology Signatures Software Solvers Theoretical computing Uniform interpolation Forgetting Module extraction Description logic Ontology Uniform interpolation Computational complexity Entailment High performance Vocabulary Formal method Language theory Locality Knowledge representation Very large databases Syntactic analysis Logic design Logical programming Maintenance Distributed computing Semantic web Mathematical logic Computational linguistics Satisfiability
ISSN:	0004-3702, 1872-7921
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of ‘lightweight’ description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary (=signature) with respect to which one wants to compare ontologies. Five variants of difference and inseparability relations between ontologies are introduced and their respective applications for ontology development and maintenance discussed. These variants are obtained by generalising the notion of conservative extension from mathematical logic and by distinguishing between differences that can be observed among concept inclusions, answers to queries over ABoxes, by taking into account additional context ontologies, and by considering a model-theoretic, language-independent notion of difference. We compare these variants, study their meta-properties, determine the computational complexity of the corresponding reasoning tasks, and present decision algorithms. Moreover, we show that checking inseparability can be automated by means of encoding into QBF satisfiability and using off-the-shelf general purpose QBF solvers. Inseparability relations between ontologies are then used to develop a formal framework for (minimal) module extraction. We demonstrate that different types of minimal modules induced by these inseparability relations can be automatically extracted from real-world medium-size DL-Lite ontologies by composing the known tractable syntactic locality-based module extraction algorithm with our non-tractable extraction algorithms and using the multi-engine QBF solver aqme. Finally, we explore the relationship between uniform interpolation (or forgetting) and inseparability.
AbstractList	We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of a~lightweight' description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary ( = signature ) with respect to which one wants to compare ontologies. Five variants of difference and inseparability relations between ontologies are introduced and their respective applications for ontology development and maintenance discussed. These variants are obtained by generalising the notion of conservative extension from mathematical logic and by distinguishing between differences that can be observed among concept inclusions, answers to queries over ABoxes, by taking into account additional context ontologies, and by considering a model-theoretic, language-independent notion of difference. We compare these variants, study their meta-properties, determine the computational complexity of the corresponding reasoning tasks, and present decision algorithms. Moreover, we show that checking inseparability can be automated by means of encoding into QBF satisfiability and using off-the-shelf general purpose QBF solvers. Inseparability relations between ontologies are then used to develop a formal framework for (minimal) module extraction. We demonstrate that different types of minimal modules induced by these inseparability relations can be automatically extracted from real-world medium-size DL-Lite ontologies by composing the known tractable syntactic locality-based module extraction algorithm with our non-tractable extraction algorithms and using the multi-engine QBF solver aqme. Finally, we explore the relationship between uniform interpolation (or forgetting) and inseparability. We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of 'lightweight' description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary ( = signature ) with respect to which one wants to compare ontologies. Five variants of difference and inseparability relations between ontologies are introduced and their respective applications for ontology development and maintenance discussed. These variants are obtained by generalising the notion of conservative extension from mathematical logic and by distinguishing between differences that can be observed among concept inclusions, answers to queries over ABoxes, by taking into account additional context ontologies, and by considering a model-theoretic, language-independent notion of difference. We compare these variants, study their meta-properties, determine the computational complexity of the corresponding reasoning tasks, and present decision algorithms. Moreover, we show that checking inseparability can be automated by means of encoding into QBF satisfiability and using off-the-shelf general purpose QBF solvers. Inseparability relations between ontologies are then used to develop a formal framework for (minimal) module extraction. We demonstrate that different types of minimal modules induced by these inseparability relations can be automatically extracted from real-world medium-size DL-Lite ontologies by composing the known tractable syntactic locality-based module extraction algorithm with our non-tractable extraction algorithms and using the multi-engine QBF solver aqme. Finally, we explore the relationship between uniform interpolation (or forgetting) and inseparability. We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of ‘lightweight’ description logics designed for data-intensive applications. The main feature of our approach is that we take into account the vocabulary (=signature) with respect to which one wants to compare ontologies. Five variants of difference and inseparability relations between ontologies are introduced and their respective applications for ontology development and maintenance discussed. These variants are obtained by generalising the notion of conservative extension from mathematical logic and by distinguishing between differences that can be observed among concept inclusions, answers to queries over ABoxes, by taking into account additional context ontologies, and by considering a model-theoretic, language-independent notion of difference. We compare these variants, study their meta-properties, determine the computational complexity of the corresponding reasoning tasks, and present decision algorithms. Moreover, we show that checking inseparability can be automated by means of encoding into QBF satisfiability and using off-the-shelf general purpose QBF solvers. Inseparability relations between ontologies are then used to develop a formal framework for (minimal) module extraction. We demonstrate that different types of minimal modules induced by these inseparability relations can be automatically extracted from real-world medium-size DL-Lite ontologies by composing the known tractable syntactic locality-based module extraction algorithm with our non-tractable extraction algorithms and using the multi-engine QBF solver aqme. Finally, we explore the relationship between uniform interpolation (or forgetting) and inseparability.
Author	Zakharyaschev, Michael Wolter, Frank Kontchakov, Roman
Author_xml	– sequence: 1 givenname: Roman surname: Kontchakov fullname: Kontchakov, Roman email: roman@dcs.bbk.ac.uk organization: Department of Computer Science and Information Systems, Birkbeck College London, UK – sequence: 2 givenname: Frank surname: Wolter fullname: Wolter, Frank email: frank@csc.liv.ac.uk organization: Department of Computer Science, University of Liverpool, UK – sequence: 3 givenname: Michael surname: Zakharyaschev fullname: Zakharyaschev, Michael email: michael@dcs.bbk.ac.uk organization: Department of Computer Science and Information Systems, Birkbeck College London, UK
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23223135$$DView record in Pascal Francis
BookMark	eNqFkT9vFDEQxS0UJC6Bb0CxDaJhj7G9f7wUSCgQQFqJhtTWrD0bfNqzF9sXyLfHl4soKEg1mpnfe8V75-zMB0-MveSw5cC7t7stxux83gooJ-i2APIJ23DVi7ofBD9jGwBoatmDeMbOU9qVVQ4D37DrMdw4U0-YyFbB57CEm7vKhP2K0aXgK_S22gd7WKii3zmiyS74N9Uvl3-UX4XrujiDx2OVQ_VxrEeX6Tl7OuOS6MXDvGDXV5--X36px2-fv15-GGvTAOR6as1A0ClpcJgGSRNOM07WAp8kzkMjiFPb4dyjlQbAQis6obp2RpjmvhHygr0--a4x_DxQynrvkqFlQU_hkLSSnKt24OpRslc9DJ1SvJCvHkhMBpc5ojcu6TW6PcY7LaQQksu2cM2JMzGkFGn-i3DQx1r0Tp9q0cdaNHS6hF5k7_6RGZfv8yvhuuUx8fuTmEqot46iTsaRN2RdJJO1De7_Bn8A_mSt7Q
CODEN	AINTBB
CitedBy_id	crossref_primary_10_1016_j_artint_2014_06_005 crossref_primary_10_1017_S1471068417000382 crossref_primary_10_1016_j_artint_2020_103307 crossref_primary_10_1017_S1471068421000570 crossref_primary_10_1007_s13218_020_00686_3 crossref_primary_10_1016_j_actpsy_2020_103081 crossref_primary_10_1145_2786759 crossref_primary_10_1016_j_artint_2013_07_004 crossref_primary_10_1007_s11227_021_03629_3 crossref_primary_10_1016_j_artint_2016_05_002 crossref_primary_10_1016_j_artint_2016_01_010 crossref_primary_10_1109_TKDE_2022_3152928 crossref_primary_10_1016_j_artint_2025_104345 crossref_primary_10_1016_j_ins_2013_07_017 crossref_primary_10_1016_j_artint_2018_09_003 crossref_primary_10_1016_j_compind_2013_01_001 crossref_primary_10_1109_TKDE_2013_120 crossref_primary_10_4018_ijwp_2014010103 crossref_primary_10_1111_j_1467_8640_2012_00442_x crossref_primary_10_1007_s10845_017_1376_5
Cites_doi	10.1613/jair.1959 10.3233/SAT190077 10.1145/1243996.1244000 10.1007/s10601-008-9051-2 10.1007/s10817-006-9042-1 10.1613/jair.2375 10.1007/978-3-540-72200-7_17 10.1016/j.artint.2008.05.002 10.1007/s10817-007-9078-x 10.4064/fm-47-1-57-103 10.1002/(SICI)1098-111X(200007)15:7<623::AID-INT3>3.0.CO;2-C 10.1613/jair.2820 10.1613/jair.1113 10.2307/2275175 10.1016/j.jsc.2008.10.007
ContentType	Journal Article
Copyright	2010 Elsevier B.V. 2015 INIST-CNRS
Copyright_xml	– notice: 2010 Elsevier B.V. – notice: 2015 INIST-CNRS
DBID	6I. AAFTH AAYXX CITATION IQODW 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
DOI	10.1016/j.artint.2010.06.003
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1872-7921
EndPage	1141
ExternalDocumentID	23223135 10_1016_j_artint_2010_06_003 S0004370210000962
GroupedDBID	--K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c400t-b5c9e0683ca9b93ebabfabdd01b3af942e1e56af7ad3c00d05262865fa0bf7423
ISICitedReferencesCount	62
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000281987600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0004-3702
IngestDate	Sun Nov 09 10:11:50 EST 2025 Sun Sep 28 11:13:56 EDT 2025 Mon Jul 21 09:11:58 EDT 2025 Sat Nov 29 06:08:06 EST 2025 Tue Nov 18 21:02:40 EST 2025 Fri Feb 23 02:31:58 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	15
Keywords	Forgetting Module extraction Description logic Ontology Uniform interpolation Computational complexity Entailment High performance Vocabulary Formal method Language theory Locality Knowledge representation Very large databases Syntactic analysis Logic design Logical programming Maintenance Distributed computing Semantic web Mathematical logic Computational linguistics Satisfiability
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c400t-b5c9e0683ca9b93ebabfabdd01b3af942e1e56af7ad3c00d05262865fa0bf7423
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
OpenAccessLink	https://dx.doi.org/10.1016/j.artint.2010.06.003
PQID	787096881
PQPubID	23500
PageCount	49
ParticipantIDs	proquest_miscellaneous_831185918 proquest_miscellaneous_787096881 pascalfrancis_primary_23223135 crossref_primary_10_1016_j_artint_2010_06_003 crossref_citationtrail_10_1016_j_artint_2010_06_003 elsevier_sciencedirect_doi_10_1016_j_artint_2010_06_003
PublicationCentury	2000
PublicationDate	2010-10-01
PublicationDateYYYYMMDD	2010-10-01
PublicationDate_xml	– month: 10 year: 2010 text: 2010-10-01 day: 01
PublicationDecade	2010
PublicationPlace	Oxford
PublicationPlace_xml	– name: Oxford
PublicationTitle	Artificial intelligence
PublicationYear	2010
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	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. 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. Kleine Büning, Lettman (br0500) 1999 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. (br0360) 2004; vol. 2960 Lutz, Wolter (br0510) 2007; vol. 4603 Samulowitz, Bacchus (br0590) 2006; vol. 4121 Diaconescu, Goguen, Stefaneas (br0350) 1993 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. 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. Chang, Keisler (br0460) 1990 Cuenca Grau, Parsia, Sirin, Kalyanpur (br0170) 2006 Eiter, Wang (br0210) 2008; 172 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. Kozen (br0490) 2006 Ghilardi, Lutz, Wolter, Zakharyaschev (br0550) 2006 Kuncak, Nguyen, Rinard (br0540) 2006; 36 Seidenberg, Rector (br0160) 2006 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. Konev, Walther, Wolter (br0520) 2008 Artale, Calvanese, Kontchakov, Zakharyaschev (br0110) 2009; 36 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. Lang, Liberatore, Marquis (br0190) 2003; 18 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. Antoniou, Kehagias (br0390) 2000; 15 Lutz, Wolter (br0440) 2010; 45 F. Lin, R. Reiter, Forget it!, in: Proc. of the AAAI Fall Symposium on Relevance, 1994, pp. 154–159. Pitts (br0220) 1992; 57 Rosati (br0450) 2008; vol. 5021 T. Eiter, M. Fink, S. Woltran, Semantical characterizations and complexity of equivalences in answer set programming, ACM Trans. Comput. Log. 8 (3). Calvanese, De Giacomo, Lembo, Lenzerini, Rosati (br0070) 2007; 39 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. Konev, Lutz, Walther, Wolter (br0180) 2008; vol. 178 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. F. Lonsing, A. Biere, DepQBF: A dependency-aware QBF solver, J. Satisfiability, Boolean Modeling and Computation (2010), in press. Artale, Calvanese, Kontchakov, Ryzhikov, Zakharyaschev (br0090) 2007; vol. 4801 Poggi, Lembo, Calvanese, De Giacomo, Lenzerini, Rosati (br0080) 2008; X 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. Feferman, Vaught (br0530) 1959; 47 Areces, ten Cate (br0470) 2006 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. Byers, Pitt (br0370) 1990; 41 Zhang, Malik (br0600) 2002; vol. 2470 Papadimitriou (br0480) 1994 Maibaum (br0380) 1997; vol. 1214 Grau, Horrocks, Kazakov, Sattler (br0010) 2008; 31 Visser (br0230) 1996; vol. 6 (br0120) 2009; vol. 5445 Noy, Musen (br0150) 2004; vol. 3298 Wang, Wang, Topor, Pan (br0270) 2008; vol. 5021 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. Pulina, Tacchella (br0280) 2009; 14 Konev, Lutz, Walther, Wolter (br0250) 2009 Zhang, Malik (br0610) 2002 Remshagen, Truemper (br0570) 2007 Peschiera, Pulina, Tacchella, Bubeck, Kullmann, Lynce (br0640) 2010; vol. 6175 Lutz, Wolter (br0340) 2009; vol. 5514 Giunchiglia, Narizzano, Tacchella (br0620) 2006; 26 (br0020) 2003 Benedetti (br0580) 2005; vol. 3632 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. Fink (br0410) 2008; vol. 5366 D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati 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. Tractable description logics for ontologies, in: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), 2005, pp. 602–607. Lang (10.1016/j.artint.2010.06.003_br0190) 2003; 18 Maibaum (10.1016/j.artint.2010.06.003_br0380) 1997; vol. 1214 Cuenca Grau (10.1016/j.artint.2010.06.003_br0170) 2006 10.1016/j.artint.2010.06.003_br0400 Lutz (10.1016/j.artint.2010.06.003_br0440) 2010; 45 Calvanese (10.1016/j.artint.2010.06.003_br0070) 2007; 39 Noy (10.1016/j.artint.2010.06.003_br0150) 2004; vol. 3298 Eiter (10.1016/j.artint.2010.06.003_br0210) 2008; 172 10.1016/j.artint.2010.06.003_br0240 Konev (10.1016/j.artint.2010.06.003_br0520) 2008 10.1016/j.artint.2010.06.003_br0040 10.1016/j.artint.2010.06.003_br0200 Visser (10.1016/j.artint.2010.06.003_br0230) 1996; vol. 6 10.1016/j.artint.2010.06.003_br0320 Kuncak (10.1016/j.artint.2010.06.003_br0540) 2006; 36 Artale (10.1016/j.artint.2010.06.003_br0110) 2009; 36 10.1016/j.artint.2010.06.003_br0560 Lutz (10.1016/j.artint.2010.06.003_br0340) 2009; vol. 5514 Kozen (10.1016/j.artint.2010.06.003_br0490) 2006 Giunchiglia (10.1016/j.artint.2010.06.003_br0620) 2006; 26 Zhang (10.1016/j.artint.2010.06.003_br0610) 2002 (10.1016/j.artint.2010.06.003_br0020) 2003 Kleine Büning (10.1016/j.artint.2010.06.003_br0500) 1999 Benedetti (10.1016/j.artint.2010.06.003_br0580) 2005; vol. 3632 Konev (10.1016/j.artint.2010.06.003_br0180) 2008; vol. 178 Remshagen (10.1016/j.artint.2010.06.003_br0570) 2007 10.1016/j.artint.2010.06.003_br0130 10.1016/j.artint.2010.06.003_br0050 Byers (10.1016/j.artint.2010.06.003_br0370) 1990; 41 Feferman (10.1016/j.artint.2010.06.003_br0530) 1959; 47 (10.1016/j.artint.2010.06.003_br0120) 2009; vol. 5445 10.1016/j.artint.2010.06.003_br0330 10.1016/j.artint.2010.06.003_br0290 Areces (10.1016/j.artint.2010.06.003_br0470) 2006 Papadimitriou (10.1016/j.artint.2010.06.003_br0480) 1994 Grau (10.1016/j.artint.2010.06.003_br0010) 2008; 31 Lutz (10.1016/j.artint.2010.06.003_br0510) 2007; vol. 4603 10.1016/j.artint.2010.06.003_br0300 Wang (10.1016/j.artint.2010.06.003_br0270) 2008; vol. 5021 Fink (10.1016/j.artint.2010.06.003_br0410) 2008; vol. 5366 Zhang (10.1016/j.artint.2010.06.003_br0600) 2002; vol. 2470 Chang (10.1016/j.artint.2010.06.003_br0460) 1990 Antoniou (10.1016/j.artint.2010.06.003_br0390) 2000; 15 10.1016/j.artint.2010.06.003_br0140 10.1016/j.artint.2010.06.003_br0260 10.1016/j.artint.2010.06.003_br0420 10.1016/j.artint.2010.06.003_br0100 Seidenberg (10.1016/j.artint.2010.06.003_br0160) 2006 Pulina (10.1016/j.artint.2010.06.003_br0280) 2009; 14 Artale (10.1016/j.artint.2010.06.003_br0090) 2007; vol. 4801 Ghilardi (10.1016/j.artint.2010.06.003_br0550) 2006 10.1016/j.artint.2010.06.003_br0060 Pitts (10.1016/j.artint.2010.06.003_br0220) 1992; 57 Konev (10.1016/j.artint.2010.06.003_br0250) 2009 Rosati (10.1016/j.artint.2010.06.003_br0450) 2008; vol. 5021 10.1016/j.artint.2010.06.003_br0630 10.1016/j.artint.2010.06.003_br0030 Diaconescu (10.1016/j.artint.2010.06.003_br0350) 1993 10.1016/j.artint.2010.06.003_br0310 10.1016/j.artint.2010.06.003_br0430 Samulowitz (10.1016/j.artint.2010.06.003_br0590) 2006; vol. 4121 (10.1016/j.artint.2010.06.003_br0360) 2004; vol. 2960 Poggi (10.1016/j.artint.2010.06.003_br0080) 2008; X Peschiera (10.1016/j.artint.2010.06.003_br0640) 2010; vol. 6175
References_xml	– reference: D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, R. Rosati, – reference: 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. – volume: 172 start-page: 1644 year: 2008 end-page: 1672 ident: br0210 article-title: Semantic forgetting in answer set programming publication-title: Artificial Intelligence – year: 2006 ident: br0490 article-title: Theory of Computation – start-page: 187 year: 2006 end-page: 207 ident: br0550 article-title: Conservative extensions in modal logics publication-title: Advances in Modal Logics, vol. 6 – volume: vol. 5021 start-page: 245 year: 2008 end-page: 257 ident: br0270 article-title: Forgetting concepts in DL-Lite publication-title: Proc. of the 5th Europ. Semantic Web Conf. – start-page: 821 year: 2006 end-page: 868 ident: br0470 article-title: Hybrid logics publication-title: Handbook of Modal Logic – volume: vol. 2960 year: 2004 ident: br0360 publication-title: CASL Reference Manual: The Complete Documentation of the Common Algebraic Specification Language – reference: 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. – reference: 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. – start-page: 198 year: 2006 end-page: 209 ident: br0170 article-title: Modularity and web ontologies publication-title: Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006) – reference: 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. – reference: 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. – reference: 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. – volume: vol. 1214 start-page: 40 year: 1997 end-page: 66 ident: br0380 article-title: Conservative extensions, interpretations between theories and all that! publication-title: Proc. of the 7th Int. Joint Conf. CAAP/FASE on Theory and Practice of Software Development (TAPSOFT '97) – volume: vol. 4121 start-page: 353 year: 2006 end-page: 367 ident: br0590 article-title: Binary clause reasoning in QBF publication-title: Proc. of the 9th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2006) – volume: 45 start-page: 194 year: 2010 end-page: 228 ident: br0440 article-title: Deciding inseparability and conservative extensions in the description logic EL publication-title: J. Symbolic Computation – volume: 39 start-page: 385 year: 2007 end-page: 429 ident: br0070 article-title: Tractable reasoning and efficient query answering in description logics: The publication-title: J. Automated Reasoning – volume: vol. 4603 start-page: 84 year: 2007 end-page: 99 ident: br0510 article-title: Conservative extensions in the lightweight description logic EL publication-title: Proc. of the 21st Conf. on Automated Deduction (CADE-21) – reference: F. Lonsing, A. Biere, DepQBF: A dependency-aware QBF solver, J. Satisfiability, Boolean Modeling and Computation (2010), in press. – reference: F. Lin, R. Reiter, Forget it!, in: Proc. of the AAAI Fall Symposium on Relevance, 1994, pp. 154–159. – reference: 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. – volume: vol. 5514 start-page: 37 year: 2009 end-page: 47 ident: br0340 article-title: Mathematical logic for life science ontologies publication-title: Logic, Language, Information and Computation, 16th Int. Workshop (WoLLIC 2009) – volume: 15 start-page: 623 year: 2000 end-page: 632 ident: br0390 article-title: A note on the refinement of ontologies publication-title: Int. J. Intelligent Systems – volume: 31 start-page: 273 year: 2008 end-page: 318 ident: br0010 article-title: Modular reuse of ontologies: Theory and practice publication-title: J. Artificial Intelligence Research – reference: 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. – volume: vol. 178 start-page: 55 year: 2008 end-page: 59 ident: br0180 article-title: Semantic modularity and module extraction in description logics publication-title: Proc. of the 18th Europ. Conf. on Artificial Intelligence (ECAI08) – start-page: 132 year: 2007 end-page: 138 ident: br0570 article-title: The complexity of futile questioning publication-title: Proc. of the Int. Conf. on Foundations of Computer Science (FCS 2007) – reference: 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. – year: 1990 ident: br0460 article-title: Model Theory – volume: 36 start-page: 1 year: 2009 end-page: 69 ident: br0110 article-title: The publication-title: J. Artificial Intelligence Research – start-page: 13 year: 2006 end-page: 22 ident: br0160 article-title: Web ontology segmentation: Analysis, classification and use publication-title: Proc. of the 15th Int. Conf. on World Wide Web (WWW 2006) – start-page: 83 year: 1993 end-page: 130 ident: br0350 article-title: Logical support for modularisation publication-title: Logical Environments – volume: 47 start-page: 57 year: 1959 end-page: 103 ident: br0530 article-title: The first-order properties of algebraic systems publication-title: Fundamenta Mathematicae – reference: 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. – reference: 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. – start-page: 442 year: 2002 end-page: 449 ident: br0610 article-title: Conflict driven learning in a quantified Boolean satisfiability solver publication-title: Proc. of the IEEE/ACM Int. Conf. on Computer-aided Design (ICCAD) – volume: vol. 3298 start-page: 713 year: 2004 end-page: 725 ident: br0150 article-title: Specifying ontology views by traversal publication-title: Proc. of the 3rd Int. Semantic Web Conf. – year: 1994 ident: br0480 article-title: Computational Complexity – reference: 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. – volume: 41 start-page: 196 year: 1990 end-page: 201 ident: br0370 article-title: Conservative extensions: A cautionary note publication-title: Bulletin of the EATCS – start-page: 259 year: 2008 end-page: 274 ident: br0520 article-title: The logical difference problem for description logic terminologies publication-title: Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR-08) – volume: vol. 4801 start-page: 277 year: 2007 end-page: 292 ident: br0090 article-title: Reasoning over extended ER models publication-title: Proc. of the 26th Int. Conf. on Conceptual Modeling (ER 2007) – volume: 14 start-page: 80 year: 2009 end-page: 116 ident: br0280 article-title: A self-adaptive multi-engine solver for quantified Boolean formulas publication-title: Constraints – year: 2003 ident: br0020 publication-title: The Description Logic Handbook: Theory, Implementation and Applications – volume: 18 start-page: 391 year: 2003 end-page: 443 ident: br0190 article-title: Propositional independence: Formula-variable independence and forgetting publication-title: J. Artificial Intelligence Research – volume: vol. 2470 start-page: 200 year: 2002 end-page: 215 ident: br0600 article-title: Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation publication-title: Proc. of the 8th Int. Conf. on Principles and Practice of Constraint Programming (CP 2002) – volume: vol. 3632 start-page: 369 year: 2005 end-page: 376 ident: br0580 article-title: sKizzo: A suite to evaluate and certify QBFs publication-title: Proc. of the 20th Int. Conf. on Automated Deduction (CADE-20) – reference: 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. – reference: 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. – volume: X start-page: 133 year: 2008 end-page: 173 ident: br0080 article-title: Linking data to ontologies publication-title: J. Data Semantics – start-page: 25 year: 2009 end-page: 66 ident: br0250 article-title: Formal properties of modularisation publication-title: Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization – volume: vol. 5021 start-page: 215 year: 2008 end-page: 229 ident: br0450 article-title: Finite model reasoning in DL-Lite publication-title: Proc. of the 5th Europ. Semantic Web Conf. (ESWC 2008) – volume: vol. 6 start-page: 139 year: 1996 end-page: 164 ident: br0230 article-title: Uniform interpolation and layered bisimulation publication-title: Gödel'96 – volume: vol. 5366 start-page: 99 year: 2008 end-page: 113 ident: br0410 article-title: Equivalences in answer-set programming by countermodels in the logic of here-and-there publication-title: Proc. of the 24th Int. Conf. on Logic Programming (ICLP 2008) – year: 1999 ident: br0500 article-title: Propositional Logic: Deduction and Algorithms – volume: vol. 6175 start-page: 237 year: 2010 end-page: 250 ident: br0640 article-title: The seventh QBF solvers evaluation (QBFEVAL'10) publication-title: Proc. of the 13th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'10) – volume: vol. 5445 year: 2009 ident: br0120 publication-title: Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization – reference: 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. – reference: : Tractable description logics for ontologies, in: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), 2005, pp. 602–607. – volume: 57 start-page: 33 year: 1992 end-page: 52 ident: br0220 article-title: On an interpretation of second-order quantification in first-order intuitionistic propositional logic publication-title: J. Symbolic Logic – reference: 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. – reference: T. Eiter, M. Fink, S. Woltran, Semantical characterizations and complexity of equivalences in answer set programming, ACM Trans. Comput. Log. 8 (3). – volume: 36 start-page: 213 year: 2006 end-page: 239 ident: br0540 article-title: Deciding Boolean algebra with Presburger arithmetic publication-title: J. Automated Reasoning – volume: 26 start-page: 371 year: 2006 end-page: 416 ident: br0620 article-title: Clause-term resolution and learning in quantified Boolean logic satisfiability publication-title: J. Artificial Intelligence Research – volume: vol. 3298 start-page: 713 year: 2004 ident: 10.1016/j.artint.2010.06.003_br0150 article-title: Specifying ontology views by traversal – volume: 41 start-page: 196 year: 1990 ident: 10.1016/j.artint.2010.06.003_br0370 article-title: Conservative extensions: A cautionary note publication-title: Bulletin of the EATCS – year: 2006 ident: 10.1016/j.artint.2010.06.003_br0490 – volume: vol. 4801 start-page: 277 year: 2007 ident: 10.1016/j.artint.2010.06.003_br0090 article-title: Reasoning over extended ER models – volume: 26 start-page: 371 year: 2006 ident: 10.1016/j.artint.2010.06.003_br0620 article-title: Clause-term resolution and learning in quantified Boolean logic satisfiability publication-title: J. Artificial Intelligence Research doi: 10.1613/jair.1959 – volume: vol. 2960 year: 2004 ident: 10.1016/j.artint.2010.06.003_br0360 – volume: vol. 1214 start-page: 40 year: 1997 ident: 10.1016/j.artint.2010.06.003_br0380 article-title: Conservative extensions, interpretations between theories and all that! – ident: 10.1016/j.artint.2010.06.003_br0420 – year: 1994 ident: 10.1016/j.artint.2010.06.003_br0480 – ident: 10.1016/j.artint.2010.06.003_br0630 doi: 10.3233/SAT190077 – start-page: 132 year: 2007 ident: 10.1016/j.artint.2010.06.003_br0570 article-title: The complexity of futile questioning – ident: 10.1016/j.artint.2010.06.003_br0400 doi: 10.1145/1243996.1244000 – ident: 10.1016/j.artint.2010.06.003_br0030 – volume: 14 start-page: 80 issue: 1 year: 2009 ident: 10.1016/j.artint.2010.06.003_br0280 article-title: A self-adaptive multi-engine solver for quantified Boolean formulas publication-title: Constraints doi: 10.1007/s10601-008-9051-2 – volume: vol. 5366 start-page: 99 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0410 article-title: Equivalences in answer-set programming by countermodels in the logic of here-and-there – ident: 10.1016/j.artint.2010.06.003_br0330 – volume: 36 start-page: 213 issue: 3 year: 2006 ident: 10.1016/j.artint.2010.06.003_br0540 article-title: Deciding Boolean algebra with Presburger arithmetic publication-title: J. Automated Reasoning doi: 10.1007/s10817-006-9042-1 – volume: vol. 3632 start-page: 369 year: 2005 ident: 10.1016/j.artint.2010.06.003_br0580 article-title: sKizzo: A suite to evaluate and certify QBFs – volume: vol. 6175 start-page: 237 year: 2010 ident: 10.1016/j.artint.2010.06.003_br0640 article-title: The seventh QBF solvers evaluation (QBFEVAL'10) – ident: 10.1016/j.artint.2010.06.003_br0290 – volume: 31 start-page: 273 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0010 article-title: Modular reuse of ontologies: Theory and practice publication-title: J. Artificial Intelligence Research doi: 10.1613/jair.2375 – volume: vol. 5445 year: 2009 ident: 10.1016/j.artint.2010.06.003_br0120 – start-page: 442 year: 2002 ident: 10.1016/j.artint.2010.06.003_br0610 article-title: Conflict driven learning in a quantified Boolean satisfiability solver – ident: 10.1016/j.artint.2010.06.003_br0100 – ident: 10.1016/j.artint.2010.06.003_br0040 – start-page: 13 year: 2006 ident: 10.1016/j.artint.2010.06.003_br0160 article-title: Web ontology segmentation: Analysis, classification and use – ident: 10.1016/j.artint.2010.06.003_br0430 doi: 10.1007/978-3-540-72200-7_17 – ident: 10.1016/j.artint.2010.06.003_br0050 – volume: vol. 6 start-page: 139 year: 1996 ident: 10.1016/j.artint.2010.06.003_br0230 article-title: Uniform interpolation and layered bisimulation – start-page: 821 year: 2006 ident: 10.1016/j.artint.2010.06.003_br0470 article-title: Hybrid logics – volume: 172 start-page: 1644 issue: 3 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0210 article-title: Semantic forgetting in answer set programming publication-title: Artificial Intelligence doi: 10.1016/j.artint.2008.05.002 – year: 1999 ident: 10.1016/j.artint.2010.06.003_br0500 – volume: 39 start-page: 385 issue: 3 year: 2007 ident: 10.1016/j.artint.2010.06.003_br0070 article-title: Tractable reasoning and efficient query answering in description logics: The DL-Lite family publication-title: J. Automated Reasoning doi: 10.1007/s10817-007-9078-x – ident: 10.1016/j.artint.2010.06.003_br0140 – volume: 47 start-page: 57 year: 1959 ident: 10.1016/j.artint.2010.06.003_br0530 article-title: The first-order properties of algebraic systems publication-title: Fundamenta Mathematicae doi: 10.4064/fm-47-1-57-103 – ident: 10.1016/j.artint.2010.06.003_br0300 – ident: 10.1016/j.artint.2010.06.003_br0060 – start-page: 187 year: 2006 ident: 10.1016/j.artint.2010.06.003_br0550 article-title: Conservative extensions in modal logics – volume: X start-page: 133 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0080 article-title: Linking data to ontologies publication-title: J. Data Semantics – start-page: 25 year: 2009 ident: 10.1016/j.artint.2010.06.003_br0250 article-title: Formal properties of modularisation – volume: vol. 5021 start-page: 245 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0270 article-title: Forgetting concepts in DL-Lite – start-page: 83 year: 1993 ident: 10.1016/j.artint.2010.06.003_br0350 article-title: Logical support for modularisation – volume: 15 start-page: 623 issue: 7 year: 2000 ident: 10.1016/j.artint.2010.06.003_br0390 article-title: A note on the refinement of ontologies publication-title: Int. J. Intelligent Systems doi: 10.1002/(SICI)1098-111X(200007)15:7<623::AID-INT3>3.0.CO;2-C – volume: 36 start-page: 1 year: 2009 ident: 10.1016/j.artint.2010.06.003_br0110 article-title: The DL-Lite family and relations publication-title: J. Artificial Intelligence Research doi: 10.1613/jair.2820 – volume: 18 start-page: 391 year: 2003 ident: 10.1016/j.artint.2010.06.003_br0190 article-title: Propositional independence: Formula-variable independence and forgetting publication-title: J. Artificial Intelligence Research doi: 10.1613/jair.1113 – ident: 10.1016/j.artint.2010.06.003_br0240 – ident: 10.1016/j.artint.2010.06.003_br0200 – volume: vol. 4121 start-page: 353 year: 2006 ident: 10.1016/j.artint.2010.06.003_br0590 article-title: Binary clause reasoning in QBF – year: 1990 ident: 10.1016/j.artint.2010.06.003_br0460 – year: 2003 ident: 10.1016/j.artint.2010.06.003_br0020 – volume: 57 start-page: 33 issue: 1 year: 1992 ident: 10.1016/j.artint.2010.06.003_br0220 article-title: On an interpretation of second-order quantification in first-order intuitionistic propositional logic publication-title: J. Symbolic Logic doi: 10.2307/2275175 – volume: vol. 5514 start-page: 37 year: 2009 ident: 10.1016/j.artint.2010.06.003_br0340 article-title: Mathematical logic for life science ontologies – ident: 10.1016/j.artint.2010.06.003_br0320 – volume: vol. 4603 start-page: 84 year: 2007 ident: 10.1016/j.artint.2010.06.003_br0510 article-title: Conservative extensions in the lightweight description logic EL – volume: vol. 2470 start-page: 200 year: 2002 ident: 10.1016/j.artint.2010.06.003_br0600 article-title: Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation – ident: 10.1016/j.artint.2010.06.003_br0260 – volume: vol. 178 start-page: 55 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0180 article-title: Semantic modularity and module extraction in description logics – ident: 10.1016/j.artint.2010.06.003_br0560 – start-page: 259 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0520 article-title: The logical difference problem for description logic terminologies – ident: 10.1016/j.artint.2010.06.003_br0130 – ident: 10.1016/j.artint.2010.06.003_br0310 – start-page: 198 year: 2006 ident: 10.1016/j.artint.2010.06.003_br0170 article-title: Modularity and web ontologies – volume: 45 start-page: 194 issue: 2 year: 2010 ident: 10.1016/j.artint.2010.06.003_br0440 article-title: Deciding inseparability and conservative extensions in the description logic EL publication-title: J. Symbolic Computation doi: 10.1016/j.jsc.2008.10.007 – volume: vol. 5021 start-page: 215 year: 2008 ident: 10.1016/j.artint.2010.06.003_br0450 article-title: Finite model reasoning in DL-Lite
SSID	ssj0003991
Score	2.3450346
Snippet	We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1093
SubjectTerms	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computational complexity Computer science; control theory; systems Description logic Encoding Entailment Exact sciences and technology Extraction Forgetting Inclusions Information systems. Data bases Language theory and syntactical analysis Logic Logical, boolean and switching functions Mathematical logic Memory organisation. Data processing Module extraction Modules Ontology Signatures Software Solvers Theoretical computing Uniform interpolation
Title	Logic-based ontology comparison and module extraction, with an application to DL-Lite
URI	https://dx.doi.org/10.1016/j.artint.2010.06.003 https://www.proquest.com/docview/787096881 https://www.proquest.com/docview/831185918
Volume	174
WOSCitedRecordID	wos000281987600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7921 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELagywEJ8UZ0gZUPiEsJSuqksY8VdAWoKhxa6C1yHFvLbjfp9qXl3zOT2EmWZVU4cImqvKx6vszDM56PkNfZQDNpkNwl9mMv1IPQ46FKPZHpjGE1oygz-N_G8WTC53Px1S7mrEs6gTjP-eWlWP5XUcM5EDZunf0HcdcvhRPwG4QORxA7HP9K8MierDy0TlkPmxOUPZZUQzeIK-XnRbZd6B4o5lW1sQFn2m5z67Vy2uiZfhh72Fmj7cUOV2WFUcn30WrpWStvGFadyLNiV9VunzcI_F4sLBNIyRZfL1vLsxO5-ikh1Na736v57ZoE1nf4bk3C6dkQVJd_Vc9WdDwOUFFLbWJPq5YJhhgt-KN6r1YaTt-VHRY2tjAPs0msMWcuhT_5khzPxuNkOppP3ywvPCQaw4S8ZV25TQ76cSR4hxwMP43mn2vzDR6bpVms_oLbb1kWBV4f-CZ_5t4S5kwuTEWPcs3Sl-7L9CG5b-MOOqzw8ojc0vlj8sBxelCr4p-QWQs-1MGHNvChAB9awYc28HlLETxwjbbAQzcFteB5SmbHo-n7j56l3vAUKPWNl0ZKaH_AmZIiFUynMjUyzTI_SOHTFmFfBzoaSBPLjCnfz7BrEO5xNtJPDSb_n5FOXuT6OaEsYGmfG9NnkR_CJR6YfhYrIxUYGxOrLmFuAhNl-9IjPcoicQWIp0k17QlOe1LWYbIu8eqnllVflj33x042ifUtK58xAWztefLoiijr4SAWgeCIRV1CnWwT0M2YcJO5LrbrBI2hGHAe3HwLZxDhRyLgh_vf8oLcbT62l6SzWW31K3JH7TY_1qsji-Nf9u3AOw
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Logic-based+ontology+comparison+and+module+extraction%2C+with+an+application+to+DL-Lite&rft.jtitle=Artificial+intelligence&rft.au=Kontchakov%2C+Roman&rft.au=Wolter%2C+Frank&rft.au=Zakharyaschev%2C+Michael&rft.date=2010-10-01&rft.issn=0004-3702&rft.volume=174&rft.issue=15&rft.spage=1093&rft.epage=1141&rft_id=info:doi/10.1016%2Fj.artint.2010.06.003&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon