Fahiem Bacchus

135 papers A* 38A 48B 2C 1Journal 34Unranked 10

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