Preference-based inconsistency-tolerant query answering under existential rules
From MaRDI portal
Publication:2093372
DOI10.1016/J.ARTINT.2022.103772OpenAlexW4292342541MaRDI QIDQ2093372FDOQ2093372
Authors: Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna 
Publication date: 8 November 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103772
Recommendations
- Inconsistency-tolerant query answering for existential rules
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Encoding preference queries to an uncertain database in possibilistic answer set programming
- Fast query answering over existential rules
Cites Work
- Title not available (Why is that?)
- Taming the infinite chase: query answering under expressive relational constraints
- Data exchange: semantics and query answering
- The strong exponential hierarchy collapses
- Prioritized repairing and consistent query answering in relational databases
- Towards more expressive ontology languages: the query answering problem
- Prioritized logic programming and its application to commonsense reasoning
- Detecting ambiguity in prioritized database repairing
- On the semantics of logic programs with preferences
- The computational complexity of dominance and consistency in CP-nets
- Title not available (Why is that?)
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Inconsistency handling in Datalog\(+/-\) ontologies
- The price of query rewriting in ontology-based data access
- Ontological query answering under many-valued group preferences in Datalog\(+/-\)
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Inconsistency-tolerant query answering for existential rules
- Achieving new upper bounds for the hypergraph duality problem through logic
- Title not available (Why is that?)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Uniform random generation and dominance testing for CP-nets
Cited In (4)
- Controlled query evaluation in description logics through consistent query answering
- A logic-based framework for characterizing nexus of similarity within knowledge bases
- Query answering over inconsistent knowledge bases: a probabilistic approach
- Combining totalitarian and Ceteris Paribus semantics in database preference queries
Uses Software
This page was built for publication: Preference-based inconsistency-tolerant query answering under existential rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093372)
