Probabilistic Description Logics for Subjective Uncertainty
Authors: Victor Gutierrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder
JAIR 2017 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We propose a family of probabilistic description logics (DLs) that are derived in a principled way from Halpern s probabilistic first-order logic. The resulting probabilistic DLs have a two-dimensional semantics similar to temporal DLs and are well-suited for representing subjective probabilities. We carry out a detailed study of reasoning in the new family of logics, concentrating on probabilistic extensions of the DLs ALC and EL, and showing that the complexity ranges from PTime via Exp Time and 2Exp Time to undecidable. |
| Researcher Affiliation | Academia | Víctor Gutiérrez-Basulto EMAIL Jean Christoph Jung EMAIL Carsten Lutz EMAIL University of Bremen Bibliothekstraße 1, 28359 Bremen Germany; Lutz Schr oder EMAIL Friedrich-Alexander-University Erlangen-N urnberg Schlossplatz 4, 91054 Erlangen Germany |
| Pseudocode | Yes | Figure 1: Completion rules for Prob-EL01. Figure 2: TBox completion rules for subsumption in Prob-EL p;=1. Figure 3: Saturation rules for cl(Γ). Figure 5: The rules for completing the data structure. |
| Open Source Code | No | No statement about code availability or links to repositories are found in the paper. |
| Open Datasets | Yes | Take for example the well-known and widely used medical ontology SNOMED CT (Price & Spackman, 2000) |
| Dataset Splits | No | This paper focuses on theoretical analysis of computational complexity of probabilistic description logics and does not include empirical experiments with datasets that would require specific splits. |
| Hardware Specification | No | This paper is theoretical, analyzing logical frameworks and their computational complexity. It does not describe any experimental setup that would involve specific hardware. |
| Software Dependencies | No | This paper is theoretical and focuses on logical frameworks and their computational complexity, not on specific software implementations or dependencies with version numbers. |
| Experiment Setup | No | This paper is theoretical and focuses on the computational complexity of logical systems, rather than empirical experiments. Therefore, it does not describe any experimental setup details such as hyperparameters or training configurations. |