The following pages link to (Q4012242):
Displaying 22 items.
- Querying incomplete information in RDF with SPARQL (Q286403) (← links)
- Combining interval-based temporal reasoning with general TBoxes (Q814545) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- A tableau algorithm for description logics with concrete domains and general TBoxes (Q877890) (← links)
- Data complexity of query answering in expressive description logics via tableaux (Q945056) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Concrete domains (Q1314355) (← links)
- Cardinality restrictions on concepts (Q1391904) (← links)
- On similarity in fuzzy description logics (Q1697333) (← links)
- CoLab: A hybrid knowledge representation and compilation laboratory (Q1897397) (← links)
- An algebraic view on p-admissible concrete domains for lightweight description logics (Q2055793) (← links)
- Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- Description logics with concrete domains and general concept inclusions revisited (Q2096462) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- A tableau decision procedure for \(\mathcal{SHOIQ}\) (Q2462647) (← links)
- Hybrid logics and ontology languages (Q2867944) (← links)
- (Q4012243) (← links)
- Unification of concept terms in description logics (Q5929707) (← links)
- Ontology-mediated probabilistic model checking (Q6536352) (← links)
- First steps towards taming description logics with strings (Q6545544) (← links)
