17 citations · 20 across the 9 of their papers we have counts for
4 papers · 1 filter
Domain-Independent Dynamic Programming with Constraint Propagation
Imko Marijnissen, J. Christopher Beck, Emir Demirović +1
There are two prevalent model-based paradigms for combinatorial problems: 1) state-based representations, such as heuristic search, dynamic programming (DP), and decision diagrams,…
Using Certifying Constraint Solvers for Generating Step-wise Explanations
Ignace Bleukx, Maarten Flippo, Bart Bogaerts +2
In the field of Explainable Constraint Solving, it is common to explain to a user why a problem is unsatisfiable. A recently proposed method for this is to compute a sequence of ex…
How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization
Konstantin Sidorov, Koos van der Linden, Gonçalo Homem de Almeida Correia +2
Modern software for propositional satisfiability problems gives a powerful automated reasoning toolkit, capable of outputting not only a satisfiable/unsatisfiable signal but also a…
In Search of Trees: Decision-Tree Policy Synthesis for Black-Box Systems via Search
Emir Demirović, Christian Schilling, Anna Lukina
Decision trees, owing to their interpretability, are attractive as control policies for (dynamical) systems. Unfortunately, constructing, or synthesising, such policies is a challe…