| Abduction in logic programming M Denecker, A Kakas Computational Logic: Logic Programming and Beyond: Essays in Honour of …, 2002 | 253 | 2002 |
| Well-founded and stable semantics of logic programs with aggregates N Pelov, M Denecker, M Bruynooghe Theory and Practice of Logic Programming 7 (3), 301-353, 2007 | 191 | 2007 |
| CP-logic: A language of causal probabilistic events and its relation to logic programming J Vennekens, M Denecker, M Bruynooghe Theory and practice of logic programming 9 (3), 245-308, 2009 | 176 | 2009 |
| A logic of nonmonotone inductive definitions M Denecker, E Ternovska ACM transactions on computational logic (TOCL) 9 (2), 1-52, 2008 | 170 | 2008 |
| Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning M Denecker, V Marek, M Truszczyński Logic-based artificial intelligence, 127-144, 2000 | 168 | 2000 |
| The second answer set programming competition M Denecker, J Vennekens, S Bond, M Gebser, M Truszczyński Logic Programming and Nonmonotonic Reasoning: 10th International Conference …, 2009 | 147 | 2009 |
| Uniform semantic treatment of default and autoepistemic logics M Denecker, VW Marek, M Truszczyński Artificial Intelligence 143 (1), 79-122, 2003 | 137 | 2003 |
| SLDNFA: an abductive procedure for abductive logic programs M Denecker, D De Schreye The journal of logic programming 34 (2), 111-167, 1998 | 132 | 1998 |
| Extending classical logic with inductive definitions M Denecker International Conference on Computational Logic, 703-717, 2000 | 128 | 2000 |
| Representing incomplete knowledge in abductive logic programming M Denecker, D De Schreye Journal of Logic and Computation 5 (5), 553-577, 1995 | 128 | 1995 |
| SLDNFA: An Abductive Procedure for Normal Abductive Programs. M Denecker, D De Schreye JICSLP, 686-700, 1992 | 124 | 1992 |
| Temporal Reasoning with Abductive Event Calculus. M Denecker, L Missiaen, M Bruynooghe ECAI, 384-388, 1992 | 122 | 1992 |
| 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 | 121 | 2018 |
| A-system: Problem solving through abduction B Van Nuffelen BNAIC 1, 591-596, 2001 | 108 | 2001 |
| Ultimate approximation and its application in nonmonotonic knowledge representation systems M Denecker, VW Marek, M Truszczyński Information and Computation 192 (1), 84-121, 2004 | 101 | 2004 |
| The idp system: a model expansion system for an extension of classical logic J Wittocx, M Mariën, M Denecker LaSh, 153-165, 2008 | 94 | 2008 |
| Improved static symmetry breaking for SAT J Devriendt, B Bogaerts, M Bruynooghe, M Denecker Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016 | 93 | 2016 |
| Logic programming revisited: Logic programs as inductive definitions M Denecker, M Bruynooghe, V Marek ACM Transactions on Computational Logic 2 (4), 623-654, 2001 | 93 | 2001 |
| Inductive situation calculus M Denecker, E Ternovska Artificial Intelligence 171 (5-6), 332-360, 2007 | 92 | 2007 |
| Ultimate well-founded and stable semantics for logic programs with aggregates M Denecker, N Pelov, M Bruynooghe Logic Programming: 17thInternational Conference, ICLP 2001 Paphos, Cyprus …, 2001 | 85 | 2001 |
