- Declarative Programming of Search Problems with Built-in Arithmetic Eugenia Ternovska and David G. Mitchell
- SOLVING NP SEARCH PROBLEMS MODEL EXPANSION
- Encoding Treewidth into SAT Marko Samer and Helmut Veith
- Minimum 2CNF Resolution Refutations in Polynomial Time
- XOR Satisfiability Solver Module for DPLL Integration Tero Laitinen
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- A METHOD FOR SOLVING NP SEARCH BASED ON MODEL EXPANSION AND GROUNDING
- Dynamic Symmetry Breaking by Simulating Zykov Contraction
- On the Power of Clause-Learning SAT Solvers as Resolution Engines$
- Minimum Witnesses for Unsatisfiable 2CNFs Joshua Buresh-Oppenheim and David Mitchell
- Some Pitfalls for Experimenters with Random SAT David G. Mitchell 1 , Hector J. Levesque 2
- Hard and Easy Distributions of SAT Problems David Mitchell
- Hard Problems for CSP Algorithms David G. Mitchell
- Generating Hard Satisfiability Problems ? Bart Selman b , David Mitchell a;1 and Hector J. Levesque c;2
- THE LOGIC IN COMPUTER SCIENCE COLUMN YURI GUREVICH
- Computing Science 2011 Spring CMPT 417 -D100 Intelligent Systems
- Constraint Propagation in Propositional Planning Andreas Sideris and Yannis Dimopoulos
- A Satisfiability-based Approach for Embedding Generalized Tanglegrams on Level Graphs
- Using Decision Procedures Efficiently for Optimization Matthew Streeter Stephen F. Smith
- Resolution Complexity of Random Constraints David G. Mitchell
- Declarative Programming of Search Problems with Built-in Arithmetic
- The SAT Solver MXC, Version 0.5 (2007 SAT Solver Competition Version)
- Solving "Hard" Satisfiability Problems Using GridSAT Wahid Chrabakh
- Abstraction-based Satisfiability Solving of Presburger Arithmetic
- CSC 438F/2404F Notes Fall, 2008 The first two references have especially influenced these notes and are cited from time to
- Faster Phylogenetic Inference with MXG David G. Mitchell, Faraz Hach and Raheleh Mohebali
- On the Expressive Power of Essence David G. Mitchell and Eugenia Ternovska
- The SAT Solver MXC, v.1 David R. Bregman and David G. Mitchell
- 76 communIcATIons of The Acm | auGuST 2009 | voL. 52 | no. 8 review articles
- BioMed Central Page 1 of 26
- 674 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 21, NO. 6, JUNE 2002 A New FPGA Detailed Routing Approach Via
- Satisfiability and Integer Programming As Complementary Tools Ruiming Li, Dian Zhou Donglei Du
- PLEASE SCROLL DOWN FOR ARTICLE !"#$%&'(#)*+%,&$%-.,/*.&-+-%012%34&/&-#&/%5+$+&')"%6/.,*+-7+%8+(,.'9
- Computing Science Course Outlines 2011 Spring CMPT 701 -G100 Computability and Logic
- Resolution and Constraint Satisfaction David G. Mitchell
- EFFICIENT ALGORITHMS FOR CLAUSELEARNING SAT SOLVERS
- A Framework for Representing and Solving NP Search Problems David Mitchell and Eugenia Ternovska
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- A Restriction of Extended Resolution for Clause Learning SAT Solvers Gilles Audemard
- Modelling Languages, Model Expansion, and MXG David G. Mitchell
- Constructing CaminSokal Phylogenies Via Answer Set Programming
- A New Method for Solving Hard Satisfiability Problems Bart Selman
- Expressive Power and Abstraction in Essence David G. Mitchell and Eugenia Ternovska
- CMPT-417, SPRING 2011 --ASSIGNMENT 1 DUE: START OF CLASS, MONDAY FEB. 20.
- 2 -way vs. d -way Branching for CSP Joey Hwang and David G. Mitchell
- Computing Science Course Outlines 2011 Fall CMPT 225 -D100 Data Structures and Programming
- Computing Science Course Outlines 2011 Fall CMPT 827 -G100 Intelligent Systems
- 3 SORTING ALGORITHMS -CMPT-225 NOTES PRELIMINARY DRAFT
- CMPT 225 D1 -Fall 2011 -Assignment 3. Submit your solutions online by 2:00 pm, Monday Dec. 5.
- Computing Science Course Outlines 2012 Spring CMPT 225 -E200 Data Structures and Programming
