Fahiem Bacchus

Publication Activity (10 Years)

Years Active: 1988-2022
Publications (10 Years): 14

Top Venues

CoRR

SAT

IJCAI

AAAI

Publications

Randy Hickey, Fahiem Bacchus
Large Neighbourhood Search for Anytime MaxSAT Solving. IJCAI (2022)
Jeremias Berg, Fahiem Bacchus, Alex Poole
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract). IJCAI (2021)
Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu, Chris J. Maddison, Roger B. Grosse, Sanjit A. Seshia, Fahiem Bacchus
Learning Branching Heuristics for Propositional Model Counting. AAAI (2021)
Nick Feng, Fahiem Bacchus
Clause Size Reduction with all-UIP Learning. SAT (2020)
Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu, Chris J. Maddison, Roger B. Grosse, Edward A. Lee, Sanjit A. Seshia, Fahiem Bacchus
Learning Branching Heuristics for Propositional Model Counting. CoRR (2020)
Jeremias Berg, Fahiem Bacchus, Alex Poole
Abstract Cores in Implicit Hitting Set MaxSat Solving. SAT (2020)
Randy Hickey, Fahiem Bacchus
Trail Saving on Backtrack. SAT (2020)
Fahiem Bacchus, Matti Järvisalo, Ruben Martins
MaxSAT Evaluation 2018: New Developments and Detailed Results. J. Satisf. Boolean Model. Comput. 11 (1) (2019)
Randy Hickey, Fahiem Bacchus
Speeding Up Assumption-Based SAT. SAT (2019)
Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, Paul Saikko
Reduced Cost Fixing for Maximum Satisfiability. IJCAI (2018)
Katalin Fazekas, Fahiem Bacchus, Armin Biere
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories. IJCAR (2018)
Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, Paul Saikko
Reduced Cost Fixing in MaxSAT. CP (2017)
Andrew Perrault, Joanna Drummond, Fahiem Bacchus
Strategy-Proofness in the Stable Matching Problem with Couples. AAMAS (2016)
Fahiem Bacchus, George Katsirelos
Finding a Collection of MUSes Incrementally. CPAIOR (2016)
Joanna Drummond, Andrew Perrault, Fahiem Bacchus
SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples. IJCAI (2015)
Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR (2015)
Andrew Perrault, Joanna Drummond, Fahiem Bacchus
Exploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples. CoRR (2015)
Fahiem Bacchus, George Katsirelos
Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. CAV (2) (2015)
Nina Narodytska, Alexander Legg, Fahiem Bacchus, Leonid Ryzhyk, Adam Walker
Solving Games without Controllable Predecessor. CAV (2014)
Fahiem Bacchus, Nina Narodytska
Cores in Core Based MaxSat Algorithms: An Analysis. SAT (2014)
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
Solving #SAT and Bayesian Inference with Backtracking Search. CoRR (2014)
Nina Narodytska, Fahiem Bacchus
Maximum Satisfiability Using Core-Guided MaxSAT Resolution. AAAI (2014)
Fahiem Bacchus, Jessica Davies, Maria Tsimpoukelli, George Katsirelos
Relaxation Search: A Simple Way of Managing Optional Clauses. AAAI (2014)
Fahiem Bacchus, Adam J. Grove
Graphical Models for Preference and Utility CoRR (2013)
Jessica Davies, Fahiem Bacchus
Exploiting the Power of mip Solvers in maxsat. SAT (2013)
Wai Lam, Fahiem Bacchus
Using New Data to Refine a Bayesian Network CoRR (2013)
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller
Generating New Beliefs From Old CoRR (2013)
Fahiem Bacchus
Probability Distributions Over Possible Worlds CoRR (2013)
Fahiem Bacchus
Lp : A Logic for Statistical Information CoRR (2013)
Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman
UCP-Networks: A Directed Graphical Representation of Conditional Utilities CoRR (2013)
Alexandra Goultiaeva, Fahiem Bacchus
Recovering and Utilizing Partial Duality in QBF. SAT (2013)
Jessica Davies, Fahiem Bacchus
Postponing Optimization to Speed Up MAXSAT Solving. CP (2013)
Erin Delisle, Fahiem Bacchus
Solving Weighted CSPs by Successive Relaxations. CP (2013)
Wai Lam, Fahiem Bacchus
Using Causal Information and Local Measures to Learn Bayesian Networks CoRR (2013)
Fahiem Bacchus
Using First-Order Probability Logic for the Construction of Bayesian Networks CoRR (2013)
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
Value Elimination: Bayesian Inference via Backtracking Search CoRR (2012)
Lei Zhang, Fahiem Bacchus
MAXSAT Heuristics for Cost Optimal Planning. AAAI (2012)
Alexandra Goultiaeva, Fahiem Bacchus
Off the Trail: Re-examining the CDCL Algorithm. SAT (2012)
Fahiem Bacchus, Tommi S. Jaakkola
Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (2005) CoRR (2012)
Jessica Davies, Fahiem Bacchus
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances. CP (2011)
David Poole, Fahiem Bacchus, Jacek Kisynski
Towards Completely Lifted Search-based Probabilistic Inference CoRR (2011)
Alexandra Goultiaeva, Allen Van Gelder, Fahiem Bacchus
A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. IJCAI (2011)
Fahiem Bacchus
The Power of Modeling - a Response to PDDL2.1 CoRR (2011)
Alexandra Goultiaeva, Fahiem Bacchus
Exploiting QBF Duality on a Circuit Representation. AAAI (2010)
Alexandra Goultiaeva, Fahiem Bacchus
Exploiting Circuit Representations in QBF Solving. SAT (2010)
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva, Andreas G. Veneris, Fahiem Bacchus
Leveraging dominators for preprocessing QBF. DATE (2010)
Jessica Davies, Jeremy Cho, Fahiem Bacchus
Using Learnt Clauses in maxsat. CP (2010)
Matthew Kitching, Fahiem Bacchus
Set Branching in Constraint Optimization. IJCAI (2009)
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith
A heuristic search approach to planning with temporally extended preferences. Artif. Intell. 173 (5-6) (2009)
Matthew Kitching, Fahiem Bacchus
Exploiting Decomposition on Constraint Problems with High Tree-Width. IJCAI (2009)
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
Solving #SAT and Bayesian Inference with Backtracking Search. J. Artif. Intell. Res. 34 (2009)
Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus
Beyond CNF: A Circuit-Based QBF Solver. SAT (2009)
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder
Clause Learning Can Effectively P-Simulate General Propositional Resolution. AAAI (2008)
Matthew Kitching, Fahiem Bacchus
Exploiting Decomposition in Constraint Optimization Problems. CP (2008)
Fahiem Bacchus
GAC Via Unit Propagation. CP (2007)
Matthew Kitching, Fahiem Bacchus
Symmetric Component Caching. IJCAI (2007)
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, Sheila A. McIlraith
Using Expectation Maximization to Find Likely Assignments for Solving CSP's. AAAI (2007)
Jessica Davies, Fahiem Bacchus
Using More Reasoning to Improve #SAT Solving. AAAI (2007)
Fahiem Bacchus
Caching in Backtracking Search. CP (2007)
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith
A Heuristic Search Approach to Planning with Temporally Extended Preferences. IJCAI (2007)
Fahiem Bacchus, Kostas Stergiou
Solution Directed Backjumping for QCSP. CP (2007)
Horst Samulowitz, Fahiem Bacchus
Dynamically Partitioning for Solving QBF. SAT (2007)
Horst Samulowitz, Fahiem Bacchus
Binary Clause Reasoning in QBF. SAT (2006)
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
Preprocessing QBF. CP (2006)
Fahiem Bacchus
CSPs: Adding Structure to SAT. SAT (2006)
George Katsirelos, Fahiem Bacchus
Generalized NoGoods in CSPs. AAAI (2005)
Horst Samulowitz, Fahiem Bacchus
Using SAT in QBF. CP (2005)
Fahiem Bacchus, Toby Walsh
Propagating Logical Combinations of Constraints. IJCAI (2005)
Ronald P. A. Petrick, Fahiem Bacchus
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. KR (2004)
Christian Thiffault, Fahiem Bacchus, Toby Walsh
Solving Non-clausal Formulas with DPLL Search. CP (2004)
Nathanael Hyafil, Fahiem Bacchus
Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning. ECAI (2004)
Ronald P. A. Petrick, Fahiem Bacchus
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. ICAPS (2004)
Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi
Combining Component Caching and Clause Learning for Effective Model Counting. SAT (2004)
Christian Thiffault, Fahiem Bacchus, Toby Walsh
Solving Non-clausal Formulas with DPLL search. SAT (2004)
Fahiem Bacchus
The Power of Modeling - a Response to PDDL2.1. J. Artif. Intell. Res. 20 (2003)
Adriana Lopez, Fahiem Bacchus
Generalizing GraphPlan by Formulating Planning as a CSP. IJCAI (2003)
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
Value Elimination: Bayesian Interence via Backtracking Search. UAI (2003)
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller
From Statistical Knowledge Bases to Degrees of Belief CoRR (2003)
Nathanael Hyafil, Fahiem Bacchus
Conformant Probabilistic Planning via CSPs. ICAPS (2003)
George Katsirelos, Fahiem Bacchus
Unrestricted Nogood Recording in CSP Search. CP (2003)
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
Algorithms and Complexity Results for #SAT and Bayesian Inference. FOCS (2003)
Fahiem Bacchus, Jonathan Winter
Effective Preprocessing with Hyper-Resolution and Equality Reduction. SAT (2003)
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
DPLL with Caching: A new algorithm for #SAT and Bayesian Inference Electron. Colloquium Comput. Complex. 10 (003) (2003)
Fahiem Bacchus
Enhancing Davis Putnam with Extended Binary Clause Reasoning. AAAI/IAAI (2002)
Ronald P. A. Petrick, Fahiem Bacchus
A Knowledge-Based Approach to Planning with Incomplete Information and Sensing. AIPS (2002)
Fahiem Bacchus, Xinguang Chen, Peter van Beek, Toby Walsh
Binary vs. non-binary constraints. Artif. Intell. 140 (1/2) (2002)
Fahiem Bacchus
The AIPS '00 Planning Competition. AI Mag. 22 (3) (2001)
Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman
UCP-Networks: A Directed Graphical Representation of Conditional Utilities. UAI (2001)
Fahiem Bacchus, Michael Ady
Planning with Resources and Concurrency: A Forward Chaining Approach. IJCAI (2001)
George Katsirelos, Fahiem Bacchus
GAC on Conjunctions of Constraints. CP (2001)
Fahiem Bacchus
Extending Forward Checking. CP (2000)
Fahiem Bacchus, Froduald Kabanza
Using temporal logics to express search control knowledge for planning. Artif. Intell. 116 (1-2) (2000)
Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque
Reasoning about Noisy Sensors and Effectors in the Situation Calculus. Artif. Intell. 111 (1-2) (1999)
Fahiem Bacchus, Yee Whye Teh
Making Forward Chaining Relevant. AIPS (1998)
Fahiem Bacchus, Ronald P. A. Petrick
Modeling an Agent's Incomplete Knowledge During Planning and During Execution. KR (1998)
Fahiem Bacchus, Froduald Kabanza
Planning for Temporally Extended Goals. Ann. Math. Artif. Intell. 22 (1-2) (1998)
Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque
Reasoning about Noisy Sensors and Effectors in the Situation Calculus CoRR (1998)
Fahiem Bacchus, Peter van Beek
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. AAAI/IAAI (1998)
Fahiem Bacchus, Craig Boutilier, Adam J. Grove
Structured Solution Methods for Non-Markovian Decision Processes. AAAI/IAAI (1997)
Fahiem Bacchus, Adam J. Grove
Utility Independence in a Qualitative Decision Theory. KR (1996)

Fahiem Bacchus.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Fahiem Bacchus