 | 2009 |
|---|
| 85 |       | Matthew Kitching,
Fahiem Bacchus:
Exploiting Decomposition on Constraint Problems with High Tree-Width.
IJCAI 2009: 525-531 |
| 84 | | Matthew Kitching,
Fahiem Bacchus:
Set Branching in Constraint Optimization.
IJCAI 2009: 532-537 |
| 83 | | Alexandra Goultiaeva,
Vicki Iverson,
Fahiem Bacchus:
Beyond CNF: A Circuit-Based QBF Solver.
SAT 2009: 412-426 |
| 82 | | Jorge A. Baier,
Fahiem Bacchus,
Sheila A. McIlraith:
A heuristic search approach to planning with temporally extended preferences.
Artif. Intell. 173(5-6): 593-618 (2009) |
| 81 | | Fahiem Bacchus,
Shannon Dalmao,
Toniann Pitassi:
Solving #SAT and Bayesian Inference with Backtracking Search.
J. Artif. Intell. Res. (JAIR) 34: 391-442 (2009) |
| 2008 |
|---|
| 80 |  | Philipp Hertel,
Fahiem Bacchus,
Toniann Pitassi,
Allen Van Gelder:
Clause Learning Can Effectively P-Simulate General Propositional Resolution.
AAAI 2008: 283-290 |
| 79 | | Matthew Kitching,
Fahiem Bacchus:
Exploiting Decomposition in Constraint Optimization Problems.
CP 2008: 478-492 |
| 2007 |
|---|
| 78 | | Jessica Davies,
Fahiem Bacchus:
Using More Reasoning to Improve #SAT Solving.
AAAI 2007: 185-190 |
| 77 | | Eric I. Hsu,
Matthew Kitching,
Fahiem Bacchus,
Sheila A. McIlraith:
Using Expectation Maximization to Find Likely Assignments for Solving CSP's.
AAAI 2007: 224-230 |
| 76 | | Fahiem Bacchus:
Caching in Backtracking Search.
CP 2007: 1 |
| 75 | | Fahiem Bacchus:
GAC Via Unit Propagation.
CP 2007: 133-147 |
| 74 | | Fahiem Bacchus,
Kostas Stergiou:
Solution Directed Backjumping for QCSP.
CP 2007: 148-163 |
| 73 | | Matthew Kitching,
Fahiem Bacchus:
Symmetric Component Caching.
IJCAI 2007: 118-124 |
| 72 | | Jorge A. Baier,
Fahiem Bacchus,
Sheila A. McIlraith:
A Heuristic Search Approach to Planning with Temporally Extended Preferences.
IJCAI 2007: 1808-1815 |
| 71 | | Horst Samulowitz,
Fahiem Bacchus:
Dynamically Partitioning for Solving QBF.
SAT 2007: 215-229 |
| 2006 |
|---|
| 70 | | Horst Samulowitz,
Jessica Davies,
Fahiem Bacchus:
Preprocessing QBF.
CP 2006: 514-529 |
| 69 | | Fahiem Bacchus:
CSPs: Adding Structure to SAT.
SAT 2006: 10-10 |
| 68 | | Horst Samulowitz,
Fahiem Bacchus:
Binary Clause Reasoning in QBF.
SAT 2006: 353-367 |
| 2005 |
|---|
| 67 | | Fahiem Bacchus,
Toby Walsh:
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings
Springer 2005 |
| 66 | | George Katsirelos,
Fahiem Bacchus:
Generalized NoGoods in CSPs.
AAAI 2005: 390-396 |
| 65 | | Horst Samulowitz,
Fahiem Bacchus:
Using SAT in QBF.
CP 2005: 578-592 |
| 64 | | Fahiem Bacchus,
Toby Walsh:
Propagating Logical Combinations of Constraints.
IJCAI 2005: 35-40 |
| 2004 |
|---|
| 63 | | Christian Thiffault,
Fahiem Bacchus,
Toby Walsh:
Solving Non-clausal Formulas with DPLL Search.
CP 2004: 663-678 |
| 62 | | Nathanael Hyafil,
Fahiem Bacchus:
Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning.
ECAI 2004: 1033-1034 |
| 61 | | Ronald P. A. Petrick,
Fahiem Bacchus:
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing.
ICAPS 2004: 2-11 |
| 60 | | Ronald P. A. Petrick,
Fahiem Bacchus:
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing.
KR 2004: 613-622 |
| 59 | | Tian Sang,
Fahiem Bacchus,
Paul Beame,
Henry A. Kautz,
Toniann Pitassi:
Combining Component Caching and Clause Learning for Effective Model Counting.
SAT 2004 |
| 58 | | Christian Thiffault,
Fahiem Bacchus,
Toby Walsh:
Solving Non-clausal Formulas with DPLL search.
SAT 2004 |
| 2003 |
|---|
| 57 | | George Katsirelos,
Fahiem Bacchus:
Unrestricted Nogood Recording in CSP Search.
CP 2003: 873-877 |
| 56 | | Fahiem Bacchus,
Shannon Dalmao,
Toniann Pitassi:
Algorithms and Complexity Results for #SAT and Bayesian Inference.
FOCS 2003: 340-351 |
| 55 | | Nathanael Hyafil,
Fahiem Bacchus:
Conformant Probabilistic Planning via CSPs.
ICAPS 2003: 205-214 |
| 54 | | Adriana Lopez,
Fahiem Bacchus:
Generalizing GraphPlan by Formulating Planning as a CSP.
IJCAI 2003: 954-960 |
| 53 | | Fahiem Bacchus,
Jonathan Winter:
Effective Preprocessing with Hyper-Resolution and Equality Reduction.
SAT 2003: 341-355 |
| 52 | | Fahiem Bacchus,
Shannon Dalmao,
Toniann Pitassi:
Value Elimination: Bayesian Interence via Backtracking Search.
UAI 2003: 20-28 |
| 51 | | Fahiem Bacchus,
Adam J. Grove,
Joseph Y. Halpern,
Daphne Koller:
From Statistical Knowledge Bases to Degrees of Belief
CoRR cs.AI/0307056: (2003) |
| 50 | | Fahiem Bacchus,
Shannon Dalmao,
Toniann Pitassi:
DPLL with Caching: A new algorithm for #SAT and Bayesian Inference
Electronic Colloquium on Computational Complexity (ECCC) 10(003): (2003) |
| 49 | | Fahiem Bacchus:
The Power of Modeling - a Response to PDDL2.1.
J. Artif. Intell. Res. (JAIR) 20: 125-132 (2003) |
| 2002 |
|---|
| 48 | | Fahiem Bacchus:
Enhancing Davis Putnam with Extended Binary Clause Reasoning.
AAAI/IAAI 2002: 613-619 |
| 47 | | Ronald P. A. Petrick,
Fahiem Bacchus:
A Knowledge-Based Approach to Planning with Incomplete Information and Sensing.
AIPS 2002: 212-222 |
| 46 | | Fahiem Bacchus,
Xinguang Chen,
Peter van Beek,
Toby Walsh:
Binary vs. non-binary constraints.
Artif. Intell. 140(1/2): 1-37 (2002) |
| 2001 |
|---|
| 45 | | George Katsirelos,
Fahiem Bacchus:
GAC on Conjunctions of Constraints.
CP 2001: 610-614 |
| 44 | | Fahiem Bacchus,
Michael Ady:
Planning with Resources and Concurrency: A Forward Chaining Approach.
IJCAI 2001: 417-424 |
| 43 | | Craig Boutilier,
Fahiem Bacchus,
Ronen I. Brafman:
UCP-Networks: A Directed Graphical Representation of Conditional Utilities.
UAI 2001: 56-64 |
| 42 | | Fahiem Bacchus:
The AIPS '00 Planning Competition.
AI Magazine 22(3): 47-56 (2001) |
| 2000 |
|---|
| 41 | | Fahiem Bacchus:
Extending Forward Checking.
CP 2000: 35-51 |
| 40 | | Fahiem Bacchus,
Froduald Kabanza:
Using temporal logics to express search control knowledge for planning.
Artif. Intell. 116(1-2): 123-191 (2000) |
| 1999 |
|---|
| 39 | | Fahiem Bacchus,
Joseph Y. Halpern,
Hector J. Levesque:
Reasoning about Noisy Sensors and Effectors in the Situation Calculus.
Artif. Intell. 111(1-2): 171-208 (1999) |
| 1998 |
|---|
| 38 | | Fahiem Bacchus,
Peter van Beek:
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems.
AAAI/IAAI 1998: 310-318 |
| 37 | | Fahiem Bacchus,
Yee Whye Teh:
Making Forward Chaining Relevant.
AIPS 1998: 54-61 |
| 36 | | Fahiem Bacchus,
Ronald P. A. Petrick:
Modeling an Agent's Incomplete Knowledge During Planning and During Execution.
KR 1998: 432-443 |
| 35 | | Fahiem Bacchus,
Froduald Kabanza:
Planning for Temporally Extended Goals.
Ann. Math. Artif. Intell. 22(1-2): 5-27 (1998) |
| 34 | | Fahiem Bacchus,
Joseph Y. Halpern,
Hector J. Levesque:
Reasoning about Noisy Sensors and Effectors in the Situation Calculus
CoRR cs.AI/9809013: (1998) |
| 1997 |
|---|
| 33 | | Fahiem Bacchus,
Craig Boutilier,
Adam J. Grove:
Structured Solution Methods for Non-Markovian Decision Processes.
AAAI/IAAI 1997: 112-117 |
| 1996 |
|---|
| 32 | | Fahiem Bacchus,
Craig Boutilier,
Adam J. Grove:
Rewarding Behaviors.
AAAI/IAAI, Vol. 2 1996: 1160-1167 |
| 31 | | Fahiem Bacchus,
Froduald Kabanza:
Planning for Temporally Extended Goals.
AAAI/IAAI, Vol. 2 1996: 1215-1222 |
| 30 | | Fahiem Bacchus,
Adam J. Grove:
Utility Independence in a Qualitative Decision Theory.
KR 1996: 542-552 |
| 29 | | Fahiem Bacchus:
Using Temporal Logics for Planning and Control.
TIME 1996: 2-3 |
| 28 | | Fahiem Bacchus,
Adam J. Grove,
Joseph Y. Halpern,
Daphne Koller:
From Statistical Knowledge Bases to Degrees of Belief.
Artif. Intell. 87(1-2): 75-143 (1996) |
| 1995 |
|---|
| 27 | | Fahiem Bacchus,
Paul van Run:
Dynamic Variable Ordering in CSPs.
CP 1995: 258-275 |
| 26 | | Fahiem Bacchus,
Adam J. Grove:
On the Forward Checking Algorithm.
CP 1995: 292-308 |
| 25 | | Fahiem Bacchus,
Joseph Y. Halpern,
Hector J. Levesque:
Reasoning about Noisy Sensors in the Situation Calculus.
IJCAI 1995: 1933-1940 |
| 24 | | Fahiem Bacchus,
Joseph Y. Halpern,
Hector J. Levesque:
Reasoning about Noisy Sensors (and Effectors) in the Situation Calculus.
Reasoning with Uncertainty in Robotics 1995: 218-220 |
| 23 | | Fahiem Bacchus,
Adam J. Grove:
Graphical models for preference and utility.
UAI 1995: 3-10 |
| 1994 |
|---|
| 22 | | Fahiem Bacchus,
Adam J. Grove,
Joseph Y. Halpern,
Daphne Koller:
Forming Beliefs about a Changing World.
AAAI 1994: 222-229 |
| 21 | | Fahiem Bacchus,
Adam J. Grove,
Joseph Y. Halpern,
Daphne Koller:
Generating New Beliefs from Old.
UAI 1994: 37-45 |
| 20 | | Wai Lam,
Fahiem Bacchus:
Using New Data to Refine a Bayesian Network.
UAI 1994: 383-390 |
| 19 | | Fahiem Bacchus,
Qiang Yang:
Downward Refinement and the Efficiency of Hierarchical Problem Solving.
Artif. Intell. 71(1): 43-100 (1994) |
| 18 | | Fahiem Bacchus,
Adam J. Grove,
Joseph Y. Halpern,
Daphne Koller:
A Response to "Believing on the Basis of the Evidence".
Computational Intelligence 10: 21-25 (1994) |
| 17 | | Wai Lam,
Fahiem Bacchus:
Learning Bayesian Belief Networks: An Approach Based on the MDL Principle.
Computational Intelligence 10: 269-294 (1994) |
| 1993 |
|---|
| 16 | | Fahiem Bacchus,
Adam J. Grove,
Joseph Y. Halpern,
Daphne Koller:
Generating Degrees of Belief from Statistical Information: An Overview.
FSTTCS 1993: 318-325 |
| 15 | | Fahiem Bacchus,
Adam J. Grove,
Joseph Y. Halpern,
Daphne Koller:
Statistical Foundations for Default Reasoning.
IJCAI 1993: 563-569 |
| 14 | | Fahiem Bacchus:
Using First-Order Probability Logic for the Construction of Bayesian Networks.
UAI 1993: 219-226 |
| 13 | | Wai Lam,
Fahiem Bacchus:
Using Causal Information and Local Measures to Learn Bayesian Networks.
UAI 1993: 243-250 |
| 1992 |
|---|
| 12 | | Fahiem Bacchus,
Qiang Yang:
The Expected Value of Hierarchical Problem-Solving.
AAAI 1992: 369-374 |
| 11 | | Fahiem Bacchus,
Adam J. Grove,
Daphne Koller,
Joseph Y. Halpern:
From Statistics to Beliefs.
AAAI 1992: 602-608 |
| 1991 |
|---|
| 10 | | Fahiem Bacchus:
Default Reasoning From Statistics.
AAAI 1991: 392-398 |
| 9 | | Fahiem Bacchus,
Qiang Yang:
The Downward Refinement Property.
IJCAI 1991: 286-293 |
| 8 | | Fahiem Bacchus,
Josh D. Tenenberg,
Johannes A. G. M. Koomen:
A Non-Reified Temporal Logic.
Artif. Intell. 52(1): 87-108 (1991) |
| 1990 |
|---|
| 7 | | Fahiem Bacchus:
Probabilistic Belief Logics.
ECAI 1990: 59-64 |
| 6 | | Fahiem Bacchus:
Probability and logic: a reply to Cheeseman.
Computational Intelligence 6: 180-183 (1990) |
| 5 | | Fahiem Bacchus:
Lp, a logic for representing and reasoning with statistical knowledge.
Computational Intelligence 6: 209-231 (1990) |
| 1989 |
|---|
| 4 | | Fahiem Bacchus:
A Modest, but Semantically Well Founded, Inheritance Reasoner.
IJCAI 1989: 1104-1109 |
| 3 | | Fahiem Bacchus,
Josh D. Tenenberg,
Johannes A. G. M. Koomen:
A Non-Reified Temporal Logic.
KR 1989: 2-10 |
| 2 | | Fahiem Bacchus:
Lp: A Logic for Statistical Information.
UAI 1989: 3-14 |
| 1988 |
|---|
| 1 | | Fahiem Bacchus:
On probability distributions over possible worlds.
UAI 1988: 217-226 |
