no code implementations • 6 Nov 2023 • Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe, Bart Bogaerts, Marc Denecker
Thus, we propose a 2-step novel method: (i) the sentence to be satisfied is automatically translated into an equisatisfiable sentence over a ``lifted'' vocabulary that allows domain compression; (ii) satisfiability of the lifted sentence is checked by growing the (initially unknown) compressed domain until a satisfying structure is found.
no code implementations • 30 Apr 2021 • Linde Vanbesien, Maurice Bruynooghe, Marc Denecker
The problem of selecting an appropriate formalisation of aggregates for answer set programming (ASP) remains unsettled.
no code implementations • 2 Feb 2021 • Ruben Lapauw, Maurice Bruynooghe, Marc Denecker
Parity games are infinite two-player games played on directed graphs.
Logic in Computer Science
no code implementations • 2 Sep 2016 • San Pham, Jo Devriendt, Maurice Bruynooghe, Patrick De Causmaecker
The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver.
no code implementations • 26 Sep 2013 • Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer
This paper provides a gentle introduction to problem solving with the IDP3 system.