activity
20032018
most citedTwenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten)

39 citations · 161 across the 21 of their papers we have counts for

collaborators
Showing cs.LOShow all

2 papers · 1 filter

cs.LO2012

Compiling Finite Domain Constraints to SAT with BEE

Amit Metodi, Michael Codish

We present BEE, a compiler which enables to encode finite domain constraint problems to CNF. Using BEE both eases the encoding process for the user and also performs transformation…

cs.LO2006★ 3 cited

SAT Solving for Argument Filterings

Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon +2

This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for termination an…