The Bayesian ontology language BEL

DOI10.1007/S10817-016-9386-0MaRDI QIDQ2362495zbMATH OpenOpenAlexFDO

Authors İsmail İlkan Ceylan, Rafael Peñaloza

Publication date 10 July 2017

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-016-9386-0

zbMATH Keywords

Bayesian networksdescription logicsknowledge representationprobabilistic reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• The Bayesian description logic \({\mathcal{BEL}}\)
• MEBN: a language for first-order Bayesian knowledge bases
• A Bayesian extension of the description logic \(\mathcal{ALC}\)
• Distributional logic programming for Bayesian knowledge representation
• The Probabilistic Description Logic

Cites work

• A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
• Automata-based axiom pinpointing
• Axiom Pinpointing in General Tableaux
• Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
• BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
• Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
• Computational Complexity of Probabilistic Turing Machines
• Distributed Parameter Learning for Probabilistic Ontologies
• Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
• Finding MAPs for belief networks is NP-hard
• scientific article; zbMATH DE number 2243356 (Why is no real title available?)
• Modeling and Reasoning with Bayesian Networks
• PP is closed under intersection
• Stochastic Boolean satisfiability
• The Bayesian description logic \({\mathcal{BEL}}\)
• The complexity of theorem-proving procedures
• The computational complexity of probabilistic inference using Bayesian belief networks
• The Description Logic Handbook
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• Tight complexity bounds for reasoning in the description logic \(\mathcal{BEL}\)

Cited in

(10)

• Understanding the complexity of axiom pinpointing in lightweight description logics
• A Bayesian extension of the description logic \(\mathcal{ALC}\)
• MEBN: a language for first-order Bayesian knowledge bases
• Tight complexity bounds for reasoning in the description logic \(\mathcal{BEL}\)
• Probabilistic federated \(\mathcal {ALCI}\)
• The Bayesian description logic \({\mathcal{BEL}}\)
• Research of ontology uncertainty reasoning based on Bayesian network
• The Probabilistic Description Logic
• A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
• Exploiting uncertainty for querying inconsistent description logics knowledge bases

Describes a project that uses

Uses Software

• HgMUS
• BEACON
• ProbLog
• ELK
• CEL

This page was built for publication: The Bayesian ontology language \(\mathcal {BEL}\)

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