The Bayesian ontology language \(\mathcal {BEL}\)

DOI10.1007/s10817-016-9386-0zbMath1409.68278OpenAlexW2525707692MaRDI QIDQ2362495

Rafael Peñaloza, İsmail İlkan Ceylan

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 networksknowledge representationprobabilistic reasoningdescription logics

Mathematics Subject Classification ID

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

Related Items (3)

Understanding the complexity of axiom pinpointing in lightweight description logics ⋮ The Probabilistic Description Logic ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases

Uses Software

• ProbLog
• CEL
• BEACON
• ELK
• HgMUS

Cites Work

• Unnamed Item
• Automata-based axiom pinpointing
• Finding MAPs for belief networks is NP-hard
• PP is closed under intersection
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
• The computational complexity of probabilistic inference using Bayesian belief networks
• BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies
• Distributed Parameter Learning for Probabilistic Ontologies
• Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$
• Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
• The Bayesian Description Logic ${\mathcal{BEL}}$
• Axiom Pinpointing in General Tableaux
• Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
• Modeling and Reasoning with Bayesian Networks
• Computational Complexity of Probabilistic Turing Machines
• Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
• The Description Logic Handbook
• The complexity of theorem-proving procedures
• Stochastic Boolean satisfiability

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