7 citations · 8 across the 3 of their papers we have counts for
5 papers
Partial Queries for Constraint Acquisition
Christian Bessiere, Clement Carbonnel, Anton Dries +8
Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the us…
Knowledge Compilation with Continuous Random Variables and its Application in Hybrid Probabilistic Logic Programming
Pedro Zuidberg Dos Martires, Anton Dries, Luc De Raedt
In probabilistic reasoning, the traditionally discrete domain has been elevated to the hybrid domain encompassing additionally continuous random variables. Inference in the hybrid…
Sketched Answer Set Programming
Sergey Paramonov, Christian Bessiere, Anton Dries +1
Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models is not trivial. We propose a novel method, called Sketched Ans…
The effect of constraints on information loss and risk for clustering and modification based graph anonymization methods
David F. Nettleton, Vicenc Torra, Anton Dries
In this paper we present a novel approach for anonymizing Online Social Network graphs which can be used in conjunction with existing perturbation approaches such as clustering and…
Mining Patterns in Networks using Homomorphism
Anton Dries, Siegfried Nijssen
In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determi…