activity
20202024
most citedDeep Symbolic Learning: Discovering Symbols and Rules from Perceptions

10 citations · 12 across the 9 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI2024

Understanding Domain-Size Generalization in Markov Logic Networks

Florian Chen, Felix Weitkämper, Sagar Malhotra

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 domai…

cs.AI2023

Lifted Inference beyond First-Order Logic

Sagar Malhotra, Davide Bizzaro, Luciano Serafini

Weighted First Order Model Counting (WFOMC) is fundamental to probabilistic inference in statistical relational learning models. As WFOMC is known to be intractable in general ($\#…

cs.AI2023★ 1 cited

Weighted First Order Model Counting with Directed Acyclic Graph Axioms

Sagar Malhotra, Luciano Serafini

Statistical Relational Learning (SRL) integrates First-Order Logic (FOL) and probability theory for learning and inference over relational data. Probabilistic inference and learnin…

cs.AI2022★ 1 cited

On Projectivity in Markov Logic Networks

Sagar Malhotra, Luciano Serafini

Markov Logic Networks (MLNs) define a probability distribution on relational structures over varying domain sizes. Many works have noticed that MLNs, like many other relational mod…

cs.AI2020

Weighted Model Counting in the two variable fragment with Cardinality Constraints: A Closed Form Formula

Sagar Malhotra, Luciano Serafini

Weighted First-Order Model Counting (WFOMC) computes the weighted sum of the models of a first-order theory on a given finite domain. WFOMC has emerged as a fundamental tool for pr…