On probability distributions over possible worlds. - Fahiem Bacchus (UAI, 1988)

A Modest, but Semantically Well Founded, Inheritance Reasoner. - Fahiem Bacchus (IJCAI, 1989)

Lp: A Logic for Statistical Information. - Fahiem Bacchus (UAI, 1989)

Representing and reasoning with probabilistic knowledge - a logical approach to probabilities. - Fahiem Bacchus (MIT Press, 1990)

Probabilistic Belief Logics. - Fahiem Bacchus (ECAI, 1990)

Probability and logic: a reply to Cheeseman. - Fahiem Bacchus (Comput. Intell., 1990)

Lp, a logic for representing and reasoning with statistical knowledge. - Fahiem Bacchus (Comput. Intell., 1990)

Default Reasoning From Statistics. - Fahiem Bacchus (AAAI, 1991)

The Downward Refinement Property. - Fahiem Bacchus; Qiang Yang 001 (IJCAI, 1991)

A Non-Reified Temporal Logic. - Fahiem Bacchus; Josh Tenenberg; Johannes A. G. M. Koomen (Artif. Intell., 1991)

From Statistics to Beliefs. - Fahiem Bacchus; Adam J. Grove; Daphne Koller; Joseph Y. Halpern (AAAI, 1992)

The Expected Value of Hierarchical Problem-Solving. - Fahiem Bacchus; Qiang Yang 001 (AAAI, 1992)

Generating Degrees of Belief from Statistical Information: An Overview. - Fahiem Bacchus; Adam J. Grove; Joseph Y. Halpern; Daphne Koller (FSTTCS, 1993)

Statistical Foundations for Default Reasoning. - Fahiem Bacchus; Adam J. Grove; Joseph Y. Halpern; Daphne Koller (IJCAI, 1993)

Using First-Order Probability Logic for the Construction of Bayesian Networks. - Fahiem Bacchus (UAI, 1993)

Using Causal Information and Local Measures to Learn Bayesian Networks. - Wai Lam; Fahiem Bacchus (UAI, 1993)

Forming Beliefs about a Changing World. - Fahiem Bacchus; Adam J. Grove; Joseph Y. Halpern; Daphne Koller (AAAI, 1994)

Generating New Beliefs from Old. - Fahiem Bacchus; Adam J. Grove; Joseph Y. Halpern; Daphne Koller (UAI, 1994)

Using New Data to Refine a Bayesian Network. - Wai Lam; Fahiem Bacchus (UAI, 1994)

Downward Refinement and the Efficiency of Hierarchical Problem Solving. - Fahiem Bacchus; Qiang Yang 001 (Artif. Intell., 1994)

A Response to "Believing on the Basis of the Evidence". - Fahiem Bacchus; Adam J. Grove; Joseph Y. Halpern; Daphne Koller (Comput. Intell., 1994)

Learning Bayesian Belief Networks: An Approach Based on the MDL Principle. - Wai Lam; Fahiem Bacchus (Comput. Intell., 1994)

On the Forward Checking Algorithm. - Fahiem Bacchus; Adam J. Grove (CP, 1995)

Dynamic Variable Ordering in CSPs. - Fahiem Bacchus; Paul van Run (CP, 1995)

Reasoning about Noisy Sensors in the Situation Calculus. - Fahiem Bacchus; Joseph Y. Halpern; Hector J. Levesque (IJCAI, 1995)

Graphical models for preference and utility. - Fahiem Bacchus; Adam J. Grove (UAI, 1995)

Rewarding Behaviors. - Fahiem Bacchus; Craig Boutilier; Adam J. Grove (AAAI/IAAI, Vol. 2, 1996)

Utility Independence in a Qualitative Decision Theory. - Fahiem Bacchus; Adam J. Grove (KR, 1996)

Using Temporal Logics for Planning and Control. - Fahiem Bacchus (TIME, 1996)

From Statistical Knowledge Bases to Degrees of Belief. - Fahiem Bacchus; Adam J. Grove; Joseph Y. Halpern; Daphne Koller (Artif. Intell., 1996)

