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