Michael Codish

According to our database, Michael Codish authored at least 109 papers between 1986 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

SAT-Based Techniques for Lexicographically Smallest Finite Models.

Mikolás Janota, Choiwah Chow, João Araújo, Michael Codish, Petr Vojtechovský

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Breaking Symmetries with High Dimensional Graph Invariants and Their Combination.

Avraham Itzhakov, Michael Codish

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs.

Avraham Itzhakov, Michael Codish

Constraints An Int. J., 2022

2020

Incremental Symmetry Breaking Constraints for Graph Search Problems.

Avraham Itzhakov, Michael Codish

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Sorting networks: To the end and back again.

Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp

J. Comput. Syst. Sci., 2019

Constraints for symmetry breaking in graph representation.

Michael Codish, Alice Miller, Patrick Prosser, Peter J. Stuckey

Constraints An Int. J., 2019

2018

A SAT Encoding for the n-Fractions Problem.

Michael Codish

CoRR, 2018

SAT-Based Big-Step Local Search.

Morad Muslimany, Michael Codish

Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018

Breaking Symmetries with Lex Implications.

Michael Codish, Thorsten Ehlers, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey

Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

2017

Optimal-depth sorting networks.

Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný

J. Comput. Syst. Sci., 2017

Optimizing sorting algorithms by using sorting networks.

Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp

Formal Aspects Comput., 2017

The DNA Word Design Problem: A New Constraint Model and New Results.

Michael Codish, Michael Frank, Vitaly Lagoon

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description).

Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany

Proceedings of the Technical Communications of the 33rd International Conference on Logic Programming, 2017

2016

Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description).

Michael Frank, Michael Codish

Theory Pract. Log. Program., 2016

Preface for special section from FLOPS 2014.

Michael Codish, Eijiro Sumii

J. Funct. Program., 2016

Sorting nine inputs requires twenty-five comparisons.

Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp

J. Comput. Syst. Sci., 2016

Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper).

Michael Frank, Michael Codish

CoRR, 2016

Breaking symmetries in graph search with canonizing sets.

Avraham Itzhakov, Michael Codish

Constraints An Int. J., 2016

Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking.

Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller

Constraints An Int. J., 2016

Breaking Symmetries in Graphs: The Nauty Way.

Michael Codish, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

When Six Gates are Not Enough.

Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp

CoRR, 2015

Applying Sorting Networks to Synthesize Optimized Sorting Libraries.

Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp

Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

Sorting Networks: The End Game.

Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp

Proceedings of the Language and Automata Theory and Applications, 2015

2014

A Novel SAT-Based Approach to Model Based Diagnosis.

Amit Metodi, Roni Stern, Meir Kalech, Michael Codish

J. Artif. Intell. Res., 2014

Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3)=30.

Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller

CoRR, 2014

The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes.

Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp

Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

Simplifying Pseudo-Boolean Constraints in Residual Number Systems.

Yoav Fekete, Michael Codish

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten).

Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013

Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems.

Amit Metodi, Michael Codish, Peter J. Stuckey

J. Artif. Intell. Res., 2013

Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut.

Michael Codish, Yoav Fekete, Amit Metodi

CoRR, 2013

Breaking Symmetries in Graph Representation.

Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey

Proceedings of the IJCAI 2013, 2013

Backbones for Equality.

Michael Codish, Yoav Fekete, Amit Metodi

Proceedings of the Hardware and Software: Verification and Testing, 2013

2012

Compiling finite domain constraints to SAT with BEE.

Amit Metodi, Michael Codish

Theory Pract. Log. Program., 2012

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs.

Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann

J. Autom. Reason., 2012

Programming with Boolean Satisfaction.

Michael Codish

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

Exotic Semi-Ring Constraints.

Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann

Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

Compiling Model-Based Diagnosis to Boolean Satisfaction.

Amit Metodi, Roni Stern, Meir Kalech, Michael Codish

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

SAT-based termination analysis using monotonicity constraints over the integers.

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl

Theory Pract. Log. Program., 2011

Optimal Base Encodings for Pseudo-Boolean Constraints.

Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Boolean Equi-propagation for Optimized SAT Encoding.

Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Pairwise Cardinality Networks.

