9 citations · 10 across the 3 of their papers we have counts for
4 papers
What are the Right Symmetries for Formal Theorem Proving?
Krzysztof Olejniczak, Radoslav Dimitrov, Xingyue Huang +3
Formal theorem provers based on large language models (LLMs) are highly sensitive to superficial variations in problem representation: semantically equivalent statements can exhibi…
PlanE: Representation Learning over Planar Graphs
Radoslav Dimitrov, Zeyang Zhao, Ralph Abboud +1
Graph neural networks are prominent models for representation learning over graphs, where the idea is to iteratively compute representations of nodes of an input graph through a se…
Shortest Path Networks for Graph Property Prediction
Ralph Abboud, Radoslav Dimitrov, İsmail İlkan Ceylan
Most graph neural network models rely on a particular message passing paradigm, where the idea is to iteratively propagate node representations of a graph to each node in the direc…
On the Approximability of Weighted Model Integration on DNF Structures
Ralph Abboud, İsmail İlkan Ceylan, Radoslav Dimitrov
Weighted model counting (WMC) consists of computing the weighted sum of all satisfying assignments of a propositional formula. WMC is well-known to be #P-hard for exact solving, bu…