Research map / Learning theory and algorithms / Combinatorial and search optimization
Description Logics with Two Types of Definite Descriptions: Complexity, Expressiveness, and Automated Deduction
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
- Spectra of Cardinality Queries over Description Logic Knowledge Bases (AAAI 2025 · similarity 0.89)
- Finite Entailment of Local Queries in the Z Family of Description Logics (AAAI 2022 · similarity 0.89)
- Stable Model Semantics for Description Logic Terminologies (AAAI 2024 · similarity 0.88)
- Data Complexity of Querying Description Logic Knowledge Bases Under Cost-Based Semantics (AAAI 2026 · similarity 0.87)
- Consistent Query Answering over Existential Rules with Open and Closed Predicates (AAAI 2025 · similarity 0.85)
- Answering Conjunctive Queries with Safe Negation and Inequalities over RDFS Knowledge Bases (AAAI 2025 · similarity 0.84)
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.