Statistical EL is \textsc{ExpTime}-complete

DOI10.1016/J.IPL.2021.106113MaRDI QIDQ2032149zbMATH OpenOpenAlexFDO

Authors Bartosz Bednarczyk

Publication date 16 June 2021

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.00696

zbMATH Keywords

computational complexityconsistency problemprobabilistic description logicstatistical ontologies

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Extending \(\mathcal{EL}^{++}\) with linear constraints on the probability of axioms
• Unification in the Description Logic $\mathcal{EL}$
• Towards Statistical Reasoning in Description Logics over Finite Domains
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics

Cites work

• An introduction to description logic
• Expressive probabilistic description logics
• Guarded negation
• Modal languages and bounded fragments of predicate logic
• On the Decision Problem for Two-Variable First-Order Logic
• PR-OWL - a language for defining probabilistic ontologies
• Probabilistic description logics for subjective uncertainty
• Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy
• Reasoning and query answering in description logics

Describes a project that uses

Uses Software

• PR-OWL

This page was built for publication: Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032149)