Kilian Rückschloß
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kilian Rückschloß has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Felix Weitkämper
Statistical and Symbolic Artificial Intelligence Group, German University of Digital Science, 14482 Potsdam, Germany
4 shared publications Felix Weitkämper
2 shared publications- Guus Eelink
University of Tübingen Philosophy Bursagasse 1 Tübingen Germany
1 shared publication Rafael Kiesel
TU Wien Ludwig-Maximilians-Universität München Ludwig-Maximilians-Universität München
1 shared publication- Rafael Kiesel
Institute of Computational Logic, Vienna University of Technology, 1040 Vienna, Austria
1 shared publication
Latest Publications
- Open Access
- 20 November 2025
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 190
How artificial intelligence leads to knowledge why: An inquiry inspired by Aristotle’s Posterior Analytics
- 20 November 2025
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 190
Open AccessHow artificial intelligence leads to knowledge why: An inquiry inspired by Aristotle’s Posterior Analytics
- Open Access
- 21 October 2025
- Published by IOS Press
- p. 5075-5082
“What if?” in Boolean Bayesian Networks
Counterfactual reasoning describes the ability to consider alternative outcomes – to answer questions such as “What if I had been nicer? Would more students have attended my lecture?” Counterfactuals arise in a wide range of applications; for instance, ethical notions such as responsibility, blame, and harm can be defined in counterfactual terms. Pearl’s standard approach to evaluating counterfactuals requires a fully specified causal model. Such models are difficult to specify, and counterfactual reasoning remains underdetermined when only a probability distribution or a Bayesian network is given. This work proposes a novel approach to counterfactual reasoning in Boolean Bayesian networks. Drawing inspiration from Lewis’s account of counterfactuals and the principle of maximum entropy, it argues that a rational agent should assess counterfactuals by explaining the network through a causal model derived from solving an optimization problem. This problem is formulated in terms of distances between actual and alternative realities, and each counterfactual corresponds to one such problem. The main result identifies a unique causal model that simultaneously solves all of these optimization problems. This provides a principled justification for counterfactual reasoning based solely on a Boolean Bayesian network, without requiring the full specification of a causal model.
- 21 October 2025
- Published by IOS Press
- p. 5075-5082
Open Access“What if?” in Boolean Bayesian Networks
Counterfactual reasoning describes the ability to consider alternative outcomes – to answer questions such as “What if I had been nicer? Would more students have attended my lecture?” Counterfactuals arise in a wide range of applications; for instance, ethical notions such as responsibility, blame, and harm can be defined in counterfactual terms. Pearl’s standard approach to evaluating counterfactuals requires a fully specified causal model. Such models are difficult to specify, and counterfactual reasoning remains underdetermined when only a probability distribution or a Bayesian network is given. This work proposes a novel approach to counterfactual reasoning in Boolean Bayesian networks. Drawing inspiration from Lewis’s account of counterfactuals and the principle of maximum entropy, it argues that a rational agent should assess counterfactuals by explaining the network through a causal model derived from solving an optimization problem. This problem is formulated in terms of distances between actual and alternative realities, and each counterfactual corresponds to one such problem. The main result identifies a unique causal model that simultaneously solves all of these optimization problems. This provides a principled justification for counterfactual reasoning based solely on a Boolean Bayesian network, without requiring the full specification of a causal model.
- 22 December 2023
- Published by Springer Nature
- p. 93-108
What Do Counterfactuals Say About the World? Reconstructing Probabilistic Logic Programs from Answers to “What If?” Queries
- 22 December 2023
- Published by Springer Nature
- p. 93-108
What Do Counterfactuals Say About the World? Reconstructing Probabilistic Logic Programs from Answers to “What If?” Queries
- Open Access
- 29 August 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 385, 169-182
On the Independencies Hidden in the Structure of a Probabilistic Logic Program
Pearl and Verma developed d-separation as a widely used graphical criterion to reason about the conditional independencies that are implied by the causal structure of a Bayesian network. As acyclic ground probabilistic logic programs correspond to Bayesian networks on their dependency graph, we can compute conditional independencies from d-separation in the latter. In the present paper, we generalize the reasoning above to the non-ground case. First, we abstract the notion of a probabilistic logic program away from external databases and probabilities to obtain so-called program structures. We then present a correct meta-interpreter that decides whether a certain conditional independence statement is implied by a program structure on a given external database. Finally, we give a fragment of program structures for which we obtain a completeness statement of our conditional independence oracle. We close with an experimental evaluation of our approach revealing that our meta-interpreter performs significantly faster than checking the definition of independence using exact inference in ProbLog 2.
- 29 August 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 385, 169-182
Open AccessOn the Independencies Hidden in the Structure of a Probabilistic Logic Program
Pearl and Verma developed d-separation as a widely used graphical criterion to reason about the conditional independencies that are implied by the causal structure of a Bayesian network. As acyclic ground probabilistic logic programs correspond to Bayesian networks on their dependency graph, we can compute conditional independencies from d-separation in the latter. In the present paper, we generalize the reasoning above to the non-ground case. First, we abstract the notion of a probabilistic logic program away from external databases and probabilities to obtain so-called program structures. We then present a correct meta-interpreter that decides whether a certain conditional independence statement is implied by a program structure on a given external database. Finally, we give a fragment of program structures for which we obtain a completeness statement of our conditional independence oracle. We close with an experimental evaluation of our approach revealing that our meta-interpreter performs significantly faster than checking the definition of independence using exact inference in ProbLog 2.
- Open Access
- 17 July 2023
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 23 (4) , 884-899
“What if?” in Probabilistic Logic Programming
A ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution, we extend this ProbLog language by the ability to answer “What if” queries. Intuitively, a ProbLog program defines a distribution by solving a system of equations in terms of mutually independent predefined Boolean random variables. In the theory of causality, Judea Pearl proposes a counterfactual reasoning for such systems of equations. Based on Pearl’s calculus, we provide a procedure for processing these counterfactual queries on ProbLog programs, together with a proof of correctness and a full implementation. Using the latter, we provide insights into the influence of different parameters on the scalability of inference. Finally, we also show that our approach is consistent with CP-logic, that is with the causal semantics for logic programs with annotated with disjunctions.
- 17 July 2023
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 23 (4) , 884-899
Open Access“What if?” in Probabilistic Logic Programming
A ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution, we extend this ProbLog language by the ability to answer “What if” queries. Intuitively, a ProbLog program defines a distribution by solving a system of equations in terms of mutually independent predefined Boolean random variables. In the theory of causality, Judea Pearl proposes a counterfactual reasoning for such systems of equations. Based on Pearl’s calculus, we provide a procedure for processing these counterfactual queries on ProbLog programs, together with a proof of correctness and a full implementation. Using the latter, we provide insights into the influence of different parameters on the scalability of inference. Finally, we also show that our approach is consistent with CP-logic, that is with the causal semantics for logic programs with annotated with disjunctions.
- Open Access
"What if?" in Probabilistic Logic Programming
A ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution we extend this ProbLog language by the ability to answer "What if" queries. Intuitively, a ProbLog program defines a distribution by solving a system of equations in terms of mutually independent predefined Boolean random variables. In the theory of causality, Judea Pearl proposes a counterfactual reasoning for such systems of equations. Based on Pearl's calculus, we provide a procedure for processing these counterfactual queries on ProbLog programs, together with a proof of correctness and a full implementation. Using the latter, we provide insights into the influence of different parameters on the scalability of inference. Finally, we also show that our approach is consistent with CP-logic, i.e. with the causal semantics for logic programs with annotated with disjunctions.
Open Access"What if?" in Probabilistic Logic Programming
A ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution we extend this ProbLog language by the ability to answer "What if" queries. Intuitively, a ProbLog program defines a distribution by solving a system of equations in terms of mutually independent predefined Boolean random variables. In the theory of causality, Judea Pearl proposes a counterfactual reasoning for such systems of equations. Based on Pearl's calculus, we provide a procedure for processing these counterfactual queries on ProbLog programs, together with a proof of correctness and a full implementation. Using the latter, we provide insights into the influence of different parameters on the scalability of inference. Finally, we also show that our approach is consistent with CP-logic, i.e. with the causal semantics for logic programs with annotated with disjunctions.