The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their origina...
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoreti...
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
Sofia Triantafilou, Ioannis Tsamardinos, Ioannis G...
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...