Michael Codish

ORCID

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 20

Top Venues

CoRR

Constraints An Int. J.

J. Comput. Syst. Sci.

SYNASC

Publications

Mikolás Janota, Choiwah Chow, João Araújo, Michael Codish, Petr Vojtechovský
SAT-Based Techniques for Lexicographically Smallest Finite Models. AAAI (2024)
Avraham Itzhakov, Michael Codish
Breaking Symmetries with High Dimensional Graph Invariants and Their Combination. CPAIOR (2023)
Avraham Itzhakov, Michael Codish
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs. Constraints An Int. J. 27 (1-2) (2022)
Avraham Itzhakov, Michael Codish
Incremental Symmetry Breaking Constraints for Graph Search Problems. AAAI (2020)
Michael Codish, Alice Miller, Patrick Prosser, Peter J. Stuckey
Constraints for symmetry breaking in graph representation. Constraints An Int. J. 24 (1) (2019)
Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp
Sorting networks: To the end and back again. J. Comput. Syst. Sci. 104 (2019)
Michael Codish
A SAT Encoding for the n-Fractions Problem. CoRR (2018)
Morad Muslimany, Michael Codish
SAT-Based Big-Step Local Search. SYNASC (2018)
Michael Codish, Thorsten Ehlers, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey
Breaking Symmetries with Lex Implications. FLOPS (2018)
Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp
Optimizing sorting algorithms by using sorting networks. Formal Aspects Comput. 29 (3) (2017)
Michael Codish, Michael Frank, Vitaly Lagoon
The DNA Word Design Problem: A New Constraint Model and New Results. IJCAI (2017)
Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany
Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). ICLP (Technical Communications) (2017)
Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný
Optimal-depth sorting networks. J. Comput. Syst. Sci. 84 (2017)
Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
Sorting nine inputs requires twenty-five comparisons. J. Comput. Syst. Sci. 82 (3) (2016)
Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking. Constraints An Int. J. 21 (3) (2016)
Avraham Itzhakov, Michael Codish
Breaking symmetries in graph search with canonizing sets. Constraints An Int. J. 21 (3) (2016)
Michael Codish, Eijiro Sumii
Preface for special section from FLOPS 2014. J. Funct. Program. 26 (2016)
Michael Frank, Michael Codish
Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper). CoRR (2016)
Michael Codish, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey
Breaking Symmetries in Graphs: The Nauty Way. CP (2016)
Michael Frank, Michael Codish
Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description). Theory Pract. Log. Program. 16 (5-6) (2016)
Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
When Six Gates are Not Enough. CoRR (2015)
Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
Sorting Networks: The End Game. LATA (2015)
Avraham Itzhakov, Michael Codish
Breaking Symmetries in Graph Search with Canonizing Sets. CoRR (2015)
Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
Computing the Ramsey Number R(4, 3, 3) using Abstraction and Symmetry breaking. CoRR (2015)
Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. CoRR (2015)
Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp
Sorting Networks: to the End and Back Again. CoRR (2015)
Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. LOPSTR (2015)
Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten). CoRR (2014)
Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. SYNASC (2014)
Amit Metodi, Roni Stern, Meir Kalech, Michael Codish
A Novel SAT-Based Approach to Model Based Diagnosis. J. Artif. Intell. Res. 51 (2014)
Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). ICTAI (2014)
Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
Sorting Networks: the End Game. CoRR (2014)
Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3)=30. CoRR (2014)
Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný
Optimal-Depth Sorting Networks. CoRR (2014)
Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. CoRR (2014)
Yoav Fekete, Michael Codish
Simplifying Pseudo-Boolean Constraints in Residual Number Systems. SAT (2014)
Amit Metodi, Michael Codish, Peter James Stuckey
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems. CoRR (2014)
Michael Codish, Yoav Fekete, Amit Metodi
Backbones for Equality. Haifa Verification Conference (2013)
Amit Metodi, Michael Codish, Peter J. Stuckey
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems. J. Artif. Intell. Res. 46 (2013)
Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey
Breaking Symmetries in Graph Representation. IJCAI (2013)
Michael Codish, Yoav Fekete, Amit Metodi
Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut. CoRR (2013)
Amit Metodi, Michael Codish
Compiling finite domain constraints to SAT with BEE. Theory Pract. Log. Program. 12 (4-5) (2012)
Michael Codish
Programming with Boolean Satisfaction. FLOPS (2012)
Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reason. 49 (1) (2012)
Amit Metodi, Roni Stern, Meir Kalech, Michael Codish
Compiling Model-Based Diagnosis to Boolean Satisfaction. AAAI (2012)
Amit Metodi, Michael Codish
Compiling Finite Domain Constraints to SAT with BEE CoRR (2012)
Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann
Exotic Semi-Ring Constraints. SMT@IJCAR (2012)
Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS (2011)
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
SAT-based termination analysis using monotonicity constraints over the integers. Theory Pract. Log. Program. 11 (4-5) (2011)
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers CoRR (2011)
Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Boolean Equi-propagation for Optimized SAT Encoding CoRR (2011)
Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Boolean Equi-propagation for Optimized SAT Encoding. CP (2011)
Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) (2010)
Michael Codish, Moshe Zazon-Ivry
Pairwise Cardinality Networks. LPAR (Dakar) (2010)
Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
Optimal Base Encodings for Pseudo-Boolean Constraints CoRR (2010)
Michael Codish, Samir Genaim, Peter J. Stuckey
A declarative encoding of telecommunications feature subscription in SAT. PPDP (2009)
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
Propagation via lazy clause generation. Constraints An Int. J. 14 (3) (2009)
Amir M. Ben-Amram, Michael Codish
A SAT-Based Approach to Size Change Termination with Global Ranking Functions. TACAS (2008)
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Solving Partial Order Constraints for LPO Termination. J. Satisf. Boolean Model. Comput. 5 (1-4) (2008)
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Telecommunications Feature Subscription as a Partial Order Constraint Problem. ICLP (2008)
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Logic programming with satisfiability. Theory Pract. Log. Program. 8 (1) (2008)
Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini
Termination Analysis of Java Bytecode. FMOODS (2008)
Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof
Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst. 29 (2) (2007)
Michael Codish
Proving Termination with (Boolean) Satisfaction. LOPSTR (2007)
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
Propagation = Lazy Clause Generation. CP (2007)
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Logic Programming with Satisfiability CoRR (2007)
Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl
Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS (2007)
Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl
Implementing RPO and POLO using SAT. Deduction and Decision Procedures (2007)
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
SAT Solving for Argument Filterings CoRR (2006)
Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey
-Bits. ESOP (2006)
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Solving Partial Order Constraints for LPO Termination. RTA (2006)
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
SAT Solving for Argument Filterings. LPAR (2006)
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Solving Partial Order Constraints for LPO Termination CoRR (2005)
Samir Genaim, Michael Codish
Inferring Termination Conditions for Logic Programs using Backwards Analysis. Theory Pract. Log. Program. 5 (1-2) (2005)
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
Testing for Termination with Monotonicity Constraints. ICLP (2005)
Michael Codish, Samir Genaim
Proving Termination One Loop at a Time. WLPE (2003)
Samir Genaim, Michael Codish
Inferring Termination Conditions for Logic Programs using Backwards Analysis CoRR (2003)
Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof
Reuse of Results in Termination Analysis of Typed Logic Programs. SAS (2002)
Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon
Combining Norms to Prove Termination. VMCAI (2002)
Michael Codish, Harald Søndergaard
Meta-circular Abstract Interpretation in Prolog. The Essence of Computation (2002)
Maurice Bruynooghe, Wim Vanhoof, Michael Codish
Pos(T): Analyzing Dependencies in Typed Logic Programs. Ershov Memorial Conference (2001)
Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey
Higher-Precision Groundness Analysis. ICLP (2001)
Samir Genaim, Michael Codish
The Def-inite Approach to Dependency Analysis. ESOP (2001)
Samir Genaim, Michael Codish
Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR (2001)
Samir Genaim, Michael Codish
Inferring termination conditions for logic programs using backwards analysis. APPIA-GULP-PRODE (2001)
Samir Genaim, Jacob M. Howe, Michael Codish
Worst-case groundness analysis using definite boolean functions. Theory Pract. Log. Program. 1 (5) (2001)
Michael Codish, Vitaly Lagoon
Type dependencies for logic programs using ACI-unification. Theor. Comput. Sci. 238 (1-2) (2000)
Michael Codish, Vitaly Lagoon, Francisco Bueno
An Algebraic Approach to Sharing Analysis of Logic Programs. J. Log. Program. 42 (2) (2000)
Michael Codish, Kim Marriott, Cohavit Taboch
Improving Program Analyses, by Structure Untupling. J. Log. Program. 43 (3) (2000)
Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King
A simple polynomial groundness analysis for logic programs. J. Log. Program. 45 (1-3) (2000)
Michael Codish, Cohavit Taboch
A Semantic Basis for the Termination Analysis of Logic Programs. J. Log. Program. 41 (1) (1999)
Michael Codish
Worst-Case Groundness Analysis Using Positive Boolean Functions. J. Log. Program. 41 (1) (1999)
Michael Codish
Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. J. Log. Program. 38 (3) (1999)
Michael Codish, Harald Søndergaard, Peter J. Stuckey
Sharing and groundness dependencies in logic programs. ACM Trans. Program. Lang. Syst. 21 (5) (1999)
Michael Codish, Harald Søndergaard
The Boolean Logic of Set Sharing Analysis. PLILP/ALP (1998)
Michael Codish, Bart Demoen, Konstantinos Sagonas
Semantics-Based Program Analysis for Logic-Based Languages Using XSB. Int. J. Softw. Tools Technol. Transf. 2 (1) (1998)
Michael Codish, Vitaly Lagoon, Francisco Bueno
An Algebraic Approach to Sharing Analysis of Logic Programs. SAS (1997)
Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs. J. Log. Program. 30 (1) (1997)
Francisco Bueno, Michael Codish, Vitaly Lagoon
Sharing Analysis Using Set Logic Programs. ICLP (1997)
Michael Codish, Cohavit Taboch
A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. ALP/HOA (1997)

Michael Codish.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Codish