Fahiem Bacchus

Affiliations:
  • University of Toronto, Canada


According to our database1, Fahiem Bacchus authored at least 115 papers between 1988 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Large Neighbourhood Search for Anytime MaxSAT Solving.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Maximum Satisfiabiliy.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract).
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Learning Branching Heuristics for Propositional Model Counting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Learning Branching Heuristics for Propositional Model Counting.
CoRR, 2020

Trail Saving on Backtrack.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Clause Size Reduction with all-UIP Learning.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Abstract Cores in Implicit Hitting Set MaxSat Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2019
MaxSAT Evaluation 2018: New Developments and Detailed Results.
J. Satisf. Boolean Model. Comput., 2019

Speeding Up Assumption-Based SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018
Reduced Cost Fixing for Maximum Satisfiability.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Reduced Cost Fixing in MaxSAT.
Proceedings of the Principles and Practice of Constraint Programming, 2017

2016
Finding a Collection of MUSes Incrementally.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Strategy-Proofness in the Stable Matching Problem with Couples.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Exploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples.
CoRR, 2015

Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Cores in Core Based MaxSat Algorithms: An Analysis.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Solving Games without Controllable Predecessor.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Maximum Satisfiability Using Core-Guided MaxSAT Resolution.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Relaxation Search: A Simple Way of Managing Optional Clauses.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Recovering and Utilizing Partial Duality in QBF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Exploiting the Power of mip Solvers in maxsat.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Solving Weighted CSPs by Successive Relaxations.
Proceedings of the Principles and Practice of Constraint Programming, 2013

Postponing Optimization to Speed Up MAXSAT Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Value Elimination: Bayesian Inference via Backtracking Search
CoRR, 2012

Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (2005)
CoRR, 2012

Off the Trail: Re-examining the CDCL Algorithm.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

MAXSAT Heuristics for Cost Optimal Planning.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Towards Completely Lifted Search-based Probabilistic Inference
CoRR, 2011

A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas.
Proceedings of the IJCAI 2011, 2011

Solving MAXSAT by Solving a Sequence of Simpler SAT Instances.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
Exploiting Circuit Representations in QBF Solving.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Leveraging dominators for preprocessing QBF.
Proceedings of the Design, Automation and Test in Europe, 2010

Using Learnt Clauses in maxsat.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Exploiting QBF Duality on a Circuit Representation.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Solving #SAT and Bayesian Inference with Backtracking Search.
J. Artif. Intell. Res., 2009

A heuristic search approach to planning with temporally extended preferences.
Artif. Intell., 2009

Beyond CNF: A Circuit-Based QBF Solver.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Set Branching in Constraint Optimization.
Proceedings of the IJCAI 2009, 2009

Exploiting Decomposition on Constraint Problems with High Tree-Width.
Proceedings of the IJCAI 2009, 2009

2008
Exploiting Decomposition in Constraint Optimization Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Clause Learning Can Effectively P-Simulate General Propositional Resolution.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Dynamically Partitioning for Solving QBF.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Symmetric Component Caching.
Proceedings of the IJCAI 2007, 2007

Solution Directed Backjumping for QCSP.
Proceedings of the Principles and Practice of Constraint Programming, 2007

GAC Via Unit Propagation.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Caching in Backtracking Search.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Using Expectation Maximization to Find Likely Assignments for Solving CSP's.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Using More Reasoning to Improve #SAT Solving.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Binary Clause Reasoning in QBF.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

CSPs: Adding Structure to SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Preprocessing QBF.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Propagating Logical Combinations of Constraints.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Using SAT in QBF.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Generalized NoGoods in CSPs.
Proceedings of the Proceedings, 2005

2004
Solving Non-clausal Formulas with DPLL search.
Proceedings of the SAT 2004, 2004

Combining Component Caching and Clause Learning for Effective Model Counting.
Proceedings of the SAT 2004, 2004

Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

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

DPLL with Caching: A new algorithm for #SAT and Bayesian Inference
Electron. Colloquium Comput. Complex., 2003