Michael Codish, Moshe Zazon-Ivry

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Lazy Abstraction for Size-Change Termination.

Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Propagation via lazy clause generation.

Olga Ohrimenko, Peter J. Stuckey, Michael Codish

Constraints An Int. J., 2009

A declarative encoding of telecommunications feature subscription in SAT.

Michael Codish, Samir Genaim, Peter J. Stuckey

Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

2008

Logic programming with satisfiability.

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Theory Pract. Log. Program., 2008

Solving Partial Order Constraints for LPO Termination.

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

J. Satisf. Boolean Model. Comput., 2008

A SAT-Based Approach to Size Change Termination with Global Ranking Functions.

Amir M. Ben-Amram, Michael Codish

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Telecommunications Feature Subscription as a Partial Order Constraint Problem.

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Proceedings of the Logic Programming, 24th International Conference, 2008

Termination Analysis of Java Bytecode.

Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini

Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2008

2007

Termination analysis of logic programs through combination of type-based norms.

Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof

ACM Trans. Program. Lang. Syst., 2007

Proving Termination with (Boolean) Satisfaction.

Michael Codish

Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

Proving Termination Using Recursive Path Orders and SAT Solving.

Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

Implementing RPO and POLO using SAT.

Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Propagation = Lazy Clause Generation.

Olga Ohrimenko, Peter J. Stuckey, Michael Codish

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

SAT Solving for Argument Filterings.

Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl

Proceedings of the Logic for Programming, 2006

Size-Change Termination Analysis in <i>k</i>-Bits.

Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey

Proceedings of the Programming Languages and Systems, 2006

2005

Inferring Termination Conditions for Logic Programs using Backwards Analysis.

Samir Genaim, Michael Codish

Theory Pract. Log. Program., 2005

Testing for Termination with Monotonicity Constraints.

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Proceedings of the Logic Programming, 21st International Conference, 2005

2003

Proving Termination One Loop at a Time.

Michael Codish, Samir Genaim

Proceedings of the 13th International Workshop on Logic Programming Environments, 2003

2002

Combining Norms to Prove Termination.

Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon

Proceedings of the Verification, 2002

Reuse of Results in Termination Analysis of Typed Logic Programs.

Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof

Proceedings of the Static Analysis, 9th International Symposium, 2002

Meta-circular Abstract Interpretation in Prolog.

Michael Codish, Harald Søndergaard

Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001

Worst-case groundness analysis using definite boolean functions.

Samir Genaim, Jacob M. Howe, Michael Codish

Theory Pract. Log. Program., 2001

Higher-Precision Groundness Analysis.

Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey

Proceedings of the Logic Programming, 17th International Conference, 2001

The Def-inite Approach to Dependency Analysis.

Samir Genaim, Michael Codish

Proceedings of the Programming Languages and Systems, 2001

Pos(T): Analyzing Dependencies in Typed Logic Programs.

Maurice Bruynooghe, Wim Vanhoof, Michael Codish

Proceedings of the Perspectives of System Informatics, 2001

2000

Type dependencies for logic programs using ACI-unification.

Michael Codish, Vitaly Lagoon

Theor. Comput. Sci., 2000

A simple polynomial groundness analysis for logic programs.

Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King

J. Log. Program., 2000

Improving Program Analyses, by Structure Untupling.

Michael Codish, Kim Marriott, Cohavit Taboch

J. Log. Program., 2000

An Algebraic Approach to Sharing Analysis of Logic Programs.

Michael Codish, Vitaly Lagoon, Francisco Bueno

J. Log. Program., 2000

1999

Sharing and groundness dependencies in logic programs.

Michael Codish, Harald Søndergaard, Peter J. Stuckey

ACM Trans. Program. Lang. Syst., 1999

A Semantic Basis for the Termination Analysis of Logic Programs.

Michael Codish, Cohavit Taboch

J. Log. Program., 1999

Worst-Case Groundness Analysis Using Positive Boolean Functions.

Michael Codish

J. Log. Program., 1999

Efficient Goal Directed Bottom-Up Evaluation of Logic Programs.

Michael Codish

J. Log. Program., 1999

1998

Semantics-Based Program Analysis for Logic-Based Languages Using XSB.

Michael Codish, Bart Demoen, Konstantinos Sagonas