Structured Solution Methods for Non-Markovian Decision Processes. - Fahiem Bacchus; Craig Boutilier; Adam J. Grove (AAAI/IAAI, 1997)

On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. - Fahiem Bacchus; Peter van Beek (AAAI/IAAI, 1998)

Making Forward Chaining Relevant. - Fahiem Bacchus; Yee Whye Teh (AIPS, 1998)

Modeling an Agent's Incomplete Knowledge During Planning and During Execution. - Fahiem Bacchus; Ronald P. A. Petrick (KR, 1998)

Planning for Temporally Extended Goals. - Fahiem Bacchus; Froduald Kabanza (Ann. Math. Artif. Intell., 1998)

Reasoning about Noisy Sensors and Effectors in the Situation Calculus. - Fahiem Bacchus; Joseph Y. Halpern; Hector J. Levesque (Artif. Intell., 1999)

Extending Forward Checking. - Fahiem Bacchus (CP, 2000)

Using temporal logics to express search control knowledge for planning. - Fahiem Bacchus; Froduald Kabanza (Artif. Intell., 2000)

GAC on Conjunctions of Constraints. - George Katsirelos; Fahiem Bacchus (CP, 2001)

Planning with Resources and Concurrency: A Forward Chaining Approach. - Fahiem Bacchus; Michael Ady (IJCAI, 2001)

UCP-Networks: A Directed Graphical Representation of Conditional Utilities. - Craig Boutilier; Fahiem Bacchus; Ronen I. Brafman (UAI, 2001)

The AIPS '00 Planning Competition. - Fahiem Bacchus (AI Mag., 2001)

Enhancing Davis Putnam with Extended Binary Clause Reasoning. - Fahiem Bacchus (AAAI/IAAI, 2002)

A Knowledge-Based Approach to Planning with Incomplete Information and Sensing. - Ronald P. A. Petrick; Fahiem Bacchus (AIPS, 2002)

Binary vs. non-binary constraints. - Fahiem Bacchus; Xinguang Chen; Peter van Beek; Toby Walsh (Artif. Intell., 2002)

Conformant Probabilistic Planning via CSPs. - Nathanael Hyafil; Fahiem Bacchus (ICAPS, 2003)

Unrestricted Nogood Recording in CSP Search. - George Katsirelos; Fahiem Bacchus (CP, 2003)

Algorithms and Complexity Results for #SAT and Bayesian Inference. - Fahiem Bacchus; Shannon Dalmao; Toniann Pitassi (FOCS, 2003)

Generalizing GraphPlan by Formulating Planning as a CSP. - Adriana Lopez; Fahiem Bacchus (IJCAI, 2003)

Effective Preprocessing with Hyper-Resolution and Equality Reduction. - Fahiem Bacchus; Jonathan Winter (SAT, 2003)

Value Elimination: Bayesian Interence via Backtracking Search. - Fahiem Bacchus; Shannon Dalmao; Toniann Pitassi (UAI, 2003)

DPLL with Caching: A new algorithm for #SAT and Bayesian Inference - Fahiem Bacchus; Shannon Dalmao; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2003)

The Power of Modeling - a Response to PDDL2.1. - Fahiem Bacchus (J. Artif. Intell. Res., 2003)

Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning. - Nathanael Hyafil; Fahiem Bacchus (ECAI, 2004)

Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. - Ronald P. A. Petrick; Fahiem Bacchus (KR, 2004)

Combining Component Caching and Clause Learning for Effective Model Counting. - Tian Sang; Fahiem Bacchus; Paul Beame; Henry A. Kautz; Toniann Pitassi (SAT, 2004)

Solving Non-clausal Formulas with DPLL search. - Christian Thiffault; Fahiem Bacchus; Toby Walsh (SAT, 2004)

Generalized NoGoods in CSPs. - George Katsirelos; Fahiem Bacchus (AAAI, 2005)

Using SAT in QBF. - Horst Samulowitz; Fahiem Bacchus (CP, 2005)

