BayesL: a Logical Framework for the Verification of Bayesian Networks
Stefano M. Nicoletti, E. Moritz Hahn, Mari\"elle Stoelinga

TL;DR
BayesL is a formal logical framework designed to specify, query, and verify Bayesian networks, enhancing transparency and trustworthiness in explainable AI through integrated inference and model checking.
Contribution
It introduces BayesL, a structured language enabling formal reasoning and verification of Bayesian networks, including counterfactuals, with an open-source implementation.
Findings
BayesL clarifies BN behaviour in diagnostic case studies.
It supports formal property specification and model checking.
Demonstrated effectiveness on a benchmark set of BN models.
Abstract
Modern explainable AI still struggles with a fundamental gap: although Bayesian networks (BNs) provide transparent probabilistic structure, there is no unified way to formally express, query, and verify what these models imply. Analysts often rely on ad hoc queries, manual interventions, or informal reasoning to explore causal relations and hypothetical scenarios, making it difficult to systematically validate model behaviour, uncover hidden assumptions, and guarantee reliability. We introduce BayesL (pronounced Basil), a logical framework for specifying, querying, and verifying the behaviour of BNs. BayesL is a structured language that supports both probabilistic inference queries (e.g., marginal, conditional, MAP) and model-checking-style queries that specify formal properties of BN behaviour. It facilitates versatile reasoning over causal and evidential relationships, including…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
