Modeling Machine Learning and Data Mining Problems with FO(·). - Hendrik Blockeel; Bart Bogaerts 001; Maurice Bruynooghe; Broes De Cat; Stef De Pooter; Marc Denecker; Anthony Labarre; Jan Ramon; Sicco Verwer (ICLP (Technical Communications), 2012)

Symmetry Propagation: Improved Dynamic Symmetry Breaking in SAT. - Jo Devriendt; Bart Bogaerts 001; Broes De Cat; Marc Denecker; Christopher Mears (ICTAI, 2012)

Model Expansion in the Presence of Function Symbols Using Constraint Programming. - Broes De Cat; Bart Bogaerts 001; Jo Devriendt; Marc Denecker (ICTAI, 2013)

Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3. - Maurice Bruynooghe; Hendrik Blockeel; Bart Bogaerts 001; Broes De Cat; Stef De Pooter; Joachim Jansen; Anthony Labarre; Jan Ramon; Marc Denecker; Sicco Verwer (CoRR, 2013)

The effects of buying a new car: an extension of the IDP Knowledge Base System. - Pieter Van Hertum; Joost Vennekens; Bart Bogaerts 001; Jo Devriendt; Marc Denecker (Theory Pract. Log. Program., 2013)

Inference in the FO(C) Modelling Language. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker; Jan Van den Bussche (ECAI, 2014)

FO(C) and Related Modelling Paradigms. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker; Jan Van den Bussche (CoRR, 2014)

FO(C): A Knowledge Representation Language of Causality. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker; Jan Van den Bussche (CoRR, 2014)

Predicate Logic as a Modelling Language: The IDP System. - Broes De Cat; Bart Bogaerts 001; Maurice Bruynooghe; Marc Denecker (CoRR, 2014)

Simulating Dynamic Systems Using Linear Time Calculus Theories. - Bart Bogaerts 001; Joachim Jansen; Maurice Bruynooghe; Broes De Cat; Joost Vennekens; Marc Denecker (Theory Pract. Log. Program., 2014)

Grounded Fixpoints. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker (AAAI, 2015)

Partial Grounded Fixpoints. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker (IJCAI, 2015)

Grounded fixpoints and their applications in knowledge representation. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker (Artif. Intell., 2015)

Knowledge compilation of logic programs using approximation fixpoint theory. - Bart Bogaerts 001; Guy Van den Broeck (Theory Pract. Log. Program., 2015)

Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. - Maurice Bruynooghe; Hendrik Blockeel; Bart Bogaerts 001; Broes De Cat; Stef De Pooter; Joachim Jansen; Anthony Labarre; Jan Ramon; Marc Denecker; Sicco Verwer (Theory Pract. Log. Program., 2015)

Groundedness in Logics with a Fixpoint Semantics; Gegrondheid in logicas met een vaste-puntssemantiek. - Bart Bogaerts 001 (2015)

Solving QBF Instances with Nested SAT Solvers. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (AAAI Workshop: Beyond NP, 2016)

A Compositional Typed Higher-Order Logic with Definitions. - Ingmar Dasseville; Matthias van der Hallen; Bart Bogaerts 001; Gerda Janssens; Marc Denecker (ICLP (Technical Communications), 2016)

Distributed Autoepistemic Logic and its Application to Access Control. - Pieter Van Hertum; Marcos Cramer; Bart Bogaerts 001; Marc Denecker (IJCAI, 2016)

Relevance for SAT(ID). - Joachim Jansen; Bart Bogaerts 001; Jo Devriendt; Gerda Janssens; Marc Denecker (IJCAI, 2016)

Declarative Solver Development: Case Studies. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (KR, 2016)

SAT-to-SAT in QBFEval 2016. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (QBF@SAT, 2016)

Improved Static Symmetry Breaking for SAT. - Jo Devriendt; Bart Bogaerts 001; Maurice Bruynooghe; Marc Denecker (SAT, 2016)

BreakID: Static Symmetry Breaking for ASP (System Description). - Jo Devriendt; Bart Bogaerts 001 (CoRR, 2016)

Implementing a Relevance Tracker Module. - Joachim Jansen; Jo Devriendt; Bart Bogaerts 001; Gerda Janssens; Marc Denecker (CoRR, 2016)

Bootstrapping Inference in the IDP Knowledge Base System. - Bart Bogaerts 001; Joachim Jansen; Broes De Cat; Gerda Janssens; Maurice Bruynooghe; Marc Denecker (New Gener. Comput., 2016)

On Well-Founded Set-Inductions and Locally Monotone Operators. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker (ACM Trans. Comput. Log., 2016)

Stable-unstable semantics: Beyond NP with normal logic programs. - Bart Bogaerts 001; Tomi Janhunen; Shahab Tasharrofi (Theory Pract. Log. Program., 2016)

On local domain symmetry for model expansion. - Jo Devriendt; Bart Bogaerts 001; Maurice Bruynooghe; Marc Denecker (Theory Pract. Log. Program., 2016)

Safe Inductions: An Algebraic Study. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker (IJCAI, 2017)

Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory. - Bart Bogaerts 001; Luís Cruz-Filipe (IJCAI, 2017)

