An algebraic view on p-admissible concrete domains for lightweight description logics
From MaRDI portal
Publication:2055793
DOI10.1007/978-3-030-75775-5_14OpenAlexW3163386529MaRDI QIDQ2055793
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75775-5_14
convexitydecidabilitydescription logicconstraint satisfactiontractability\( \omega \)-admissibilityconcrete domainsfinite boundednessp-admissibility
Related Items
Universal Horn Sentences and the Joint Embedding 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 ⋮ Description logics with concrete domains and general concept inclusions revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Reducts of the random partial order
- Combining interval-based temporal reasoning with general TBoxes
- A tableau algorithm for description logics with concrete domains and general TBoxes
- Maximal infinite-valued constraint languages
- Universal graphs with forbidden subgraphs and algebraic closure
- An algebraic view on p-admissible concrete domains for lightweight description logics
- Description logics with concrete domains and general concept inclusions revisited
- On undecidability bounds for matrix decision problems
- An Introduction to Description Logic
- The complexity of temporal constraint satisfaction problems
- Homomorphism and embedding universal structures for restricted classes
- Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
- PROJECTIVE CLONE HOMOMORPHISMS
- On Affine Reachability Problems
- A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
- A family of countable homogeneous graphs
