Pages that link to "Item:Q2974769"

The following pages link to An Introduction to Description Logic (Q2974769):

Displaying 50 items.

• Combining event calculus and description logic reasoning via logic programming (Q831926) (← links)
• A note on a description logic of concept and role typicality for defeasible reasoning over ontologies (Q1632047) (← links)
• Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics (Q1726275) (← links)
• Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete (Q2032149) (← links)
• Consistent query answering for primary keys in Datalog (Q2035471) (← links)
• Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment (Q2055791) (← links)
• An algebraic view on p-admissible concrete domains for lightweight description logics (Q2055793) (← links)
• ReAD: AD-based modular ontology classification (Q2055795) (← links)
• Finding good proofs for description logic entailments using recursive quality measures (Q2055864) (← links)
• Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes (Q2055866) (← links)
• The Fusemate logic programming system (Q2055893) (← links)
• Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
• \texttt{OWL2Vec}*: embedding of OWL ontologies (Q2071326) (← links)
• Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
• Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
• Logical separability of labeled data examples under ontologies (Q2093388) (← links)
• Deciding the word problem for ground identities with commutative and extensional symbols (Q2096444) (← links)
• Description logics with concrete domains and general concept inclusions revisited (Q2096462) (← links)
• Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL (Q2104508) (← links)
• Evonne: interactive proof visualization for description logics (system description) (Q2104515) (← links)
• Actions over core-closed knowledge bases (Q2104517) (← links)
• Omitting types theorem in hybrid dynamic first-order logic with rigid symbols (Q2111114) (← links)
• A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
• A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
• Combining UML and ontology: an exploratory survey (Q2197800) (← links)
• Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \) (Q2238693) (← links)
• Conjunctive query pattern structures: a relational database model for formal concept analysis (Q2286397) (← links)
• Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) (Q2286398) (← links)
• Strong inconsistency (Q2321259) (← links)
• Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies (Q2680773) (← links)
• Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
• (Q4558528) (← links)
• An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆ (Q4991928) (← links)
• Towards Contingent World Descriptions in Description Logics (Q5006820) (← links)
• An Occurrence Description Logic (Q5059717) (← links)
• (Q5091138) (← links)
• KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS (Q5222523) (← links)
• (Q5232905) (← links)
• (Q5377468) (← links)
• First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
• Towards World Identification in Description Logics (Q5882770) (← links)
• The Probabilistic Description Logic (Q6063856) (← links)
• Completing the Picture: Complexity of Graded Modal Logics with Converse (Q6063859) (← links)
• Efficient TBox Reasoning with Value Restrictions using the <i>wer</i> Reasoner (Q6063879) (← links)
• Temporal Minimal-World Query Answering over Sparse ABoxes (Q6063880) (← links)
• Answer Counting under Guarded TGDs (Q6076172) (← links)
• The notion of abstraction in ontology-based data management (Q6080649) (← links)
• Mining ℰℒ⊥ Bases with Adaptable Role Depth (Q6135964) (← links)
• Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
• Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests (Q6151565) (← links)