24 citations · 29 across the 2 of their papers we have counts for
2 papers
cs.LO2010★ 5 cited
Decidability properties for fragments of CHR
Maurizio Gabbrielli abd Jacopo Mauro, Maria Chiara Meo, Jon Sneyers
We study the decidability of termination for two CHR dialects which, similarly to the Datalog like languages, are defined by using a signature which does not allow function symbols…
cs.PL2010★ 24 cited
CHR(PRISM)-based Probabilistic Logic Learning
Jon Sneyers, Wannes Meert, Joost Vennekens +2
PRISM is an extension of Prolog with probabilistic predicates and built-in support for expectation-maximization learning. Constraint Handling Rules (CHR) is a high-level programmin…