no code implementations • 22 Aug 2018 • Sergey Paramonov, Daria Stepanova, Pauli Miettinen
We present a hybrid approach for itemset, sequence and graph mining which exploits dedicated highly optimized mining systems to detect frequent patterns and then filters the results using declarative ASP.
1 code implementation • 21 May 2017 • Sergey Paramonov, Christian Bessiere, Anton Dries, Luc De Raedt
Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems.
no code implementations • 31 Aug 2016 • Matthias van der Hallen, Sergey Paramonov, Michael Leuschel, Gerda Janssens
For IDP and ASP, which have no native support for higher order logic, we propose the use of encoding techniques such as the disjoint union technique and the saturation technique.