论文信息 - Update Operators for Inconsistent Query Answering: A New Point of View

Update Operators for Inconsistent Query Answering: A New Point of View

This paper investigates the definition of belief revision operators that correspond to the IAR and ICR inconsistency tolerant semantics in the Ontology Based Data Access OBDA setting. By doing this equivalence our long term goal is to provide an axiomatic characterisation of the above mentioned semantics.

Madalina Croitoru | Ricardo Oscar Rodríguez | Madalina Croitoru | R. Rodríguez

[1] R. Hilpinen. Deontic Logic: Introductory and Systematic Readings , 1981 .

[2] S. Hansson. Belief base dynamics , 1991 .

[3] Meghyn Bienvenu,et al. On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies , 2012, AAAI.

[4] C. E. Alchourrón,et al. On the logic of theory change: Partial meet contraction and revision functions , 1985 .

[5] Sebastian Rudolph,et al. Walking the Complexity Lines for Generalized Guarded Existential Rules , 2011, IJCAI.

[6] Peter Gärdenfors,et al. On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[7] Franz Baader,et al. Pushing the EL Envelope , 2005, IJCAI.

[8] Madalina Croitoru,et al. What Can Argumentation Do for Inconsistent Ontology Query Answering? , 2013, SUM.

[9] Cristina Sirangelo,et al. Reasoning About Pattern-Based XML Queries , 2013, RR.

[10] Carlos E. Alchourrón,et al. Hierarchies of Regulations and their Logic , 1981 .

[11] Diego Calvanese,et al. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[12] Andrea Calì,et al. A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[13] Maurizio Lenzerini,et al. Inconsistency-Tolerant Semantics for Description Logics , 2010, RR.

[14] Jeff Z. Pan,et al. An Argument-Based Approach to Using Multiple Ontologies , 2009, SUM.