Research map / Learning theory and algorithms / Combinatorial and search optimization
Data Complexity of Querying Description Logic Knowledge Bases Under Cost-Based Semantics
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
- 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.89)
- Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases (AAAI 2016 · similarity 0.89)
- Consistent Query Answering over Existential Rules with Open and Closed Predicates (AAAI 2025 · similarity 0.89)
- Answering Conjunctive Queries with Safe Negation and Inequalities over RDFS Knowledge Bases (AAAI 2025 · similarity 0.89)
- Stable Model Semantics for Description Logic Terminologies (AAAI 2024 · similarity 0.87)
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.