Propagators and Solvers for the Algebra of Modular Systems. - Bart Bogaerts 001; Eugenia Ternovska; David G. Mitchell (LPAR, 2017)

Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT. - Jo Devriendt; Bart Bogaerts 001; Maurice Bruynooghe (SAT, 2017)

A Logical Study of Some Common Principles of Inductive Definition and its Implications for Knowledge Representation. - Marc Denecker; Bart Bogaerts 001; Joost Vennekens (CoRR, 2017)

Predicate logic as a modeling language: the IDP system. - Broes De Cat; Bart Bogaerts 001; Maurice Bruynooghe; Gerda Janssens; Marc Denecker (Declarative Logic Programming, 2018)

Exploiting Justifications for Lazy Grounding of Answer Set Programs. - Bart Bogaerts 001; Antonius Weinzierl (IJCAI, 2018)

Safe inductions and their applications in knowledge representation. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker (Artif. Intell., 2018)

Fixpoint semantics for active integrity constraints. - Bart Bogaerts 001; Luís Cruz-Filipe (Artif. Intell., 2018)

Weighted Abstract Dialectical Frameworks through the Lens of Approximation Fixpoint Theory. - Bart Bogaerts 001 (AAAI, 2019)

ZebraTutor: Explaining How to Solve Logic Grid Puzzles. - Jens Claes; Bart Bogaerts 001; Rocsildes Canoy; Emilio Gamba; Tias Guns (BNAIC/BENELEARN, 2019)

Explaining Actual Causation in Terms of Possible Causal Processes. - Marc Denecker; Bart Bogaerts 001; Joost Vennekens (JELIA, 2019)

Guest editorial: special issue on answer set programming and other computing paradigms. - Bart Bogaerts 001; Esra Erdem 001; Amelia Harrison (Ann. Math. Artif. Intell., 2019)

Step-Wise Explanations of Constraint Satisfaction Problems. - Bart Bogaerts 001; Emilio Gamba; Jens Claes; Tias Guns (ECAI, 2020)

LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories. - Wolf De Wulf; Bart Bogaerts 001 (ICLP Technical Communications, 2020)

Exploiting Game Theory for Analysing Justifications. - Simon Marynissen; Bart Bogaerts 001; Marc Denecker (Theory Pract. Log. Program., 2020)

On the Relation Between Approximation Fixpoint Theory and Justification Theory. - Simon Marynissen; Bart Bogaerts 001; Marc Denecker (IJCAI, 2021)

Link Traversal with Distributed Subweb Specifications. - Bart Bogaerts 001; Bas Ketsman; Younes Zeboudj; Heba Aamer; Ruben Taelman; Ruben Verborgh (RuleML+RR, 2021)

A framework for step-wise explaining how to solve constraint satisfaction problems. - Bart Bogaerts 001; Emilio Gamba; Tias Guns (Artif. Intell., 2021)

Fixpoint Semantics for Recursive SHACL. - Bart Bogaerts 001; Maxime Jakubowski (ICLP Technical Communications, 2021)

Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints. - Bart Bogaerts 001; Luís Cruz-Filipe (ACM Trans. Comput. Log., 2021)

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. - Bart Bogaerts 001; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (AAAI, 2022)

Symmetry and Dominance Breaking for Pseudo-Boolean Optimization. - Daimy Van Caudenberg; Bart Bogaerts 001 (BNAIC/BENELEARN, 2022)

Expressiveness of SHACL Features. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (ICDT, 2022)

SHACL: A Description Logic in Disguise. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (LPNMR, 2022)

QMaxSATpb: A Certified MaxSAT Solver. - Dieter Vandesande; Wolf De Wulf; Bart Bogaerts 001 (LPNMR, 2022)

On Nested Justification Systems (full version). - Simon Marynissen; Jesse Heyninck; Bart Bogaerts 001; Marc Denecker (CoRR, 2022)

Tree-Like Justification Systems are Consistent. - Simon Marynissen; Bart Bogaerts 001 (ICLP Technical Communications / Doctoral Consortium, 2022)

Computing Abductive Explanations. - Luciano Caroprese; Ester Zumpano; Bart Bogaerts 001 (IEEE Intell. Syst., 2022)

On Nested Justification Systems. - Simon Marynissen; Jesse Heyninck; Bart Bogaerts 001; Marc Denecker (Theory Pract. Log. Program., 2022)

Certified Core-Guided MaxSAT Solving. - Jeremias Berg; Bart Bogaerts 001; Jakob Nordström; Andy Oertel; Dieter Vandesande (CADE, 2023)

Simplifying Step-Wise Explanation Sequences. - Ignace Bleukx; Jo Devriendt; Emilio Gamba; Bart Bogaerts 001; Tias Guns (CP, 2023)

Mathematical Foundations for Joining Only Knowing and Common Knowledge. - Marcos Cramer; Samuele Pollaci; Bart Bogaerts 001 (KR, 2023)

Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended algorithms and examples). - Emilio Gamba; Bart Bogaerts 001; Tias Guns (CoRR, 2023)

Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version). - Jesse Heyninck; Bart Bogaerts 001 (CoRR, 2023)

