Using model theory to find decidable and tractable description logics with concrete domains
type: Item
instance of: scholarly article
title: Using model theory to find decidable and tractable description logics with concrete domains
author: Franz Baader
author: Jakub Rydval
published in: Journal of Automated Reasoning
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7606343
zbMATH Keywords: description logic
zbMATH Keywords: concrete domains
zbMATH Keywords: GCIs
zbMATH Keywords: \(\omega\)-admissibility
zbMATH Keywords: homogeneity
zbMATH Keywords: finite boundedness
zbMATH Keywords: decidability
zbMATH Keywords: P-admissibility
zbMATH Keywords: convexity
zbMATH Keywords: \(\omega\)-categoricity
zbMATH Keywords: tractability
zbMATH Keywords: constraint satisfaction
MaRDI profile type: Publication
full work available at URL: s10817-022-09626-2
OpenAlex ID: W4225389498
cites work: Maintaining knowledge about temporal intervals
cites work: Q4012242
cites work: An algebraic view on p-admissible concrete domains for lightweight description logics
cites work: Description logics with concrete domains and general concept inclusions revisited
cites work: Q4406531
cites work: An Introduction to Description Logic
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: STACS 2005
cites work: Datalog and constraint satisfaction with infinite templates
cites work: The complexity of temporal constraint satisfaction problems
cites work: Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
cites work: Constraint Satisfaction with Countable Homogeneous Templates
cites work: Maximal infinite-valued constraint languages
cites work: On the scope of the universal-algebraic approach to constraint satisfaction
cites work: On the complexity of MMSNP
cites work: The Complexity of Phylogeny Constraint Satisfaction Problems
cites work: A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
cites work: Discrete Temporal Constraint Satisfaction Problems
cites work: Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
cites work: ASNP: a tame fragment of existential second-order logic
cites work: Q4576256
cites work: Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
cites work: Universal graphs with forbidden subgraphs and algebraic closure
cites work: An automata-theoretic approach to constraint LTL
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q4058132
cites work: Q4539596
cites work: A family of countable homogeneous graphs
cites work: Countable homogeneous relational structures and ℵ0-categorical theories
cites work: Relation algebras of intervals
cites work: Q4003410
cites work: Q4336034
cites work: Homomorphism and embedding universal structures for restricted classes
cites work: Q4227581
cites work: Q5675882
cites work: Q4636561
cites work: Q3032236
cites work: A complexity dichotomy for poset constraint satisfaction
cites work: Q4539597
cites work: A tableau algorithm for description logics with concrete domains and general TBoxes
cites work: A survey of homogeneous structures
cites work: A Dichotomy for First-Order Reducts of Unary Structures
cites work: Reducts of the random partial order
cites work: Q4012244
DOI: 10.1007/S10817-022-09626-2
description: scientific article; zbMATH DE number 7606343