Probabilistic reasoning in the description logic ALCP with the principle of maximum entropy
From MaRDI portal
Publication:5268422
Abstract: A central question for knowledge representation is how to encode and handle uncertain knowledge adequately. We introduce the probabilistic description logic ALCP that is designed for representing context-dependent knowledge, where the actual context taking place is uncertain. ALCP allows the expression of logical dependencies on the domain and probabilistic dependencies on the possible contexts. In order to draw probabilistic conclusions, we employ the principle of maximum entropy. We provide reasoning algorithms for this logic, and show that it satisfies several desirable properties of probabilistic logics.
Recommendations
- Maximum entropy calculations for the probabilistic description logic \(\mathcal{ALC}^{\mathsf{ME}}\)
- Probabilistic description logics for subjective uncertainty
- The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)
- The Bayesian description logic \({\mathcal{BEL}}\)
- Towards Statistical Reasoning in Description Logics over Finite Domains
Cites work
- scientific article; zbMATH DE number 1285158 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 2243359 (Why is no real title available?)
- A hybrid method for probabilistic satisfiability
- An analysis of first-order logics of probability
- Attributive concept descriptions with complements
- Combining probabilistic logic programming with the power of maximum entropy
- Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
- Distributed Parameter Learning for Probabilistic Ontologies
- EXPtime tableaux for ALC
- Information theory and network coding
- Markov logic. An interface layer for artificial intelligence. With contributions by Jesse Davis, Tuyen Huynh, Stanley Kok, Lilyana Mihalkova, Raymond J. Mooney, Aniruddh Nath, Hoifung Poon, Matthew Richardson, Parag Singla, Marc Sumner, and Jue Wang
- Maximum Entropy Inference with Quantified Knowledge
- Merging the local and global approaches to probabilistic satisfiability
- Probabilistic description logics for subjective uncertainty
- Probabilistic logic
- Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy
- The Bayesian description logic \({\mathcal{BEL}}\)
- The Description Logic Handbook
- The Uncertain Reasoner's Companion
- Towards classifying propositional probabilistic logics
Cited in
(12)- Introduction to Probabilistic Ontologies
- Probabilistic description logics for subjective uncertainty
- Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy
- Analyzing Natural-Language Knowledge Under Uncertainty on the Basis of Description Logics
- The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)
- Maximum entropy calculations for the probabilistic description logic \(\mathcal{ALC}^{\mathsf{ME}}\)
- Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete
- The Bayesian description logic \({\mathcal{BEL}}\)
- The Probabilistic Description Logic
- Context-aware applications based on an ontology model with certainty factor and uncertain reasoning
- Probabilistic federated \(\mathcal {ALCI}\)
- Tight complexity bounds for reasoning in the description logic \(\mathcal{BEL}\)
This page was built for publication: Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268422)
