| Predicate logic as a modeling language: the IDP system B De Cat, B Bogaerts, M Bruynooghe, G Janssens, M Denecker Declarative Logic Programming: Theory, Systems, and Applications, 279-323, 2018 | 120 | 2018 |
| Improved static symmetry breaking for SAT J Devriendt, B Bogaerts, M Bruynooghe, M Denecker Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016 | 90 | 2016 |
| Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3 M Bruynooghe, H Blockeel, B Bogaerts, B De Cat, S De Pooter, J Jansen, ... Theory and Practice of Logic Programming 15 (6), 783-817, 2015 | 54 | 2015 |
| Model expansion in the presence of function symbols using constraint programming B De Cat, B Bogaerts, J Devriendt, M Denecker 2013 IEEE 25th International Conference on Tools with Artificial …, 2013 | 46 | 2013 |
| Symmetric explanation learning: Effective dynamic symmetry handling for SAT J Devriendt, B Bogaerts, M Bruynooghe Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017 | 43 | 2017 |
| Symmetry propagation: Improved dynamic symmetry breaking in SAT J Devriendt, B Bogaerts, B De Cat, M Denecker, C Mears 2012 IEEE 24th International Conference on Tools with Artificial …, 2012 | 42 | 2012 |
| Grounded fixpoints and their applications in knowledge representation B Bogaerts, J Vennekens, M Denecker Artificial Intelligence 224, 51-71, 2015 | 40 | 2015 |
| Certified symmetry and dominance breaking for combinatorial optimisation B Bogaerts, S Gocht, C McCreesh, J Nordström Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3698-3707, 2022 | 31 | 2022 |
| A framework for step-wise explaining how to solve constraint satisfaction problems B Bogaerts, E Gamba, T Guns Artificial Intelligence 300, 103550, 2021 | 31 | 2021 |
| Fixpoint semantics for active integrity constraints B Bogaerts, L Cruz-Filipe Artificial Intelligence 255, 43-70, 2018 | 27 | 2018 |
| Step-wise explanations of constraint satisfaction problems B Bogaerts, E Gamba, J Claes, T Guns ECAI 2020, 640-647, 2020 | 26 | 2020 |
| Solving QBF instances with nested SAT solvers B Bogaerts, T Janhunen, S Tasharrofi Workshops at the Thirtieth AAAI Conference on Artificial Intelligence, 2016 | 26 | 2016 |
| Certified core-guided MaxSAT solving J Berg, B Bogaerts, J Nordström, A Oertel, D Vandesande International Conference on Automated Deduction, 1-22, 2023 | 24 | 2023 |
| Exploiting Justifications for Lazy Grounding of Answer Set Programs. B Bogaerts, A Weinzierl IJCAI, 1737-1745, 2018 | 22 | 2018 |
| Stable-unstable semantics: Beyond NP with normal logic programs B Bogaerts, T Janhunen, S Tasharrofi Theory and Practice of Logic Programming 16 (5-6), 570-586, 2016 | 22 | 2016 |
| QMaxSATpb: A certified MaxSAT solver D Vandesande, W De Wulf, B Bogaerts International Conference on Logic Programming and Nonmonotonic Reasoning …, 2022 | 21 | 2022 |
| SHACL: A description logic in disguise B Bogaerts, M Jakubowski, J Van den Bussche International Conference on Logic Programming and Nonmonotonic Reasoning, 75-88, 2022 | 20 | 2022 |
| Weighted abstract dialectical frameworks through the lens of approximation fixpoint theory B Bogaerts Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2686-2693, 2019 | 20 | 2019 |
| Safe inductions and their applications in knowledge representation B Bogaerts, J Vennekens, M Denecker Artificial Intelligence 259, 167-185, 2018 | 20* | 2018 |
| Certified dominance and symmetry breaking for combinatorial optimisation B Bogaerts, S Gocht, C McCreesh, J Nordström Journal of Artificial Intelligence Research 77, 1539–1589-1539–1589, 2023 | 19 | 2023 |
Marc DeneckerProf. at KU-LeuvenVerified email at cs.kuleuven.be