Int. J. Softw. Tools Technol. Transf., 1998

The Boolean Logic of Set Sharing Analysis.

Michael Codish, Harald Søndergaard

Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

1997

A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs.

Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough

J. Log. Program., 1997

Exploiting Goal Independence in the Analysis of Logic Programs.

Michael Codish, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo

J. Log. Program., 1997

XSB as the Natural Habitat for General Purpose Program Analysis.

Michael Codish, Bart Demoen, Konstantinos Sagonas

Proceedings of the Logic Programming, 1997

Sharing Analysis Using Set Logic Programs.

Francisco Bueno, Michael Codish, Vitaly Lagoon

Proceedings of the Logic Programming, 1997

A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints.

Michael Codish, Cohavit Taboch

Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996

Proving Implications by Algebraic Approximation.

Michael Codish, Grigory Mashevitzky

Theor. Comput. Sci., 1996

On the Design of a Correct Freeness Analysis for Logic Programs.

Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe

J. Log. Program., 1996

Sharing Analysis for Logic Programs using Set Logic Programs.

Michael Codish, Vitaly Lagoon, Francisco Bueno

Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995

Improving Abstract Interpretations by Combining Domains.

Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo

ACM Trans. Program. Lang. Syst., 1995

Analyzing Logic Programs Using "<tt>PROP</tt>"-ositional Logic Programs and a Magic Wand.

Michael Codish, Bart Demoen

J. Log. Program., 1995

Oracle Semantics for Prolog.

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher

Inf. Comput., 1995

Abstracting Unification: A Key Step in the Design of Logic Program Analyses.

Maurice Bruynooghe, Michael Codish, Anne Mulkers

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

Suspension Analyses for Concurrent Logic Programs.

Michael Codish, Moreno Falaschi, Kim Marriott

ACM Trans. Program. Lang. Syst., 1994

Bottom-up Abstract Interpretation of Logic Programs.

Michael Codish, Dennis Dams, Eyal Yardeni

Theor. Comput. Sci., 1994

Goal Dependent versus Goal Independent Analysis of Logic Programs.

Michael Codish, Maria J. García de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo

Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop.

Michael Codish, Bart Demoen

Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994

Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables.

Maurice Bruynooghe, Michael Codish, Anne Mulkers

Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994

1993

Modelling Prolog Control.

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi

J. Log. Comput., 1993

Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand.

Michael Codish, Bart Demoen

Proceedings of the Logic Programming, 1993

Freeness, Sharing, Linearity and Correctness - All at Once.

Maurice Bruynooghe, Michael Codish

Proceedings of the Static Analysis, Third International Workshop, 1993

Compositional Analysis of Modular Logic Programs.

Michael Codish, Saumya K. Debray, Roberto Giacobazzi

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

Freeness Analysis in the Presence of Numerical Constraints.

Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish

Proceedings of the Logic Programming, 1993

Freeness Analysis for Logic Programs - And Correctness?

Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe

Proceedings of the Logic Programming, 1993

Efficient Analysis of Concurrent Constraint Logic Programs.

Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs.

Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough

Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

Modeling Prolog Control.

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi

Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992

1991

Suspension Analysis for Concurrent Logic Programs.

Michael Codish, Moreno Falaschi, Kim Marriott

Proceedings of the Logic Programming, 1991

Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis.

Michael Codish, Dennis Dams, Eyal Yardeni

Proceedings of the Logic Programming, 1991

1988

Specialisation of Prolog and FCP Programs Using Abstract Interpretation.

John P. Gallagher, Michael Codish, Ehud Shapiro

New Gener. Comput., 1988

Using Safe Approximations of Fixed Points for Analysis of Logic Programs.

Michael Codish, John P. Gallagher, Ehud Shapiro

Proceedings of the Meta-Programming in Logic Programming, 1988

Fully Abstract Denotational Semantics for Flat Concurrent Prolog

Rob Gerth, Michael Codish, Yossi Lichtenstein, Ehud Shapiro

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987

Compiling OR-parallelism into AND-parallelism.

Michael Codish, Ehud Shapiro

New Gener. Comput., 1987

1986

Pressing for Parallelism: A Prolog Program made Concurrent.

Leon Sterling, Michael Codish

J. Log. Program., 1986