16 citations · 18 across the 7 of their papers we have counts for
7 papers
Transforming Constraint Programs to Input for Local Search
Jo Devriendt, Patrick De Causmaecker, Marc Denecker
Applying local search algorithms to combinatorial optimization problems is not an easy feat. Typically, human intervention is required to compile the constraints to input data for…
FOLASP: FO(.) as Input Language for Answer Ser Solvers
Kylian Van Dessel, Jo Devriendt, Joost Vennekens
Over the past decades, Answer Set Programming (ASP) has emerged as an important paradigm for declarative problem solving. Technological progress in this area has been stimulated by…
Planning with Learned Binarized Neural Networks Benchmarks for MaxSAT Evaluation 2021
Buser Say, Scott Sanner, Jo Devriendt +2
This document provides a brief introduction to learned automated planning problem where the state transition function is in the form of a binarized neural network (BNN), presents a…
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…
BreakID: Static Symmetry Breaking for ASP (System Description)
Jo Devriendt, Bart Bogaerts
Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker Brea…
Implementing a Relevance Tracker Module
Joachim Jansen, Jo Devriendt, Bart Bogaerts +2
PC(ID) extends propositional logic with inductive definitions: rule sets under the well-founded semantics. Recently, a notion of relevance was introduced for this language. This no…
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…