Value Elimination: Bayesian Interence via Backtracking Search.
Proceedings of the UAI '03, 2003

Effective Preprocessing with Hyper-Resolution and Equality Reduction.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Generalizing GraphPlan by Formulating Planning as a CSP.
Proceedings of the IJCAI-03, 2003

Algorithms and Complexity Results for #SAT and Bayesian Inference.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Unrestricted Nogood Recording in CSP Search.
Proceedings of the Principles and Practice of Constraint Programming, 2003

Conformant Probabilistic Planning via CSPs.
Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

2002
Binary vs. non-binary constraints.
Artif. Intell., 2002

A Knowledge-Based Approach to Planning with Incomplete Information and Sensing.
Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems, 2002

Enhancing Davis Putnam with Extended Binary Clause Reasoning.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
The AIPS '00 Planning Competition.
AI Mag., 2001

UCP-Networks: A Directed Graphical Representation of Conditional Utilities.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

Planning with Resources and Concurrency: A Forward Chaining Approach.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

GAC on Conjunctions of Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
Using temporal logics to express search control knowledge for planning.
Artif. Intell., 2000

Extending Forward Checking.
Proceedings of the Principles and Practice of Constraint Programming, 2000

1999
Reasoning about Noisy Sensors and Effectors in the Situation Calculus.
Artif. Intell., 1999

1998
Planning for Temporally Extended Goals.
Ann. Math. Artif. Intell., 1998

Modeling an Agent's Incomplete Knowledge During Planning and During Execution.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

Making Forward Chaining Relevant.
Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 1998

On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Structured Solution Methods for Non-Markovian Decision Processes.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
From Statistical Knowledge Bases to Degrees of Belief.
Artif. Intell., 1996

Using Temporal Logics for Planning and Control.
Proceedings of the Third International Workshop on Temporal Representation and Reasoning, 1996

Utility Independence in a Qualitative Decision Theory.
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Rewarding Behaviors.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Graphical models for preference and utility.
Proceedings of the UAI '95: Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, 1995

Reasoning about Noisy Sensors in the Situation Calculus.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Dynamic Variable Ordering in CSPs.
Proceedings of the Principles and Practice of Constraint Programming, 1995

On the Forward Checking Algorithm.
Proceedings of the Principles and Practice of Constraint Programming, 1995

1994
Learning Bayesian Belief Networks: An Approach Based on the MDL Principle.
Comput. Intell., 1994

A Response to "Believing on the Basis of the Evidence".
Comput. Intell., 1994

Downward Refinement and the Efficiency of Hierarchical Problem Solving.
Artif. Intell., 1994

Using New Data to Refine a Bayesian Network.
Proceedings of the UAI '94: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, 1994

Generating New Beliefs from Old.
Proceedings of the UAI '94: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, 1994

Forming Beliefs about a Changing World.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
Using Causal Information and Local Measures to Learn Bayesian Networks.
Proceedings of the UAI '93: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, 1993

Using First-Order Probability Logic for the Construction of Bayesian Networks.
Proceedings of the UAI '93: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, 1993

Statistical Foundations for Default Reasoning.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

Generating Degrees of Belief from Statistical Information: An Overview.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1992
The Expected Value of Hierarchical Problem-Solving.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

From Statistics to Beliefs.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
A Non-Reified Temporal Logic.
Artif. Intell., 1991

The Downward Refinement Property.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

Default Reasoning From Statistics.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Lp, a logic for representing and reasoning with statistical knowledge.
Comput. Intell., 1990

Probability and logic: a reply to Cheeseman.
Comput. Intell., 1990

Probabilistic Belief Logics.
Proceedings of the 9th European Conference on Artificial Intelligence, 1990

Representing and reasoning with probabilistic knowledge - a logical approach to probabilities.
MIT Press, ISBN: 978-0-262-02317-7, 1990

1989
Lp: A Logic for Statistical Information.
Proceedings of the UAI '89: Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence, 1989

A Modest, but Semantically Well Founded, Inheritance Reasoner.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1988
On probability distributions over possible worlds.
Proceedings of the UAI '88: Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence, 1988


  Loading...