Preference-based inconsistency-tolerant query answering under existential rules
From MaRDI portal
Publication:2093372
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
- scientific article; zbMATH DE number 4058873 (Why is no real title available?)
- scientific article; zbMATH DE number 7368419 (Why is no real title available?)
- scientific article; zbMATH DE number 2243357 (Why is no real title available?)
- Achieving new upper bounds for the hypergraph duality problem through logic
- 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
- Computing and explaining query answers over inconsistent DL-Lite knowledge bases
- Data exchange: semantics and query answering
- Deduction in Concept Languages: from Subsumption to Instance Checking
- Detecting ambiguity in prioritized database repairing
- Inconsistency handling in Datalog\(+/-\) ontologies
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Inconsistency-tolerant query answering for existential rules
- On the semantics of logic programs with preferences
- Ontological query answering under many-valued group preferences in Datalog\(+/-\)
- Prioritized logic programming and its application to commonsense reasoning
- Prioritized repairing and consistent query answering in relational databases
- Taming the infinite chase: query answering under expressive relational constraints
- The computational complexity of dominance and consistency in CP-nets
- The price of query rewriting in ontology-based data access
- The strong exponential hierarchy collapses
- Towards more expressive ontology languages: the query answering problem
- Uniform random generation and dominance testing for CP-nets
Cited in
(8)- Explanations for query answers under existential rules
- Controlled query evaluation in description logics through consistent query answering
- Querying data exchange settings beyond positive queries
- Abstract argumentation frameworks with strong and weak constraints
- Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)
- 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
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)
