M. Codish

Peter Schneider-Kamp, Luís Cruz-Filipe, Michael Codish, 2014, 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

Compiling finite domain constraints to SAT with BEE* pdf

Michael Codish, Yoav Fekete, Amit Metodi, 2012, Theory and Practice of Logic Programming.

Pairwise Networks are Superior for Selection

Michael Codish, Moshe Zazon-Ivry, M. Codish, 2012 .

Optimal Base Encodings for Pseudo-Boolean Constraints

Peter Schneider-Kamp, Carsten Fuhs, Michael Codish, 2010, TACAS.

Pairwise Cardinality Networks

Michael Codish, Moshe Zazon-Ivry, M. Codish, 2010, LPAR.

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

Michael Frank, Michael Codish, Amit Metodi, 2017, ICLP.

Meta-circular Abstract Interpretation in Prolog

Michael Codish, Harald Søndergaard, M. Codish, 2002, The Essence of Computation.

Worst-case groundness analysis using definite Boolean functions

Samir Genaim, Jacob M. Howe, Michael Codish, 2001, Theory and Practice of Logic Programming.

A simple polynomial groundness analysis for logic programs

Andy King, Michael Codish, Andy Heaton, 2000, J. Log. Program..

Worst-Case Groundness Analysis Using Positive Boolean Functions

Michael Codish, M. Codish, 1999, J. Log. Program..

Oracle Semantics for Prolog

Michael J. Maher, Roberto Barbuti, Roberto Giacobazzi, 1992, Inf. Comput..

Modelling Prolog control

Roberto Barbuti, Roberto Giacobazzi, Giorgio Levi, 1992, POPL '92.

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs

M. Codish, Avraham Itzhakov, 2022, Constraints.

Incremental Symmetry Breaking Constraints for Graph Search Problems

Michael Codish, Avraham Itzhakov, M. Codish, 2020, AAAI.

Constraints for symmetry breaking in graph representation

Peter J. Stuckey, Patrick Prosser, Michael Codish, 2018, Constraints.

Breaking Symmetries with Lex Implications

Peter J. Stuckey, Michael Codish, Graeme Gange, 2018, FLOPS.

Breaking Symmetries in Graphs: The Nauty Way

Peter J. Stuckey, Michael Codish, Graeme Gange, 2016, CP.

Breaking symmetries in graph search with canonizing sets

Michael Codish, Avraham Itzhakov, M. Codish, 2016, Constraints.

Breaking Symmetries in Graph Representation

Peter J. Stuckey, Patrick Prosser, Michael Codish, 2013, IJCAI.

An Algebraic Approach to Sharing Analysis of Logic Programs

Michael Codish, Vitaly Lagoon, Francisco Bueno, 1997, SAS.

On the Design of a Correct Freeness Analysis for Logic Programs

Gilberto Filé, Maurice Bruynooghe, Michael Codish, 1995, J. Log. Program..

Freeness Analysis in the Presence of Numerical Constraints

Gerda Janssens, Maurice Bruynooghe, Veroniek Dumortier, 1993, ICLP.

Efficient Goal Directed Bottom-up Evaluation of Logic Programs

Michael Codish, M. Codish, 1999, ICLP.

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

Maurice Bruynooghe, Michael Codish, Anne Mulkers, 1995, Computer Science Today.

Propagation via lazy clause generation

Peter J. Stuckey, Michael Codish, Olga Ohrimenko, 2009, Constraints.

Proving Termination One Loop at a Time

Samir Genaim, Michael Codish, S. Genaim, 2003, WLPE.

Suspension analyses for concurrent logic programs

Kim Marriott, Michael Codish, Moreno Falaschi, 1994, TOPL.

Bottum-up abstract interpretation of logic programs

Michael Codish, Dennis Dams, Eyal Yardeni, 1992 .

Proving Implications by Algebraic Approximation

Michael Codish, Grigory Mashevitzky, M. Codish, 1994, ALP.

