Tractable Closure-Based Possibilistic Repair for Partially Ordered DL-Lite Ontologies.
Ahmed LaouarSihem BelabbesSalem BenferhatPublished in: JELIA (2023)
Keyphrases
- dl lite
- partially ordered
- possibilistic logic
- description logics
- computational complexity
- partial order
- query answering
- data complexity
- possibility theory
- event calculus
- first order logic
- query rewriting
- totally ordered
- conjunctive queries
- partial ordering
- np complete
- expressive power
- owl dl ontology
- complexity of query answering
- reasoning tasks
- semantic web
- knowledge base
- knowledge representation
- np hard
- ontology based data access
- query evaluation
- consistent query answering
- data exchange
- computational properties
- logic programming
- ontology languages
- special case
- databases