An algebraic view on p-admissible concrete domains for lightweight description logics
type: Item
instance of: scholarly article
title: An algebraic view on p-admissible concrete domains for lightweight description logics
DOI: 10.1007/978-3-030-75775-5_14
author: Franz Baader
author: Jakub Rydval
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7437042
zbMATH Keywords: description logic
zbMATH Keywords: concrete domains
zbMATH Keywords: p-admissibility
zbMATH Keywords: convexity
zbMATH Keywords: \( \omega \)-admissibility
zbMATH Keywords: finite boundedness
zbMATH Keywords: tractability
zbMATH Keywords: decidability
zbMATH Keywords: constraint satisfaction
MaRDI profile type: Publication
full work available at URL: 978-3-030-75775-5 14
OpenAlex ID: W3163386529
cites work: Maintaining knowledge about temporal intervals
cites work: Q4406531
cites work: Q4012242
cites work: An Introduction to Description Logic
cites work: Description logics with concrete domains and general concept inclusions revisited
cites work: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
cites work: On undecidability bounds for matrix decision problems
cites work: Maximal infinite-valued constraint languages
cites work: The complexity of temporal constraint satisfaction problems
cites work: A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
cites work: PROJECTIVE CLONE HOMOMORPHISMS
cites work: Q4576256
cites work: Universal graphs with forbidden subgraphs and algebraic closure
cites work: A family of countable homogeneous graphs
cites work: Q4003410
cites work: Q4336034
cites work: Homomorphism and embedding universal structures for restricted classes
cites work: On Affine Reachability Problems
cites work: Q5675882
cites work: Combining interval-based temporal reasoning with general TBoxes
cites work: A tableau algorithm for description logics with concrete domains and general TBoxes
cites work: Reducts of the random partial order
Recommended article: Q5465445
Recommended article: Q4539596
Recommended article: Description logics with concrete domains and general concept inclusions revisited
Recommended article: Description logics with aggregates and concrete domains.
Recommended article: A description logic with concrete domains and a role-forming predicate operator
Recommended article: Using model theory to find decidable and tractable description logics with concrete domains
Recommended article: Automated Reasoning with Analytic Tableaux and Related Methods
Recommended article: Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
Recommended article: NEXP TIME-complete description logics with concrete domains
Recommended article: Q4539597
description: scientific article; zbMATH DE number 7437042