Propagating Logical Combinations of Constraints. - Fahiem Bacchus; Toby Walsh (IJCAI, 2005)

Preprocessing QBF. - Horst Samulowitz; Jessica Davies 001; Fahiem Bacchus (CP, 2006)

CSPs: Adding Structure to SAT. - Fahiem Bacchus (SAT, 2006)

Binary Clause Reasoning in QBF. - Horst Samulowitz; Fahiem Bacchus (SAT, 2006)

Using More Reasoning to Improve #SAT Solving. - Jessica Davies 001; Fahiem Bacchus (AAAI, 2007)

Using Expectation Maximization to Find Likely Assignments for Solving CSP's. - Eric I. Hsu; Matthew Kitching; Fahiem Bacchus; Sheila A. McIlraith (AAAI, 2007)

Caching in Backtracking Search. - Fahiem Bacchus (CP, 2007)

GAC Via Unit Propagation. - Fahiem Bacchus (CP, 2007)

Solution Directed Backjumping for QCSP. - Fahiem Bacchus; Kostas Stergiou 001 (CP, 2007)

Symmetric Component Caching. - Matthew Kitching; Fahiem Bacchus (IJCAI, 2007)

Dynamically Partitioning for Solving QBF. - Horst Samulowitz; Fahiem Bacchus (SAT, 2007)

Clause Learning Can Effectively P-Simulate General Propositional Resolution. - Philipp Hertel; Fahiem Bacchus; Toniann Pitassi; Allen Van Gelder (AAAI, 2008)

Exploiting Decomposition in Constraint Optimization Problems. - Matthew Kitching; Fahiem Bacchus (CP, 2008)

Exploiting Decomposition on Constraint Problems with High Tree-Width. - Matthew Kitching; Fahiem Bacchus (IJCAI, 2009)

Set Branching in Constraint Optimization. - Matthew Kitching; Fahiem Bacchus (IJCAI, 2009)

Beyond CNF: A Circuit-Based QBF Solver. - Alexandra Goultiaeva; Vicki Iverson; Fahiem Bacchus (SAT, 2009)

A heuristic search approach to planning with temporally extended preferences. - Jorge A. Baier; Fahiem Bacchus; Sheila A. McIlraith (Artif. Intell., 2009)

Solving #SAT and Bayesian Inference with Backtracking Search. - Fahiem Bacchus; Shannon Dalmao; Toniann Pitassi (J. Artif. Intell. Res., 2009)

Exploiting QBF Duality on a Circuit Representation. - Alexandra Goultiaeva; Fahiem Bacchus (AAAI, 2010)

Using Learnt Clauses in maxsat. - Jessica Davies 001; Jeremy Cho; Fahiem Bacchus (CP, 2010)

Leveraging dominators for preprocessing QBF. - Hratch Mangassarian; Bao Le; Alexandra Goultiaeva; Andreas G. Veneris; Fahiem Bacchus (DATE, 2010)

Exploiting Circuit Representations in QBF Solving. - Alexandra Goultiaeva; Fahiem Bacchus (SAT, 2010)

Solving MAXSAT by Solving a Sequence of Simpler SAT Instances. - Jessica Davies 001; Fahiem Bacchus (CP, 2011)

A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. - Alexandra Goultiaeva; Allen Van Gelder; Fahiem Bacchus (IJCAI, 2011)

Towards Completely Lifted Search-based Probabilistic Inference - David Poole 001; Fahiem Bacchus; Jacek Kisynski (CoRR, 2011)

MAXSAT Heuristics for Cost Optimal Planning. - Lei Zhang 086; Fahiem Bacchus (AAAI, 2012)

Off the Trail: Re-examining the CDCL Algorithm. - Alexandra Goultiaeva; Fahiem Bacchus (SAT, 2012)

Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (2005) - Fahiem Bacchus; Tommi S. Jaakkola (CoRR, 2012)

Value Elimination: Bayesian Inference via Backtracking Search - Fahiem Bacchus; Shannon Dalmao; Toniann Pitassi (CoRR, 2012)

