Research map / Large language models / Retrieval and knowledge
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Query Answering with Inconsistent Existential Rules under Stable Model Semantics (AAAI 2016 · similarity 0.93)
- Explanations for Inconsistency-Tolerant Query Answering under Existential Rules (AAAI 2020 · similarity 0.92)
- Consistent Query Answering over Existential Rules with Open and Closed Predicates (AAAI 2025 · similarity 0.92)
- Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases (AAAI 2016 · similarity 0.90)
- Answering Conjunctive Queries with Safe Negation and Inequalities over RDFS Knowledge Bases (AAAI 2025 · similarity 0.88)
- Spectra of Cardinality Queries over Description Logic Knowledge Bases (AAAI 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
