Using Kernel Consolidation for Query Answering in Inconsistent OBDA
暂无分享,去创建一个
[1] Franz Baader,et al. Pushing the EL Envelope , 2005, IJCAI.
[2] S. Hansson. Belief base dynamics , 1991 .
[3] Sebastian Rudolph,et al. Walking the Complexity Lines for Generalized Guarded Existential Rules , 2011, IJCAI.
[4] Peter Gärdenfors,et al. On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.
[5] Madalina Croitoru,et al. Update Operators for Inconsistent Query Answering: A New Point of View , 2014, SUM.
[6] Meghyn Bienvenu,et al. On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies , 2012, AAAI.
[7] Andrea Calì,et al. A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.
[8] Thomas Lukasiewicz,et al. Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs , 2019, SEBD.
[9] Maurizio Lenzerini,et al. Inconsistency-Tolerant Semantics for Description Logics , 2010, RR.
[10] C. E. Alchourrón,et al. On the logic of theory change: Partial meet contraction and revision functions , 1985 .
[11] Madalina Croitoru,et al. What Can Argumentation Do for Inconsistent Ontology Query Answering? , 2013, SUM.
[12] Diego Calvanese,et al. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.
[13] Sven Ove Hansson. Kernel Contraction , 1994, J. Symb. Log..