If you made any changes in Pure these will be visible here soon.

Search results

  • Higher-precision groundness analysis

    Codish, M., Genaim, S., Søndergaard, H. & Stuckey, P. J., 1 Jan 2001, Logic Programming - 17th International Conference, ICLP 2001, Proceedings. Codognet, P. (ed.). Springer Verlag, p. 135-149 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2237).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • Implementing RPO and POLO using SAT.

    Schneider-Kamp, P., Fuhs, C., Thiemann, R., Giesl, J., Annov, E., Codish, M., Middeldorp, A. & Zankl, H., 2007.

    Research output: Contribution to conferencePaperpeer-review

  • Improving Abstract Interpretations by Combining Domains

    Codish, M., Mulkers, A., Bruynooghe, M., de la Banda, M. G. & Hermenegildo, M., 1 Jan 1995, In: ACM Transactions on Programming Languages and Systems. 17, 1, p. 28-44 17 p.

    Research output: Contribution to journalArticlepeer-review

    43 Scopus citations
  • Improving Abstract Interpretations by Combining Domains

    Codish, M., Mulkers, A., Bruynooghe, M., Garcia de la Banda, M. & Hermenegildo, M., 1 Jan 1993, Proceedings of the 1993 ACM SIGPLAN Symposium on Partial Evaluation Semantics-Based Program Manipulation. Association for Computing Machinery (ACM), p. 194-205 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    19 Scopus citations
  • Improving program analyses by structure untupling

    Codish, M., Marriott, K. & Taboch, C., 1 Jan 2000, In: Journal of Logic Programming. 43, 3, p. 251-263 13 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    6 Scopus citations
  • Incremental symmetry breaking constraints for graph search problems

    Itzhakov, A. & Codish, M., 1 Jan 2020, AAAI 2020 - 34th AAAI Conference on Artificial Intelligence. AAAI press, p. 1536-1543 8 p. (AAAI 2020 - 34th AAAI Conference on Artificial Intelligence).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Inferring termination conditions for logic programs using backwards analysis

    Genaim, S. & Codish, M., 1 Jan 2001, Logic for Programming, Artificial Intelligence, and Reasoning - 8th International Conference, LPAR 2001, Proceedings. Nieuwenhuis, R. & Voronkov, A. (eds.). Springer Verlag, p. 685-694 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2250).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    21 Scopus citations
  • Inferring termination conditions for logic programs using backwards analysis

    Genaim, S. & Codish, M., 1 Jan 2005, In: Theory and Practice of Logic Programming. 5, 1-2, p. 75-91 17 p.

    Research output: Contribution to journalReview articlepeer-review

    10 Scopus citations
  • Lazy abstraction for size-change termination

    Codish, M., Fuhs, C., Giesl, J. & Schneider-Kamp, P., 1 Jan 2010, Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Proceedings. Fermuller, C. G. (ed.). Springer Verlag, p. 217-232 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6397 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Scopus citations
  • Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description)

    Frank, M. & Codish, M., 1 Sep 2016, In: Theory and Practice of Logic Programming. 16, 5-6, p. 688-702 15 p.

    Research output: Contribution to journalArticlepeer-review

    4 Scopus citations
  • Logic Programming with Graph Automorphism: Integrating nauty with Prolog (a Tool Paper).

    Frank, M. & Codish, M., 2016.

    Research output: Working paper/PreprintPreprint

  • Logic programming with max-clique and its application to graph coloring (tool description)

    Codish, M., Frank, M., Metodi, A. & Muslimany, M., 1 Feb 2018, Technical Communications of the 33rd International Conference on Logic Programming, ICLP 2017. Son, T. C., Mears, C., Rocha, R. & Saeedloei, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 5. (OpenAccess Series in Informatics; vol. 58).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Logic programming with satisfiability

    Codish, M., Lagoon, V. & Stuckey, P. J., 1 Jan 2008, In: Theory and Practice of Logic Programming. 8, 1, p. 121-128 8 p.

    Research output: Contribution to journalArticlepeer-review

    29 Scopus citations
  • Meta-circular abstract interpretation in prolog

    Codish, M. & Søndergaard, H., 1 Jan 2002, The Essence of Computation: Complexity, Analysis, Transformation. Springer Verlag, p. 109-134 26 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2566 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

    11 Scopus citations
  • Modelling prolog control

    Barbuti, R., Codish, M., Giacobazzi, R. & Levi, G., 1 Dec 1993, In: Journal of Logic and Computation. 3, 6, p. 579-603 25 p.

    Research output: Contribution to journalEditorial

    13 Scopus citations
  • Modelling Prolog control

    Barbuti, R., Codish, M., Giacobazzi, R. & Levi, G., 1 Jan 1992, Conference Record of the Annual ACM Symposium on Principles of Programming Languages. Publ by ACM, p. 95-104 10 p. (Conference Record of the Annual ACM Symposium on Principles of Programming Languages).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    13 Scopus citations
  • On the design of a correct freeness analysis for logic programs

    Codish, M., Dams, D., Filé, G. & Bruynooghe, M., 1 Jan 1996, In: Journal of Logic Programming. 28, 3, p. 181-206 26 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    10 Scopus citations
  • Optimal base encodings for Pseudo-Boolean constraints

    Codish, M., Fekete, Y., Fuhs, C. & Schneider-Kamp, P., 4 Apr 2011, Tools and Algorithms for the Construction and Analysis of Systems - 17th Int. Conf., TACAS 2011, Held as Part of the Joint European Conf. on Theory and Practice of Software, ETAPS 2011, Proceedings. p. 189-204 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6605 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    11 Scopus citations
  • Optimal-depth sorting networks

    Bundala, D., Codish, M., Cruz-Filipe, L., Schneider-Kamp, P. & Závodný, J., 1 Mar 2017, In: Journal of Computer and System Sciences. 84, p. 185-204 20 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    10 Scopus citations
  • Optimizing sorting algorithms by using sorting networks

    Codish, M., Cruz-Filipe, L., Nebel, M. & Schneider-Kamp, P., 1 May 2017, In: Formal Aspects of Computing. 29, 3, p. 559-579 21 p.

    Research output: Contribution to journalArticlepeer-review

    4 Scopus citations
  • Oracle semantics for prolog

    Barbuti, R., Codish, M., Giacobazzi, R. & Maher, M., 1 Jan 1992, Algebraic and Logic Programming - 3rd International Conference, Proceedings. Levi, G. & Kirchner, H. (eds.). Springer Verlag, p. 100-114 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 632 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    10 Scopus citations
  • Oracle semantics for prolog

    Barbuti, R., Codish, M., Giacobazzi, R. & Maher, M. J., 1 Nov 1995, In: Information and Computation. 122, 2, p. 178-200 23 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    7 Scopus citations
  • Pairwise cardinality networks

    Codish, M. & Zazon-Ivry, M., 1 Dec 2010, Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Revised Selected Papers. p. 154-172 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6355 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    36 Scopus citations
  • Pos(T ): Analyzing dependencies in typed logic programs

    Bruynooghe, M., Vanhoof, W. & Codish, M., 1 Jan 2001, Perspectives of System Informatics - 4th International Andrei Ershov Memorial Conference, PSI 2001, Revised Papers. Bjørner, D., Broy, M. & Zamulin, Z. (eds.). Springer Verlag, p. 406-420 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2244 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Scopus citations
  • Preface

    Codish, M. & Sumii, E., 1 Jan 2014, Functional and Logic Programming: 12th International Symposium, FLOPS 2014, Proceedings. Codish, M. & Sumii, E. (eds.). Springer, p. VI (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8475).

    Research output: Chapter in Book/Report/Conference proceedingForeword/postscript

  • Preface for special section from FLOPS 2014.

    Codish, M. & Sumii, E., 2016, In: Journal of Functional Programming. 26, p. e14 1 p.

    Research output: Contribution to journalArticle

  • Pressing for parallelism: a PROLOG program made Concurrent

    Sterling, L. & Codish, M., 1 Jan 1986, In: Journal of Logic Programming. 3, 1, p. 75-92 18 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    2 Scopus citations
  • Programming with Boolean Satisfaction

    Codish, M., 2012, Functional and Logic Programming - 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012. Proceedings. Schrijvers, T. & Thiemann, P. (eds.). Springer, Vol. 7294. p. 1 1 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Propagation = Lazy clause generation

    Ohrimenko, O., Stuckey, P. J. & Codish, M., 1 Jan 2007, Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings. Springer Verlag, p. 544-558 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4741 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    36 Scopus citations
  • Propagation via lazy clause generation

    Ohrimenko, O., Stuckey, P. J. & Codish, M., 1 Sep 2009, In: Constraints. 14, 3, p. 357-391 35 p.

    Research output: Contribution to journalArticlepeer-review

    179 Scopus citations
  • Proving implications by algebraic approximation

    Codish, M. & Mashevitzky, G., 1 Jan 1994, Algebraic and Logic Programming - 4th International Conference, ALP 1994, Proceedings. Levi, G. & Rodriguez-Artalejo, M. (eds.). Springer Verlag, p. 6-22 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 850 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • Proving implications by algebraic approximation

    Codish, M. & Mashevitzky, G., 30 Sep 1996, In: Theoretical Computer Science. 165, 1, p. 57-74 18 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
  • Proving Termination One Loop at a Time

    Codish, M. & Genaim, S., 2003, Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003. Mesnard, F. & Serebrenik, A. (eds.). Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium), Vol. CW371. p. 48-59 12 p. (Report).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Proving termination using recursive path orders and SAT solving

    Schneider-Kamp, P., Thiemann, R., Annov, E., Codish, M. & Giesl, J., 1 Jan 2007, Frontiers of Combining Systems - 6th International Symposium, FroCoS 2007, Proceedings. Springer Verlag, p. 267-282 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4720 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    21 Scopus citations
  • Proving termination with (Boolean) satisfaction

    Codish, M., 1 Dec 2008, Logic-Based Program Synthesis and Transformation - 17th International Symposium, LOPSTR 2007, Revised Selected Papers. p. 1-7 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4915 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • Reuse of results in termination analysis of typed logic programs

    Bruynooghe, M., Codish, M., Genaim, S. & Vanhoof, W., 1 Jan 2002, Static Analysis - 9th International Symposium, SAS 2002 Madrid, Spain, September 17-20, 2002 Proceedings. Hermenegildo, M. V. & Puebla, G. (eds.). Springer Verlag, p. 477-492 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2477).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    9 Scopus citations
  • SAT-based big-step local search

    Muslimany, M. & Codish, M., 1 Sep 2018, Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018. Institute of Electrical and Electronics Engineers Inc., p. 109-116 8 p. 8750736. (Proceedings - 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2018).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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

    Codish, M., Gonopolskiy, I., Ben-Amram, A. M., Fuhs, C. & Giesl, J., 1 Jul 2011, In: Theory and Practice of Logic Programming. 11, 4-5, p. 503-520 18 p.

    Research output: Contribution to journalArticlepeer-review

    5 Scopus citations
  • SAT solving for argument filterings

    Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R. & Giesl, J., 1 Jan 2006, Logic for Programming, Artificial Intelligence, and Reasoning - 13th International Conference, LPAR 2006, Proceedings. Springer Verlag, p. 30-44 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4246 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    13 Scopus citations
  • SAT solving for termination proofs with recursive path orders and dependency pairs

    Codish, M., Giesl, J., Schneider-Kamp, P. & Thiemann, R., 1 Jun 2012, In: Journal of Automated Reasoning. 49, 1, p. 53-93 41 p.

    Research output: Contribution to journalArticlepeer-review

    16 Scopus citations
  • Semantic basis for the termination analysis of logic programs

    Codish, M. & Taboch, C., 1 Jan 1999, In: Journal of Logic Programming. 41, 1, p. 103-123 21 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    92 Scopus citations
  • Semantics-based programanalysis for logic-based languages using XSB

    Codish, M., Demoen, B. & Sagonas, K., 1 Dec 1998, In: International Journal on Software Tools for Technology Transfer. 2, 1, p. 29-45 17 p.

    Research output: Contribution to journalArticlepeer-review

    12 Scopus citations
  • Sharing Analysis for Logic Programs using Set Logic Programs

    Codish, M., Lagoon, V. & Bueno, F., 1996, 1996 Joint Conf. on Declarative Programming, APPIA-GULP-PRODE'96, Donostia-San Sebastian, Spain, July 15-18, 1996. Lucio, P., Martelli, M. & Navarro, M. (eds.). p. 29-40 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Sharing Analysis Using Set Logic Programs

    Bueno, F., Codish, M. & Lagoon, V., 1997, Logic Programming, Proceedings of the Fourteenth International Conference on Logic Programming, Leuven, Belgium, July 8-11, 1997. Naish, L. (ed.). MIT Press Journals, p. 417 1 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Sharing and groundness dependencies in logic programs

    Codish, M., Søndergaard, H. & Stuckey, P. J., 1 Jan 1999, In: ACM Transactions on Programming Languages and Systems. 21, 5, p. 948-976 29 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    28 Scopus citations
  • Simple polynomial groundness analysis for logic programs

    Heaton, A., Abo-Zaed, M., Codish, M. & King, A., 1 Jan 2000, In: Journal of Logic Programming. 45, 1, p. 143-156 14 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    9 Scopus citations
  • Simplifying pseudo-boolean constraints in residual number systems

    Fekete, Y. & Codish, M., 1 Jan 2014, Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, p. 351-366 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8561 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations
  • Size-change termination analysis in k-bits

    Codish, M., Lagoon, V., Schachte, P. & Stuckey, P. J., 14 Jul 2006, Programming Languages and Systems - 15th European Symposium on Programming, ESOP 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Proceedings. p. 230-245 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3924 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    5 Scopus citations
  • Solving Graph Coloring Problems with Abstraction and Symmetry

    Codish, M., Frank, M., Itzhakov, A. & Miller, A., 18 Sep 2014.

    Research output: Working paper/PreprintPreprint

    File
    26 Downloads (Pure)
  • Solving partial order constraints for LPO termination

    Codish, M., Lagoon, V. & Stuckey, P. J., 1 Jan 2006, Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings. Springer Verlag, p. 4-18 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4098 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    20 Scopus citations