Research map / Large language models / Retrieval and knowledge
Epistemic Disjunctive Datalog for Querying Knowledge Bases
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Restrict interaction with the KB to epistemic queries over certain answers | DataKlog(Q) over L KBs · L-range-restricted KBs where Q-query answering is decidable | decidability: decidable | Helped |
| Add recursion to DataK0(CQ) (ablation) | DataKlog(CQ) over trivial KBs · Trivial KBs | expressive power: strictly more expressive | Helped |
| Add disjunction (ablation) | DataKlog(CQ)̸=,¬s over trivial KBs · Trivial KBs | expressive power: DataKlog(CQ)̸=,¬s does not express DataKlog(CQ)∨ unless P = NP | Helped |
| Add semi-positive negation (ablation) | DataKlog(CQ) over trivial KBs · Trivial KBs | expressive power: DataKlog(CQ)̸=,∨ does not express DataK0(CQ)¬0 | Helped |
| Add the epistemic operator to CQ queries (ablation) | DataK0(CQ) over DL-Litecore KBs · DL-Litecore KBs | expressive power: strictly more expressive than CQ | Helped |
| Add semi-positive negation (ablation) | DataKlog(CQ) over KB languages allowing T⊔, T¬, or T∀ · KB languages allowing T⊔, T¬, or T∀ | data complexity: Θp2-hard; Θp2-complete | Mixed |
| Use disjunction without negation (ablation) | DataKlog(Q)̸=,∨ · L-range-restricted KBs where Q-query answering is coNP-complete | data complexity: coNP-complete | Mixed |
| Use recursion, inequalities, and stratifed negation | DataKlog(Q)̸=,¬s · L-range-restricted KBs where Q-query answering is in P | data complexity: P-complete | Mixed |
| Allow full negation and disjunction | DataKlog(Q)⊤ · L-range-restricted KBs where Q-query answering is in P | data complexity: Πp2-complete | Mixed |
| Use DataKlog(CQ) over DL-LiteRDFS KBs | DataKlog(CQ) · DL-LiteRDFS KBs | expressive power: DataKlog(CQ)I,D is equivalent to DatalogI,D | No clear effect |
Closest papers by meaning
- Consistent Query Answering over Existential Rules with Open and Closed Predicates (AAAI 2025 · similarity 0.89)
- Knowledge-Base Degrees of Inconsistency: Complexity and Counting (AAAI 2021 · similarity 0.89)
- Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs (AAAI 2019 · similarity 0.88)
- Expressive Recursive Answers for Ontological Knowledge Bases (AAAI 2026 · similarity 0.88)
- Data Complexity of Querying Description Logic Knowledge Bases Under Cost-Based Semantics (AAAI 2026 · similarity 0.88)
- Answering Conjunctive Queries with Safe Negation and Inequalities over RDFS Knowledge Bases (AAAI 2025 · similarity 0.88)
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.