Merging Incommensurable Possibilistic DL-Lite Assertional Bases
暂无分享,去创建一个
[1] Martín O. Moguillansky,et al. A Non-Monotonic Description Logics Model for Merging Terminologies , 2007, Inteligencia Artif..
[2] Salem Benferhat,et al. Min-Based Fusion of Possibilistic DL-Lite Knowledge Bases , 2013, 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT).
[3] Rudolf Kruse,et al. Fusion: General concepts and characteristics , 2001, Int. J. Intell. Syst..
[4] Sébastien Konieczny,et al. Merging Information Under Constraints: A Logical Framework , 2002, J. Log. Comput..
[5] Maurizio Lenzerini,et al. Inconsistency-Tolerant Semantics for Description Logics , 2010, RR.
[6] Didier Dubois,et al. Iterated Revision as Prioritized Merging , 2006, KR.
[7] Diego Calvanese,et al. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.
[8] Didier Dubois,et al. Syntactic Combination of Uncertain Information: A Possibilistic Approach , 1997, ECSQARU-FAPR.
[9] Salem Benferhat,et al. Min-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases , 2014, SUM.
[10] George A. Vouros,et al. Towards automatic merging of domain ontologies: The HCONE-merge approach , 2006, J. Web Semant..
[11] Mark A. Musen,et al. PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment , 2000, AAAI/IAAI.
[12] Salem Benferhat,et al. An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints , 2007, AAAI.
[13] Meghyn Bienvenu,et al. Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies , 2012, Description Logics.
[14] Didier Dubois,et al. Possibility theory , 2018, Scholarpedia.
[15] Renata Wassermann,et al. Merging Ontologies via Kernel Contraction , 2013, ONTOBRAS.
[16] Salem Benferhat,et al. Possibilistic DL-Lite , 2013, SUM.
[17] Riccardo Rosati,et al. New Inconsistency-Tolerant Semantics for Robust Ontology-Based Data Access , 2013, Description Logics.