Using model theory to find decidable and tractable description logics with concrete domains
From MaRDI portal
Publication:2090131
Recommendations
- Description logics with concrete domains and general concept inclusions revisited
- scientific article; zbMATH DE number 2196595
- scientific article; zbMATH DE number 6902582
- Automated Reasoning with Analytic Tableaux and Related Methods
- A tableau algorithm for description logics with concrete domains and general TBoxes
Cites work
- A complexity dichotomy for poset constraint satisfaction
- A dichotomy for first-order reducts of unary structures
- A family of countable homogeneous graphs
- A survey of homogeneous structures
- A tableau algorithm for description logics with concrete domains and general TBoxes
- A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP
- An algebraic view on p-admissible concrete domains for lightweight description logics
- An automata-theoretic approach to constraint LTL
- An introduction to description logic
- ASNP: a tame fragment of existential second-order logic
- Constraint satisfaction problems for reducts of homogeneous graphs
- Constraint Satisfaction with Countable Homogeneous Templates
- Countable homogeneous relational structures and ℵ0-categorical theories
- Datalog and constraint satisfaction with infinite templates
- Description logics with concrete domains and general concept inclusions revisited
- Discrete temporal constraint satisfaction problems
- Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
- Homomorphism and embedding universal structures for restricted classes
- scientific article; zbMATH DE number 4130358 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 67501 (Why is no real title available?)
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 1765660 (Why is no real title available?)
- scientific article; zbMATH DE number 1765661 (Why is no real title available?)
- scientific article; zbMATH DE number 6902582 (Why is no real title available?)
- scientific article; zbMATH DE number 6862042 (Why is no real title available?)
- scientific article; zbMATH DE number 3409586 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Maintaining knowledge about temporal intervals
- Maximal infinite-valued constraint languages
- On the complexity of MMSNP
- On the scope of the universal-algebraic approach to constraint satisfaction
- On undecidability bounds for matrix decision problems
- Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
- Reducts of the random partial order
- Relation algebras of intervals
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- STACS 2005
- The complexity of phylogeny constraint satisfaction problems
- The complexity of temporal constraint satisfaction problems
- Universal graphs with forbidden subgraphs and algebraic closure
Cited in
(14)- An algebraic view on p-admissible concrete domains for lightweight description logics
- Description logics with concrete domains and general concept inclusions revisited
- A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic
- scientific article; zbMATH DE number 6902582 (Why is no real title available?)
- A Decidable Constructive Description Logic
- First steps towards taming description logics with strings
- Reasoning in OWL 2 EL with hierarchical concrete domains
- The expressive power of description logics with numerical constraints over restricted classes of models
- The concrete \textsc{Evonne}: visualization meets concrete domain reasoning
- Concrete domains meet expressive cardinality restrictions in description logics
- Homogeneity and homogenizability: hard problems for the logic SNP
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- Three fundamental questions in modern infinite-domain constraint satisfaction
This page was built for publication: Using model theory to find decidable and tractable description logics with concrete domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2090131)
