Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approac...
Stephan Frank, Petra Hofstedt, Peter Pepper, Dirk ...
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...