Goal Dependent versus Goal Independent Analysis of Logic Programs

Maurice Bruynooghe, Manuel V. Hermenegildo, Michael Codish, 1994, LPAR.

Freeness, Sharing, Linearity and Correctness - All at Once

Maurice Bruynooghe, Michael Codish, M. Codish, 1993, WSA.

Freeness Analysis for Logic Programs - And Correctness?

Gilberto Filé, Maurice Bruynooghe, Michael Codish, 1993, ICLP.

Improving abstract interpretations by combining domains

M. Codish, M. Hermenegildo, M. Bruynooghe, 1995, TOPL.

Goal Dependent vs . Goal Independent Analysis of Logic Programs

M. Codish, M. Hermenegildo, M. Bruynooghe, 1994 .

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

Michael Codish, Dennis Dams, Eyal Yardeni, 1991, ICLP.

Exploiting Goal Independence in the Analysis of Logic Programs

Maurice Bruynooghe, Manuel V. Hermenegildo, Michael Codish, 1997, J. Log. Program..

Improving abstract interpretations by combining domains

Maurice Bruynooghe, Manuel V. Hermenegildo, Michael Codish, 1993, PEPM '93.

Efficient Analysis of Concurrent Constraint Logic Programs

Kim Marriott, Michael Codish, William H. Winsborough, 1993, ICALP.

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

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2012, Journal of Automated Reasoning.

Lazy Abstraction for Size-Change Termination

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2010, LPAR.

Proving Termination Using Recursive Path Orders and SAT Solving

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2007, FroCoS.

SAT Solving for Argument Filterings

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2006, LPAR.

Solving Partial Order Constraints for LPO Termination

Peter J. Stuckey, Michael Codish, Vitaly Lagoon, 2005, J. Satisf. Boolean Model. Comput..

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

Bart Demoen, Michael Codish, M. Codish, 1994, SAS.

Simplifying Pseudo-Boolean Constraints in Residual Number Systems

Michael Codish, Yoav Fekete, M. Codish, 2014, SAT.

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

Bart Demoen, Michael Codish, M. Codish, 1993, ILPS.

Compositional analysis of modular logic programs

Roberto Giacobazzi, Saumya K. Debray, Michael Codish, 1993, POPL '93.

A Semantic Basis for the Termination Analysis of Logic Programs

Michael Codish, Cohavit Taboch, M. Codish, 1999, J. Log. Program..

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

Kim Marriott, Michael Codish, William H. Winsborough, 1997, J. Log. Program..

Pos(T): Analyzing Dependencies in Typed Logic Programs

Wim Vanhoof, Maurice Bruynooghe, Michael Codish, 2001, Ershov Memorial Conference.

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

Michael Frank, Michael Codish, Vitaly Lagoon, 2017, IJCAI.

Compiling OR-parallelism into AND-parallelism

Michael Codish, Ehud Shapiro, E. Shapiro, 1986, New Generation Computing.

Reuse of Results in Termination Analysis of Typed Logic Programs

Wim Vanhoof, Maurice Bruynooghe, Samir Genaim, 2002, SAS.

Inferring termination conditions for logic programs using backwards analysis

Samir Genaim, Michael Codish, S. Genaim, 2001, Theory and Practice of Logic Programming.

Type Dependencies for Logic Programs Using ACI-Unification

Michael Codish, Vitaly Lagoon, M. Codish, 2000, ISTCS.

Top-down vs bottom-up analysis of logic programs - closing the circle

Maurice Bruynooghe, Manuel V. Hermenegildo, Michael Codish, 1993 .

Breaking symmetries in graph search with canonizing sets

M. Codish, Avraham Itzhakov, 2015, Constraints.

Exotic Semi-Ring Constraints

Jürgen Giesl, Carsten Fuhs, Michael Codish, 2013, SMT@IJCAR.

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

John P. Gallagher, Wim Vanhoof, Maurice Bruynooghe, 2007, TOPL.