7 citations · 9 across the 5 of their papers we have counts for
5 papers
Certified MaxSAT Preprocessing
Hannes Ihalainen, Andy Oertel, Yong Kiam Tan +3
Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimizatio…
Learning big logical rules by joining small rules
Céline Hocquette, Andreas Niskanen, Rolf Morel +2
A major challenge in inductive logic programming is learning big rules. To address this challenge, we introduce an approach where we join small rules to learn big rules. We impleme…
SharpSAT-TD in Model Counting Competitions 2021-2023
Tuukka Korhonen, Matti Järvisalo
We describe SharpSAT-TD, our submission to the unweighted and weighted tracks of the Model Counting Competition in 2021-2023, which has won in total first places in different t…
Learning MDL logic programs from noisy data
Céline Hocquette, Andreas Niskanen, Matti Järvisalo +1
Many inductive logic programming approaches struggle to learn programs from noisy data. To overcome this limitation, we introduce an approach that learns minimal description length…
Testing and Debugging Techniques for Answer Set Solver Development
Robert Brummayer, Matti Järvisalo
This paper develops automated testing and debugging techniques for answer set solver development. We describe a flexible grammar-based black-box ASP fuzz testing tool which is able…