Postponing Optimization to Speed Up MAXSAT Solving. - Jessica Davies 001; Fahiem Bacchus (CP, 2013)

Solving Weighted CSPs by Successive Relaxations. - Erin Delisle; Fahiem Bacchus (CP, 2013)

Exploiting the Power of mip Solvers in maxsat. - Jessica Davies 001; Fahiem Bacchus (SAT, 2013)

Recovering and Utilizing Partial Duality in QBF. - Alexandra Goultiaeva; Fahiem Bacchus (SAT, 2013)

Relaxation Search: A Simple Way of Managing Optional Clauses. - Fahiem Bacchus; Jessica Davies 001; Maria Tsimpoukelli; George Katsirelos (AAAI, 2014)

Maximum Satisfiability Using Core-Guided MaxSAT Resolution. - Nina Narodytska; Fahiem Bacchus (AAAI, 2014)

Solving Games without Controllable Predecessor. - Nina Narodytska; Alexander Legg; Fahiem Bacchus; Leonid Ryzhyk; Adam Walker (CAV, 2014)

Cores in Core Based MaxSat Algorithms: An Analysis. - Fahiem Bacchus; Nina Narodytska (SAT, 2014)

Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. - Fahiem Bacchus; George Katsirelos (CAV (2), 2015)

SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples. - Joanna Drummond; Andrew Perrault; Fahiem Bacchus (IJCAI, 2015)

Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. - Florian Lonsing; Fahiem Bacchus; Armin Biere; Uwe Egly; Martina Seidl (LPAR, 2015)

Exploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples. - Andrew Perrault; Joanna Drummond; Fahiem Bacchus (CoRR, 2015)

Strategy-Proofness in the Stable Matching Problem with Couples. - Andrew Perrault; Joanna Drummond; Fahiem Bacchus (AAMAS, 2016)

Finding a Collection of MUSes Incrementally. - Fahiem Bacchus; George Katsirelos (CPAIOR, 2016)

Reduced Cost Fixing in MaxSAT. - Fahiem Bacchus; Antti Hyttinen; Matti Järvisalo; Paul Saikko (CP, 2017)

Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories. - Katalin Fazekas; Fahiem Bacchus; Armin Biere (IJCAR, 2018)

Reduced Cost Fixing for Maximum Satisfiability. - Fahiem Bacchus; Antti Hyttinen; Matti Järvisalo; Paul Saikko (IJCAI, 2018)

Speeding Up Assumption-Based SAT. - Randy Hickey; Fahiem Bacchus (SAT, 2019)

MaxSAT Evaluation 2018: New Developments and Detailed Results. - Fahiem Bacchus; Matti Järvisalo; Ruben Martins (J. Satisf. Boolean Model. Comput., 2019)

Abstract Cores in Implicit Hitting Set MaxSat Solving. - Jeremias Berg; Fahiem Bacchus; Alex Poole (SAT, 2020)

Clause Size Reduction with all-UIP Learning. - Nick Feng; Fahiem Bacchus (SAT, 2020)

Trail Saving on Backtrack. - Randy Hickey; Fahiem Bacchus (SAT, 2020)

Learning Branching Heuristics for Propositional Model Counting. - Pashootan Vaezipoor; Gil Lederman; Yuhuai Wu; Chris J. Maddison; Roger B. Grosse; Edward A. Lee; Sanjit A. Seshia; Fahiem Bacchus (CoRR, 2020)

Learning Branching Heuristics for Propositional Model Counting. - Pashootan Vaezipoor; Gil Lederman; Yuhuai Wu; Chris J. Maddison; Roger B. Grosse; Sanjit A. Seshia; Fahiem Bacchus (AAAI, 2021)

Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract). - Jeremias Berg; Fahiem Bacchus; Alex Poole (IJCAI, 2021)

Maximum Satisfiability. - Fahiem Bacchus; Matti Järvisalo; Ruben Martins (Handbook of Satisfiability, 2021)

Large Neighbourhood Search for Anytime MaxSAT Solving. - Randy Hickey; Fahiem Bacchus (IJCAI, 2022)