Description logics with concrete domains and general concept inclusions revisited

DOI10.1007/978-3-030-51074-9_24OpenAlexW3040061311MaRDI QIDQ2096462

Jakub Rydval, Franz Baader

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51074-9_24

zbMATH Keywords

homogeneitydecidabilitydescription logicconstraint satisfactionconcrete domainsfinite boundedness\(\omega\)-admissibilityGCIs

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (3)

Solving infinite-domain CSPs using the patchwork property ⋮ An algebraic view on p-admissible concrete domains for lightweight description logics ⋮ Using model theory to find decidable and tractable description logics with concrete domains

Cites Work

• Maintaining knowledge about temporal intervals
• An automata-theoretic approach to constraint LTL
• A tableau algorithm for description logics with concrete domains and general TBoxes
• An algebraic view on p-admissible concrete domains for lightweight description logics
• Relation algebras of intervals
• A survey of homogeneous structures
• Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
• An Introduction to Description Logic
• Constraint Satisfaction with Countable Homogeneous Templates
• Non-dichotomies in Constraint Satisfaction Complexity
• Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
• Countable homogeneous relational structures and ℵ₀-categorical theories
• STACS 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Description logics with concrete domains and general concept inclusions revisited