default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Codish
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c73]Mikolás Janota, Choiwah Chow
, João Araújo, Michael Codish, Petr Vojtechovský:
SAT-Based Techniques for Lexicographically Smallest Finite Models. AAAI 2024: 8048-8056- 2023
- [c72]Avraham Itzhakov, Michael Codish:
Breaking Symmetries with High Dimensional Graph Invariants and Their Combination. CPAIOR 2023: 133-149 - 2022
- [j43]Avraham Itzhakov, Michael Codish:
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs. Constraints An Int. J. 27(1-2): 8-28 (2022) - 2020
- [c71]Avraham Itzhakov, Michael Codish:
Incremental Symmetry Breaking Constraints for Graph Search Problems. AAAI 2020: 1536-1543
2010 – 2019
- 2019
- [j42]Michael Codish, Alice Miller, Patrick Prosser, Peter J. Stuckey:
Constraints for symmetry breaking in graph representation. Constraints An Int. J. 24(1): 1-24 (2019) - [j41]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: 184-201 (2019) - 2018
- [c70]Michael Codish, Thorsten Ehlers, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey:
Breaking Symmetries with Lex Implications. FLOPS 2018: 182-197 - [c69]Morad Muslimany, Michael Codish:
SAT-Based Big-Step Local Search. SYNASC 2018: 109-116 - [i23]Michael Codish:
A SAT Encoding for the n-Fractions Problem. CoRR abs/1807.00507 (2018) - 2017
- [j40]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Optimizing sorting algorithms by using sorting networks. Formal Aspects Comput. 29(3): 559-579 (2017) - [j39]Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný:
Optimal-depth sorting networks. J. Comput. Syst. Sci. 84: 185-204 (2017) - [c68]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: 5:1-5:18 - [c67]Michael Codish, Michael Frank, Vitaly Lagoon:
The DNA Word Design Problem: A New Constraint Model and New Results. IJCAI 2017: 585-591 - 2016
- [j38]Avraham Itzhakov, Michael Codish:
Breaking symmetries in graph search with canonizing sets. Constraints An Int. J. 21(3): 357-374 (2016) - [j37]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): 375-393 (2016) - [j36]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
Sorting nine inputs requires twenty-five comparisons. J. Comput. Syst. Sci. 82(3): 551-563 (2016) - [j35]Michael Codish, Eijiro Sumii:
Preface for special section from FLOPS 2014. J. Funct. Program. 26: e14 (2016) - [j34]Michael Frank, Michael Codish:
Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description). Theory Pract. Log. Program. 16(5-6): 688-702 (2016) - [c66]Michael Codish, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey:
Breaking Symmetries in Graphs: The Nauty Way. CP 2016: 157-172 - [i22]Michael Frank, Michael Codish:
Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper). CoRR abs/1607.04829 (2016) - 2015
- [c65]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
Sorting Networks: The End Game. LATA 2015: 664-675 - [c64]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. LOPSTR 2015: 127-142 - [i21]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. CoRR abs/1505.01962 (2015) - [i20]Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp:
Sorting Networks: to the End and Back Again. CoRR abs/1507.01428 (2015) - [i19]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
When Six Gates are Not Enough. CoRR abs/1508.05737 (2015) - [i18]Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller:
Computing the Ramsey Number R(4, 3, 3) using Abstraction and Symmetry breaking. CoRR abs/1510.08266 (2015) - [i17]Avraham Itzhakov, Michael Codish:
Breaking Symmetries in Graph Search with Canonizing Sets. CoRR abs/1511.08205 (2015) - 2014
- [j33]Amit Metodi, Roni Stern, Meir Kalech, Michael Codish:
A Novel SAT-Based Approach to Model Based Diagnosis. J. Artif. Intell. Res. 51: 377-411 (2014) - [c63]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: 186-193 - [c62]Yoav Fekete, Michael Codish:
Simplifying Pseudo-Boolean Constraints in Residual Number Systems. SAT 2014: 351-366 - [c61]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. SYNASC 2014: 359-366 - [e1]Michael Codish, Eijiro Sumii:
Functional and Logic Programming - 12th International Symposium, FLOPS 2014, Kanazawa, Japan, June 4-6, 2014. Proceedings. Lecture Notes in Computer Science 8475, Springer 2014, ISBN 978-3-319-07150-3 [contents] - [i16]Amit Metodi, Michael Codish, Peter James Stuckey:
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems. CoRR abs/1402.0568 (2014) - [i15]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. CoRR abs/1404.0948 (2014) - [i14]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 abs/1405.5754 (2014) - [i13]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 abs/1409.5189 (2014) - [i12]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
Sorting Networks: the End Game. CoRR abs/1411.6408 (2014) - [i11]Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný:
Optimal-Depth Sorting Networks. CoRR abs/1412.5302 (2014) - 2013
- [j32]Amit Metodi, Michael Codish, Peter J. Stuckey:
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems. J. Artif. Intell. Res. 46: 303-341 (2013) - [c60]Michael Codish, Yoav Fekete, Amit Metodi:
Backbones for Equality. Haifa Verification Conference 2013: 1-14 - [c59]Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey:
Breaking Symmetries in Graph Representation. IJCAI 2013: 510-516 - [i10]Michael Codish, Yoav Fekete, Amit Metodi:
Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut. CoRR abs/1308.3937 (2013) - 2012
- [j31]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): 53-93 (2012) - [j30]Amit Metodi, Michael Codish:
Compiling finite domain constraints to SAT with BEE. Theory Pract. Log. Program. 12(4-5): 465-483 (2012) - [c58]Amit Metodi, Roni Stern, Meir Kalech, Michael Codish:
Compiling Model-Based Diagnosis to Boolean Satisfaction. AAAI 2012: 793-799 - [c57]Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann:
Exotic Semi-Ring Constraints. SMT@IJCAR 2012: 88-97 - [c56]Michael Codish:
Programming with Boolean Satisfaction. FLOPS 2012: 1 - [i9]Amit Metodi, Michael Codish:
Compiling Finite Domain Constraints to SAT with BEE. CoRR abs/1206.3883 (2012) - 2011
- [j29]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): 503-520 (2011) - [c55]Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Boolean Equi-propagation for Optimized SAT Encoding. CP 2011: 621-636 - [c54]Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp:
Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS 2011: 189-204 - [i8]Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Boolean Equi-propagation for Optimized SAT Encoding. CoRR abs/1104.4617 (2011) - [i7]Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl:
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers. CoRR abs/1107.5980 (2011) - 2010
- [c53]Michael Codish, Moshe Zazon-Ivry:
Pairwise Cardinality Networks. LPAR (Dakar) 2010: 154-172 - [c52]Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp:
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232 - [i6]Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp:
Optimal Base Encodings for Pseudo-Boolean Constraints. CoRR abs/1007.4935 (2010)
2000 – 2009
- 2009
- [j28]Olga Ohrimenko, Peter J. Stuckey, Michael Codish:
Propagation via lazy clause generation. Constraints An Int. J. 14(3): 357-391 (2009) - [c51]Michael Codish, Samir Genaim, Peter J. Stuckey:
A declarative encoding of telecommunications feature subscription in SAT. PPDP 2009: 255-266 - 2008
- [j27]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. J. Satisf. Boolean Model. Comput. 5(1-4): 193-215 (2008) - [j26]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Logic programming with satisfiability. Theory Pract. Log. Program. 8(1): 121-128 (2008) - [c50]Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini:
Termination Analysis of Java Bytecode. FMOODS 2008: 2-18 - [c49]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Telecommunications Feature Subscription as a Partial Order Constraint Problem. ICLP 2008: 749-753 - [c48]Amir M. Ben-Amram, Michael Codish:
A SAT-Based Approach to Size Change Termination with Global Ranking Functions. TACAS 2008: 218-232 - 2007
- [j25]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): 10 (2007) - [c47]Olga Ohrimenko, Peter J. Stuckey, Michael Codish:
Propagation = Lazy Clause Generation. CP 2007: 544-558 - [c46]Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl:
Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS 2007: 267-282 - [c45]Michael Codish:
Proving Termination with (Boolean) Satisfaction. LOPSTR 2007: 1-7 - [i5]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 - [i4]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Logic Programming with Satisfiability. CoRR abs/cs/0702072 (2007) - 2006
- [c44]Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey:
Size-Change Termination Analysis in k-Bits. ESOP 2006: 230-245 - [c43]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. LPAR 2006: 30-44 - [c42]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. RTA 2006: 4-18 - [i3]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006) - 2005
- [j24]Samir Genaim, Michael Codish:
Inferring Termination Conditions for Logic Programs using Backwards Analysis. Theory Pract. Log. Program. 5(1-2): 75-91 (2005) - [c41]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Testing for Termination with Monotonicity Constraints. ICLP 2005: 326-340 - [i2]Michael Codish, Vitaly Lagoon, Peter J. Stuckey:
Solving Partial Order Constraints for LPO Termination. CoRR abs/cs/0512067 (2005) - 2003
- [c40]Michael Codish, Samir Genaim:
Proving Termination One Loop at a Time. WLPE 2003: 48-59 - [i1]Samir Genaim, Michael Codish:
Inferring Termination Conditions for Logic Programs using Backwards Analysis. CoRR cs.PL/0312023 (2003) - 2002
- [c39]Michael Codish, Harald Søndergaard:
Meta-circular Abstract Interpretation in Prolog. The Essence of Computation 2002: 109-134 - [c38]Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof:
Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492 - [c37]Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon:
Combining Norms to Prove Termination. VMCAI 2002: 126-138 - 2001
- [j23]Samir Genaim, Jacob M. Howe, Michael Codish:
Worst-case groundness analysis using definite boolean functions. Theory Pract. Log. Program. 1(5): 611-615 (2001) - [c36]Samir Genaim, Michael Codish:
Inferring termination conditions for logic programs using backwards analysis. APPIA-GULP-PRODE 2001: 229-243 - [c35]Maurice Bruynooghe, Wim Vanhoof, Michael Codish:
Pos(T): Analyzing Dependencies in Typed Logic Programs. Ershov Memorial Conference 2001: 406-420 - [c34]Samir Genaim, Michael Codish:
The Def-inite Approach to Dependency Analysis. ESOP 2001: 417-432 - [c33]Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey:
Higher-Precision Groundness Analysis. ICLP 2001: 135-149 - [c32]Samir Genaim, Michael Codish:
Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR 2001: 685-694 - 2000
- [j22]Michael Codish, Vitaly Lagoon, Francisco Bueno:
An Algebraic Approach to Sharing Analysis of Logic Programs. J. Log. Program. 42(2): 111-149 (2000) - [j21]Michael Codish, Kim Marriott, Cohavit Taboch:
Improving Program Analyses, by Structure Untupling. J. Log. Program. 43(3): 251-263 (2000) - [j20]Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King:
A simple polynomial groundness analysis for logic programs. J. Log. Program. 45(1-3): 143-156 (2000) - [j19]Michael Codish, Vitaly Lagoon:
Type dependencies for logic programs using ACI-unification. Theor. Comput. Sci. 238(1-2): 131-159 (2000)
1990 – 1999
- 1999
- [j18]Michael Codish:
Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. J. Log. Program. 38(3): 355-370 (1999) - [j17]Michael Codish, Cohavit Taboch:
A Semantic Basis for the Termination Analysis of Logic Programs. J. Log. Program. 41(1): 103-123 (1999) - [j16]Michael Codish:
Worst-Case Groundness Analysis Using Positive Boolean Functions. J. Log. Program. 41(1): 125-128 (1999) - [j15]Michael Codish, Harald Søndergaard, Peter J. Stuckey:
Sharing and groundness dependencies in logic programs. ACM Trans. Program. Lang. Syst. 21(5): 948-976 (1999) - 1998
- [j14]Michael Codish, Bart Demoen, Konstantinos Sagonas:
Semantics-Based Program Analysis for Logic-Based Languages Using XSB. Int. J. Softw. Tools Technol. Transf. 2(1): 29-45 (1998) - [c31]Michael Codish, Harald Søndergaard:
The Boolean Logic of Set Sharing Analysis. PLILP/ALP 1998: 89-101 - 1997
- [j13]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): 53-81 (1997) - [j12]Michael Codish, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo:
Exploiting Goal Independence in the Analysis of Logic Programs. J. Log. Program. 32(3): 247-261 (1997) - [c30]Michael Codish, Cohavit Taboch:
A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints. APPIA-GULP-PRODE 1997: 545-556 - [c29]Michael Codish, Cohavit Taboch:
A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. ALP/HOA 1997: 31-45 - [c28]Michael Codish, Bart Demoen, Konstantinos Sagonas:
XSB as the Natural Habitat for General Purpose Program Analysis. ICLP 1997: 416 - [c27]Francisco Bueno, Michael Codish, Vitaly Lagoon:
Sharing Analysis Using Set Logic Programs. ICLP 1997: 417 - [c26]Michael Codish:
Efficient Goal Directed Bottom-up Evaluation of Logic Programs. ICLP 1997: 422 - [c25]Michael Codish, Vitaly Lagoon, Francisco Bueno:
An Algebraic Approach to Sharing Analysis of Logic Programs. SAS 1997: 68-82 - 1996
- [j11]Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe:
On the Design of a Correct Freeness Analysis for Logic Programs. J. Log. Program. 28(3): 181-206 (1996) - [j10]Michael Codish, Grigory Mashevitzky:
Proving Implications by Algebraic Approximation. Theor. Comput. Sci. 165(1): 57-74 (1996) - [c24]Michael Codish, Vitaly Lagoon, Francisco Bueno:
Sharing Analysis for Logic Programs using Set Logic Programs. APPIA-GULP-PRODE 1996: 29-40 - [c23]Michael Codish, Vitaly Lagoon:
Type Dependencies for Logic Programs Using ACI-Unification. ISTCS 1996: 136-145 - 1995
- [j9]Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher:
Oracle Semantics for Prolog. Inf. Comput. 122(2): 178-200 (1995) - [j8]Michael Codish, Bart Demoen:
Analyzing Logic Programs Using "PROP"-ositional Logic Programs and a Magic Wand. J. Log. Program. 25(3): 249-274 (1995) - [j7]Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo:
Improving Abstract Interpretations by Combining Domains. ACM Trans. Program. Lang. Syst. 17(1): 28-44 (1995) - [p1]Maurice Bruynooghe, Michael Codish, Anne Mulkers:
Abstracting Unification: A Key Step in the Design of Logic Program Analyses. Computer Science Today 1995: 406-425 - 1994
- [j6]Michael Codish, Dennis Dams, Eyal Yardeni:
Bottom-up Abstract Interpretation of Logic Programs. Theor. Comput. Sci. 124(1): 93-125 (1994) - [j5]Michael Codish, Moreno Falaschi, Kim Marriott:
Suspension Analyses for Concurrent Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 649-686 (1994) - [c22]Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop. GULP-PRODE (1) 1994: 327-341 - [c21]Michael Codish, Grigory Mashevitzky:
Proving Implications by Algebraic Approximation. ALP 1994: 6-22 - [c20]Maurice Bruynooghe, Michael Codish, Anne Mulkers:
Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - [c19]Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - [c18]Michael Codish, Maria J. García de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo:
Goal Dependent versus Goal Independent Analysis of Logic Programs. LPAR 1994: 305-319 - [c17]Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. SAS 1994: 281-296 - 1993
- [j4]Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi:
Modelling Prolog Control. J. Log. Comput. 3(6): 579-603 (1993) - [c16]Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough:
Efficient Analysis of Concurrent Constraint Logic Programs. ICALP 1993: 633-644 - [c15]Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish:
Freeness Analysis in the Presence of Numerical Constraints. ICLP 1993: 100-115 - [c14]Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe:
Freeness Analysis for Logic Programs - And Correctness? ICLP 1993: 116-131 - [c13]