| 2022 | IJCAI | Large Neighbourhood Search for Anytime MaxSAT Solving. | Randy Hickey, Fahiem Bacchus |
| 2021 | AAAI | Learning Branching Heuristics for Propositional Model Counting. | Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu, Chris J. Maddison, Roger B. Grosse, Sanjit A. Seshia, Fahiem Bacchus |
| 2021 | IJCAI | Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract). | Jeremias Berg, Fahiem Bacchus, Alex Poole |
| 2020 | SAT | Abstract Cores in Implicit Hitting Set MaxSat Solving. | Jeremias Berg, Fahiem Bacchus, Alex Poole |
| 2020 | SAT | Clause Size Reduction with all-UIP Learning. | Nick Feng, Fahiem Bacchus |
| 2020 | SAT | Trail Saving on Backtrack. | Randy Hickey, Fahiem Bacchus |
| 2019 | SAT | Speeding Up Assumption-Based SAT. | Randy Hickey, Fahiem Bacchus |
| 2018 | CADE | Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories. | Katalin Fazekas, Fahiem Bacchus, Armin Biere |
| 2018 | IJCAI | Reduced Cost Fixing for Maximum Satisfiability. | Fahiem Bacchus, Antti Hyttinen, Matti Jrvisalo, Paul Saikko |
| 2017 | CP | Reduced Cost Fixing in MaxSAT. | Fahiem Bacchus, Antti Hyttinen, Matti Jrvisalo, Paul Saikko |
| 2016 | CPAIOR | Finding a Collection of MUSes Incrementally. | Fahiem Bacchus, George Katsirelos |
| 2015 | CAV | Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. | Fahiem Bacchus, George Katsirelos |
| 2015 | IJCAI | SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples. | Joanna Drummond, Andrew Perrault, Fahiem Bacchus |
| 2015 | LPAR | Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. | Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl |
| 2014 | AAAI | Relaxation Search: A Simple Way of Managing Optional Clauses. | Fahiem Bacchus, Jessica Davies, Maria Tsimpoukelli, George Katsirelos |
| 2014 | AAAI | Maximum Satisfiability Using Core-Guided MaxSAT Resolution. | Nina Narodytska, Fahiem Bacchus |
| 2014 | CAV | Solving Games without Controllable Predecessor. | Nina Narodytska, Alexander Legg, Fahiem Bacchus, Leonid Ryzhyk, Adam Walker |
| 2014 | SAT | Cores in Core Based MaxSat Algorithms: An Analysis. | Fahiem Bacchus, Nina Narodytska |
| 2013 | CP | Postponing Optimization to Speed Up MAXSAT Solving. | Jessica Davies, Fahiem Bacchus |
| 2013 | CP | Solving Weighted CSPs by Successive Relaxations. | Erin Delisle, Fahiem Bacchus |
| 2013 | SAT | Exploiting the Power of mip Solvers in maxsat. | Jessica Davies, Fahiem Bacchus |
| 2013 | SAT | Recovering and Utilizing Partial Duality in QBF. | Alexandra Goultiaeva, Fahiem Bacchus |
| 2012 | AAAI | MAXSAT Heuristics for Cost Optimal Planning. | Lei Zhang, Fahiem Bacchus |
| 2012 | SAT | Off the Trail: Re-examining the CDCL Algorithm. | Alexandra Goultiaeva, Fahiem Bacchus |
| 2011 | CP | Solving MAXSAT by Solving a Sequence of Simpler SAT Instances. | Jessica Davies, Fahiem Bacchus |
| 2011 | IJCAI | A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. | Alexandra Goultiaeva, Allen Van Gelder, Fahiem Bacchus |
| 2010 | AAAI | Exploiting QBF Duality on a Circuit Representation. | Alexandra Goultiaeva, Fahiem Bacchus |
| 2010 | CP | Using Learnt Clauses in maxsat. | Jessica Davies, Jeremy Cho, Fahiem Bacchus |
| 2010 | DATE | Leveraging dominators for preprocessing QBF. | Hratch Mangassarian, Bao Le, Alexandra Goultiaeva, Andreas G. Veneris, Fahiem Bacchus |
| 2010 | SAT | Exploiting Circuit Representations in QBF Solving. | Alexandra Goultiaeva, Fahiem Bacchus |
| 2009 | IJCAI | Exploiting Decomposition on Constraint Problems with High Tree-Width. | Matthew Kitching, Fahiem Bacchus |
| 2009 | IJCAI | Set Branching in Constraint Optimization. | Matthew Kitching, Fahiem Bacchus |
| 2009 | SAT | Beyond CNF: A Circuit-Based QBF Solver. | Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus |
| 2008 | AAAI | Clause Learning Can Effectively P-Simulate General Propositional Resolution. | Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder |
| 2008 | CP | Exploiting Decomposition in Constraint Optimization Problems. | Matthew Kitching, Fahiem Bacchus |
| 2007 | AAAI | Using More Reasoning to Improve #SAT Solving. | Jessica Davies, Fahiem Bacchus |
| 2007 | AAAI | Using Expectation Maximization to Find Likely Assignments for Solving CSP's. | Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, Sheila A. McIlraith |
| 2007 | CP | Caching in Backtracking Search. | Fahiem Bacchus |
| 2007 | CP | GAC Via Unit Propagation. | Fahiem Bacchus |
| 2007 | CP | Solution Directed Backjumping for QCSP. | Fahiem Bacchus, Kostas Stergiou |
| 2007 | IJCAI | A Heuristic Search Approach to Planning with Temporally Extended Preferences. | Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith |
| 2007 | IJCAI | Symmetric Component Caching. | Matthew Kitching, Fahiem Bacchus |
| 2007 | SAT | Dynamically Partitioning for Solving QBF. | Horst Samulowitz, Fahiem Bacchus |
| 2006 | CP | Preprocessing QBF. | Horst Samulowitz, Jessica Davies, Fahiem Bacchus |
| 2006 | SAT | CSPs: Adding Structure to SAT. | Fahiem Bacchus |
| 2006 | SAT | Binary Clause Reasoning in QBF. | Horst Samulowitz, Fahiem Bacchus |
| 2005 | AAAI | Generalized NoGoods in CSPs. | George Katsirelos, Fahiem Bacchus |
| 2005 | CP | Using SAT in QBF. | Horst Samulowitz, Fahiem Bacchus |
| 2005 | IJCAI | Propagating Logical Combinations of Constraints. | Fahiem Bacchus, Toby Walsh |
| 2004 | CP | Solving Non-clausal Formulas with DPLL Search. | Christian Thiffault, Fahiem Bacchus, Toby Walsh |
| 2004 | ECAI | Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning. | Nathanael Hyafil, Fahiem Bacchus |
| 2004 | KR | Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. | Ronald P. A. Petrick, Fahiem Bacchus |
| 2004 | SAT | Combining Component Caching and Clause Learning for Effective Model Counting. | Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi |
| 2004 | SAT | Solving Non-clausal Formulas with DPLL search. | Christian Thiffault, Fahiem Bacchus, Toby Walsh |
| 2003 | CP | Unrestricted Nogood Recording in CSP Search. | George Katsirelos, Fahiem Bacchus |
| 2003 | FOCS | Algorithms and Complexity Results for #SAT and Bayesian Inference. | Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi |
| 2003 | IJCAI | Generalizing GraphPlan by Formulating Planning as a CSP. | Adriana Lopez, Fahiem Bacchus |
| 2003 | UAI | Value Elimination: Bayesian Interence via Backtracking Search. | Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi |
| 2003 | SAT | Effective Preprocessing with Hyper-Resolution and Equality Reduction. | Fahiem Bacchus, Jonathan Winter |
| 2002 | AAAI | Enhancing Davis Putnam with Extended Binary Clause Reasoning. | Fahiem Bacchus |
| 2001 | CP | GAC on Conjunctions of Constraints. | George Katsirelos, Fahiem Bacchus |
| 2001 | IJCAI | Planning with Resources and Concurrency: A Forward Chaining Approach. | Fahiem Bacchus, Michael Ady |
| 2001 | UAI | UCP-Networks: A Directed Graphical Representation of Conditional Utilities. | Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman |
| 2000 | CP | Extending Forward Checking. | Fahiem Bacchus |
| 1998 | AAAI | On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. | Fahiem Bacchus, Peter van Beek |
| 1998 | KR | Modeling an Agent's Incomplete Knowledge During Planning and During Execution. | Fahiem Bacchus, Ronald P. A. Petrick |
| 1997 | AAAI | Structured Solution Methods for Non-Markovian Decision Processes. | Fahiem Bacchus, Craig Boutilier, Adam J. Grove |
| 1996 | AAAI | Rewarding Behaviors. | Fahiem Bacchus, Craig Boutilier, Adam J. Grove |
| 1996 | AAAI | Planning for Temporally Extended Goals. | Fahiem Bacchus, Froduald Kabanza |
| 1996 | KR | Utility Independence in a Qualitative Decision Theory. | Fahiem Bacchus, Adam J. Grove |
| 1996 | TIME | Using Temporal Logics for Planning and Control. | Fahiem Bacchus |
| 1995 | CP | On the Forward Checking Algorithm. | Fahiem Bacchus, Adam J. Grove |
| 1995 | CP | Dynamic Variable Ordering in CSPs. | Fahiem Bacchus, Paul van Run |
| 1995 | IJCAI | Reasoning about Noisy Sensors in the Situation Calculus. | Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque |
| 1995 | UAI | Graphical models for preference and utility. | Fahiem Bacchus, Adam J. Grove |
| 1994 | AAAI | Forming Beliefs about a Changing World. | Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller |
| 1994 | UAI | Generating New Beliefs from Old. | Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller |
| 1994 | UAI | Using New Data to Refine a Bayesian Network. | Wai Lam, Fahiem Bacchus |
| 1993 | IJCAI | Statistical Foundations for Default Reasoning. | Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller |
| 1993 | UAI | Using First-Order Probability Logic for the Construction of Bayesian Networks. | Fahiem Bacchus |
| 1993 | UAI | Using Causal Information and Local Measures to Learn Bayesian Networks. | Wai Lam, Fahiem Bacchus |
| 1992 | AAAI | From Statistics to Beliefs. | Fahiem Bacchus, Adam J. Grove, Daphne Koller, Joseph Y. Halpern |
| 1992 | AAAI | The Expected Value of Hierarchical Problem-Solving. | Fahiem Bacchus, Qiang Yang |
| 1991 | AAAI | Default Reasoning From Statistics. | Fahiem Bacchus |
| 1991 | IJCAI | The Downward Refinement Property. | Fahiem Bacchus, Qiang Yang |
| 1990 | ECAI | Probabilistic Belief Logics. | Fahiem Bacchus |
| 1989 | IJCAI | A Modest, but Semantically Well Founded, Inheritance Reasoner. | Fahiem Bacchus |
| 1989 | KR | A Non-Reified Temporal Logic. | Fahiem Bacchus, Josh Tenenberg, Johannes A. G. M. Koomen |
| 1989 | UAI | Lp: A Logic for Statistical Information. | Fahiem Bacchus |
| 1988 | UAI | On probability distributions over possible worlds. | Fahiem Bacchus |