Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases
From MaRDI portal
Publication:513332
DOI10.1007/s10472-015-9494-2zbMath1404.68148MaRDI QIDQ513332
Eric Würbel, Salem Benferhat, Odile Papini, Zied Bouraoui
Publication date: 6 March 2017
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-015-9494-2
68T27: Logic in artificial intelligence
68T30: Knowledge representation
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
Related Items
Cites Work
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite
- Specified meet contraction
- A theory of diagnosis from first principles
- A correction to the algorithm in Reiter's theory of diagnosis
- Propositional knowledge base revision and minimal change
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- A survey of multiple contractions
- A practical approach to revising prioritized knowledge bases
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- A Prioritized Assertional-Based Revision for DL-Lite Knowledge Bases
- Semi-revision
- On Instance-level Update and Erasure in Description Logic Ontologies
- Knowledge Base Revision in Description Logics
- A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule
- The Description Logic Handbook
- The DL-Lite Family and Relations
- On the logic of theory change: Partial meet contraction and revision functions
- Detection of potential inconsistencies in knowledge bases
- Kernel contraction
- Logics in Artificial Intelligence
- Linking Data to Ontologies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
