Pierre Carbonnelle, Matthias Van der Hallen, and Marc Denecker. Quantification and aggregation over concepts of the ontology. 2022. arXiv:2202.00898.


Pierre Carbonnelle, Simon Vandevelde, Joost Vennekens, and Marc Denecker. Idp-z3: a reasoning engine for fo(.). 2022. arXiv:2202.00343.


Marc Denecker. Extending classical logic with inductive definitions. In John W. Lloyd, Verónica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Lu\'ıs Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, volume 1861 of Lecture Notes in Computer Science, 703–717. Springer, 2000. URL:\_47, doi:10.1007/3-540-44957-4\_47.


Marc Denecker, Nikolay Pelov, and Maurice Bruynooghe. Ultimate well-founded and stable semantics for logic programs with aggregates. In Philippe Codognet, editor, Logic Programming, 17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, volume 2237 of Lecture Notes in Computer Science, 212–226. Springer, 2001. URL:\_22, doi:10.1007/3-540-45635-X\_22.


Philip Johnson-Laird. How we reason. Oxford University Press, 2008.


Nikolay Pelov and Eugenia Ternovska. Reducing inductive definitions to propositional satisfiability. In International Conference on Logic Programming, 221–234. Springer, 2005.


Johan Wittocx, Maarten Mariën, and Marc Denecker. Grounding FO and FO(ID) with bounds. CoRR, 2014. URL:, arXiv:1401.3840.