Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Weitkämper, Felix"'
We study the generalization behavior of Markov Logic Networks (MLNs) across relational structures of different sizes. Multiple works have noticed that MLNs learned on a given domain generalize poorly across domains of different sizes. This behavior e
Externí odkaz:
http://arxiv.org/abs/2403.15933
High quality epidemiological modelling is essential in order to combat the spread of infectious diseases. In this contribution, we present SimPLoID, an epidemiological modelling framework based on the probabilistic logic programming language ProbLog.
Externí odkaz:
http://arxiv.org/abs/2312.00934
Autor:
Rückschloß, Kilian, Weitkämper, Felix
Publikováno v:
EPTCS 385, 2023, pp. 58-64
Probabilistic logic programs are logic programs where some facts hold with a specified probability. Here, we investigate these programs with a causal framework that allows counterfactual queries. Learning the program structure from observational data
Externí odkaz:
http://arxiv.org/abs/2308.15883
Autor:
Rückschloß, Kilian, Weitkämper, Felix
Publikováno v:
EPTCS 385, 2023, pp. 169-182
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 Ba
Externí odkaz:
http://arxiv.org/abs/2308.15865
Publikováno v:
2023 International Conference on 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 sol
Externí odkaz:
http://arxiv.org/abs/2305.15318
Autor:
Koponen, Vera, Weitkämper, Felix
We consider a logic with truth values in the unit interval and which uses aggregation functions instead of quantifiers, and we describe a general approach to asymptotic elimination of aggregation functions and, indirectly, of asymptotic elimination o
Externí odkaz:
http://arxiv.org/abs/2304.07865
Autor:
Weitkämper, Felix
Publikováno v:
Journal of Logical and Algebraic Methods in Programming 139:100975 (2024)
We generalise the distribution semantics underpinning probabilistic logic programming by distilling its essential concept, the separation of a free random component and a deterministic part. This abstracts the core ideas beyond logic programming as s
Externí odkaz:
http://arxiv.org/abs/2211.06751
Autor:
Weitkämper, Felix
Publikováno v:
International Journal of Approximate Reasoning 162:109031 (2023)
The behaviour of statistical relational representations across differently sized domains has become a focal area of research from both a modelling and a complexity viewpoint.Recently, projectivity of a family of distributions emerged as a key propert
Externí odkaz:
http://arxiv.org/abs/2207.00625
Autor:
Koponen, Vera, Weitkämper, Felix
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 4 (November 12, 2024) lmcs:9560
We consider logics with truth values in the unit interval $[0,1]$. Such logics are used to define queries and to define probability distributions. In this context the notion of almost sure equivalence of formulas is generalized to the notion of asymp
Externí odkaz:
http://arxiv.org/abs/2204.09457
Autor:
Weitkämper, Felix
Publikováno v:
Journal of Artificial Intelligence Research 80 (2024) 1407-1436
Dependencies on the relative frequency of a state in the domain are common when modelling probabilistic dependencies on relational data. For instance, the likelihood of a school closure during an epidemic might depend on the proportion of infected pu
Externí odkaz:
http://arxiv.org/abs/2202.10367