53 citations · 128 across the 16 of their papers we have counts for
17 papers
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
Linde Vanbesien, Maurice Bruynooghe, Marc Denecker
Aggregates provide a concise way to express complex knowledge. The problem of selecting an appropriate formalisation of aggregates for answer set programming (ASP) remains unsettle…
Justifications and a Reconstruction of Parity Game Solving Algorithms
Ruben Lapauw, Maurice Bruynooghe, Marc Denecker
Parity games are infinite two-player games played on directed graphs. Parity game solvers are used in the domain of formal verification. This paper defines parametrized parity game…
A MIP Backend for the IDP System
San Pham, Jo Devriendt, Maurice Bruynooghe +1
The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver. A few similar systems have used a Mixed Integer Programming (MIP) solver…
On Local Domain Symmetry for Model Expansion
Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe +1
Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of…
Lazy Model Expansion: Interleaving Grounding with Search
Broes De Cat, Marc Denecker, Peter Stuckey +1
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in so…
Predicate Logic as a Modelling Language: The IDP System
Broes De Cat, Bart Bogaerts, Maurice Bruynooghe +2
With the technology of the time, Kowalski's seminal 1974 paper {\em Predicate Logic as a Programming Language} was a breakthrough for the use of logic in computer science. It intro…