Distributed Autoepistemic Logic: Semantics, Complexity, and Applications to Access Control. - Marcos Cramer; Pieter Van Hertum; Bart Bogaerts 001; Marc Denecker (CoRR, 2023)

Mathematical Foundations for Joining Only Knowing and Common Knowledge (Extended Version). - Marcos Cramer; Samuele Pollaci; Bart Bogaerts 001 (CoRR, 2023)

Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. - Bart Bogaerts 001; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (J. Artif. Intell. Res., 2023)

Efficiently Explaining CSPs with Unsatisfiable Subset Optimization. - Emilio Gamba; Bart Bogaerts 001; Tias Guns (J. Artif. Intell. Res., 2023)

Interactive Model Expansion in an Observable Environment. - Pierre Carbonnelle; Joost Vennekens; Marc Denecker; Bart Bogaerts 001 (Theory Pract. Log. Program., 2023)

Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates. - Jesse Heyninck; Bart Bogaerts 001 (Theory Pract. Log. Program., 2023)

Inputs, Outputs, and Composition in the Logic of Information Flows. - Heba Aamer; Bart Bogaerts 001; Dimitri Surinx; Eugenia Ternovska; Jan Van den Bussche (ACM Trans. Comput. Log., 2023)

Using Symmetries to Lift Satisfiability Checking. - Pierre Carbonnelle; Gottfried Schenner; Maurice Bruynooghe; Bart Bogaerts 001; Marc Denecker (AAAI, 2024)

Approximation Fixpoint Theory in Coq - With an Application to Logic Programming. - Bart Bogaerts 001; Luís Cruz-Filipe (Logics and Type Systems in Theory and Practice, 2024)

Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability. - Jeremias Berg; Bart Bogaerts 001; Jakob Nordström; Andy Oertel; Tobias Paxian; Dieter Vandesande (CP, 2024)

Towards a Unifying View on Monotone Constructive Definitions. - Linde Vanbesien; Samuele Pollaci; Bart Bogaerts 001; Marc Denecker (ISAIM, 2024)

A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory. - Samuele Pollaci; Babis Kostopoulos; Marc Denecker; Bart Bogaerts 001 (LPNMR, 2024)

Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming. - Jesse Heyninck; Ofer Arieli; Bart Bogaerts 001 (Artif. Intell., 2024)

Embedding justification theory in approximation fixpoint theory. - Simon Marynissen; Bart Bogaerts 001; Marc Denecker (Artif. Intell., 2024)

A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory (Extended Version). - Samuele Pollaci; Babis Kostopoulos; Marc Denecker; Bart Bogaerts 001 (CoRR, 2024)

Exploiting Symmetries in MUS Computation (Extended version). - Ignace Bleukx; Hélène Verhaeghe; Bart Bogaerts 001; Tias Guns (CoRR, 2024)

Preservation theorems for Tarski's relation algebra. - Bart Bogaerts 001; Balder ten Cate; Brett McLean; Jan Van den Bussche (Log. Methods Comput. Sci., 2024)

Executable First-Order Queries in the Logic of Information Flows. - Heba Aamer; Bart Bogaerts 001; Dimitri Surinx; Eugenia Ternovska; Jan Van den Bussche (Log. Methods Comput. Sci., 2024)

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (Log. Methods Comput. Sci., 2024)

Postulates for Provenance: Instance-based provenance for first-order logic. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (Proc. ACM Manag. Data, 2024)

The Stable Model Semantics for Higher-Order Logic Programming. - Bart Bogaerts 001; Angelos Charalambidis; Giannos Chatziagapis; Babis Kostopoulos; Samuele Pollaci; Panos Rondogiannis (Theory Pract. Log. Program., 2024)

Distributed Subweb Specifications for Traversing the Web. - Bart Bogaerts 001; Bas Ketsman; Younes Zeboudj; Heba Aamer; Ruben Taelman; Ruben Verborgh (Theory Pract. Log. Program., 2024)

Exploiting Symmetries in MUS Computation. - Ignace Bleukx; Hélène Verhaeghe; Bart Bogaerts 001; Tias Guns (AAAI, 2025)

Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets. - Hannes Ihalainen; Jeremias Berg; Matti Järvisalo; Bart Bogaerts 001 (CP, 2025)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation. - Daimy Van Caudenberg; Bart Bogaerts 001; Leandro Vendramin (TACAS (2), 2025)

Certifying Pareto-Optimality in Multi Objective Maximum Satisfiability. - Christoph Jabs; Jeremias Berg; Bart Bogaerts 001; Matti Järvisalo (TACAS (2), 2025)

The Possible Asylum. - Bart Bogaerts 001 (Am. Math. Mon., 2025)

Approximation Fixpoint Theory with Refined Approximation Spaces. - Linde Vanbesien; Bart Bogaerts 001; Marc Denecker (CoRR, 2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach. - Hannes Ihalainen; Dieter Vandesande; André Schidler; Jeremias Berg; Bart Bogaerts 001; Matti Järvisalo (CoRR, 2025)