atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Knowledge-Base Degrees of Inconsistency: Complexity and Counting

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 6 citations (OpenAlex)

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 changedWhereMeasuredEffect
Bound the knowledge-program graph treewidth and domain sizeFixed-domain non-entailment for Datalog queries · SROIQ or DLmin knowledge-basesruntime: tower(2, |∆|O(k)) · |N(K) ∪ NP(P)|Helped
Count projected anti-witnesses instead of all anti-witnessesFixed-domain non-entailment · Stratified, tight, normal, and disjunctive queriescounting complexity: one jump in the complexitiesHurt
Allow more expressive Datalog query classesFixed-domain non-entailment · Stratified, tight or normal, and disjunctive queriesdecision complexity: ΣP2; ΣP3; ΣP4Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy