Fahiem Bacchus

Q: What Schools Are Affiliated With Fahiem Bacchus

Fahiem Bacchus is affiliated with the following schools: Simon Fraser University, University of Waterloo, University of British Columbia, University of Alberta, University of the West Indies, University of Toronto, University of Rochester

Fahiem Bacchus's AcademicInfluence.com Rankings

Fahiem Bacchus

Computer Science

#4979

World Rank

#5259

Historical Rank

Database

#7193

World Rank

#7441

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Fahiem Bacchus's Degrees

Bachelors Computer Science University of the West Indies

Similar Degrees You Can Earn

Why Is Fahiem Bacchus Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Fahiem Bacchus was a Canadian professor of computer science at the University of Toronto and a fellow of the Association for the Advancement of Artificial Intelligence . Early life and career Fahiem Bacchus was born in 1957. In 1979 he graduated with a Bachelor of Science degree in computer science from the University of Alberta. After working in industry for a couple of years he returned to academic pursuits and in 1983 received a Master of Science degree in mathematics from the University of Toronto. A year later he returned to the University of Alberta and graduated from there with a Ph.D. in computer science in 1988. Immediately after graduation he became a postdoc at the University of Rochester and in July of the same year he became an assistant professor at the University of Waterloo, achieving the rank of professor in 1999. He moved to the University of Toronto in 1999 and has been a professor in the department of computer science since then.

(See a Problem?)

Fahiem Bacchus's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

LEARNING BAYESIAN BELIEF NETWORKS: AN APPROACH BASED ON THE MDL PRINCIPLE (1994) (890)
Using temporal logics to express search control knowledge for planning (2000) (662)
Representing and reasoning with probabilistic knowledge (1988) (299)
A Knowledge-Based Approach to Planning with Incomplete Information and Sensing (2002) (272)
Planning for temporally extended goals (1996) (251)
Graphical models for preference and utility (1995) (250)
From Statistical Knowledge Bases to Degrees of Belief (1996) (249)
Representing and reasoning with probabilistic knowledge - a logical approach to probabilities (1991) (245)
UCP-Networks: A Directed Graphical Representation of Conditional Utilities (2001) (242)
Combining Component Caching and Clause Learning for Effective Model Counting (2004) (242)
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing (2004) (194)
Algorithms and complexity results for #SAT and Bayesian inference (2003) (160)
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances (2011) (154)
A Heuristic Search Approach to Planning with Temporally Extended Preferences (2007) (154)
Effective Preprocessing with Hyper-Resolution and Equality Reduction (2003) (149)
Using temporal logic to control search in a forward chaining planner (1996) (147)
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems (1998) (146)
Maximum Satisfiability Using Core-Guided MaxSAT Resolution (2014) (140)
The AIPS '00 Planning Competition (2001) (126)
Planning with Resources and Concurrency: A Forward Chaining Approach (2001) (125)
AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems (2001) (124)
Downward Refinement and the Efficiency of Hierarchical Problem Solving (1994) (123)
Dynamic Variable Ordering in CSPs (1995) (115)
Reasoning about Noisy Sensors (and Effectors) in the Situation Calculus (1995) (113)
Generalized NoGoods in CSPs (2005) (112)
Reasoning about Noisy Sensors in the Situation Calculus (1995) (110)
Rewarding Behaviors (1996) (104)
Exploiting the Power of mip Solvers in maxsat (2013) (102)
Enhancing Davis Putnam with extended binary clause reasoning (2002) (101)
Reasoning about Noisy Sensors and Effectors in the Situation Calculus (1999) (99)
Lp, a logic for representing and reasoning with statistical knowledge (1990) (98)
Generalizing GraphPlan by Formulating Planning as a CSP (2003) (97)
Solving Non-clausal Formulas with DPLL search (2004) (96)
Using Causal Information and Local Measures to Learn Bayesian Networks (1993) (91)
Solving #SAT and Bayesian Inference with Backtracking Search (2014) (89)
From Statistics to Beliefs (1992) (84)
Utility Independence in a Qualitative Decision Theory (1996) (76)
Value Elimination: Bayesian Interence via Backtracking Search (2002) (74)
Statistical Foundations for Default Reasoning (1993) (72)
Using New Data to Refine a Bayesian Network (1994) (71)
Postponing Optimization to Speed Up MAXSAT Solving (2013) (71)
A Non-Reified Temporal Logic (1989) (71)
Binary vs. non-binary constraints (2002) (70)
GAC Via Unit Propagation (2007) (66)
A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas (2011) (66)
Clause Learning Can Effectively P-Simulate General Propositional Resolution (2008) (61)
On the conversion between non-binary constraint satisfaction problems (1998) (58)
Unrestricted Nogood Recording in CSP Search (2003) (55)
Preprocessing QBF (2006) (52)
On the Forward Checking Algorithm (1995) (51)
Using SAT in QBF (2005) (51)
Structured Solution Methods for Non-Markovian Decision Processes (1997) (47)
A Modest, but Semantically Well Founded, Inheritance Reasoner (1989) (45)
Binary Clause Reasoning in QBF (2006) (44)
Conformant Probabilistic Planning via CSPs (2003) (44)
Extending Forward Checking (2000) (42)
The Downward Refinement Property (1991) (41)
Using First-Order Probability Logic for the Construction of Bayesian Networks (1993) (40)
DPLL with Caching: A new algorithm for #SAT and Bayesian Inference (2003) (37)
Relaxation Search: A Simple Way of Managing Optional Clauses (2014) (37)
Exploiting QBF Duality on a Circuit Representation (2010) (36)
MAXSAT Heuristics for Cost Optimal Planning (2012) (35)
The Expected Value of Hierarchical Problem-Solving (1992) (35)
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination (2015) (34)
MaxSAT Evaluation 2017: Solver and Benchmark Descriptions (2017) (32)
Propagating Logical Combinations of Constraints (2005) (32)
Beyond CNF: A Circuit-Based QBF Solver (2009) (31)
Modeling an Agent's Incomplete Knowledge During Planning and During Execution (1998) (31)
Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets (2015) (31)
SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples (2015) (30)
On probability distributions over possible worlds (2013) (29)
Towards Completely Lifted Search-based Probabilistic Inference (2011) (28)
Recovering and Utilizing Partial Duality in QBF (2013) (26)
Finding a Collection of MUSes Incrementally (2016) (25)
Exploring the Computational Tradeoff of more Reasoning and Less Searching (2002) (24)
Modeling an Agent ’ s Incomplete Knowledge during Planning and Execution (1998) (24)
Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002) (2002) (22)
Generating New Beliefs from Old (1994) (21)
Against conditionalization (2004) (21)
Reduced Cost Fixing in MaxSAT (2017) (19)
Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning (2004) (19)
Making Forward Chaining Relevant (1998) (19)
Solving Games without Controllable Predecessor (2014) (18)
Using Expectation Maximization to Find Likely Assignments for Solving CSP's (2007) (18)
Using More Reasoning to Improve #SAT Solving (2007) (18)
Symmetric Component Caching (2007) (16)
MaxSAT Evaluation 2018: New Developments and Detailed Results (2019) (16)
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (2018) (16)
GAC on Conjunctions of Constraints (2001) (13)
PKS: Knowledge-Based Planning with Incomplete Information and Sensing (2004) (12)
Forming Beliefs about a Changing World (1994) (12)
The Power of Modeling - a Response to PDDL2.1 (2003) (12)
Speeding Up Assumption-Based SAT (2019) (11)
Dynamically Partitioning for Solving QBF (2007) (11)
Exploiting Decomposition on Constraint Problems with High Tree-Width (2009) (10)
Solution Directed Backjumping for QCSP (2007) (10)
Probabilistic Belief Logics (1990) (10)
Exploiting Decomposition in Constraint Optimization Problems (2008) (10)
Cores in Core Based MaxSat Algorithms: An Analysis (2014) (10)
Solving Weighted CSPs by Successive Relaxations (2013) (9)
Abstract Cores in Implicit Hitting Set MaxSat Solving (2020) (9)
Clause Size Reduction with all-UIP Learning (2020) (9)
Using Learnt Clauses in maxsat (2010) (8)
Reasoning with Conditional Plans in the Presence of Incomplete Knowledge (2003) (8)
Exploiting Circuit Representations in QBF Solving (2010) (8)
Independence and Qualitative Decision Theory (1996) (8)
Learning Branching Heuristics for Propositional Model Counting (2020) (8)
CSPs: Adding Structure to SAT (2006) (8)
MaxSAT Evaluation 2017 (2017) (7)
Set Branching in Constraint Optimization (2009) (7)
Reduced Cost Fixing for Maximum Satisfiability (2018) (7)
Looking Forward in Constraint Satisfaction Algorithms (1999) (7)
Strategy-Proofness in the Stable Matching Problem with Couples (2016) (7)
Default Reasoning From Statistics (1991) (6)
A Constraint Algebra (2004) (6)
Leveraging dominators for preprocessing QBF (2010) (6)
Precondition Control (2007) (6)
Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing (2005) (5)
Off the Trail: Re-examining the CDCL Algorithm (2012) (5)
MaxSAT Evaluation 2018 (2018) (4)
A RESPONSE TO “BELIEVING ON THE BASIS OF THE EVIDENCE” (1994) (4)
Lp: A Logic for Statistical Information (2013) (4)
Trail Saving on Backtrack (2020) (4)
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings (2005) (4)
Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (2005) (2012) (3)
Maximum Satisfiabiliy (2021) (3)
Generating Degrees of Belief from Statistical Information: An Overview (1993) (3)
Distributional Importance Sampling for Approximate Weighted Model Counting (2008) (3)
A Heterogeneous Inheritance System Based on Probabilities (1988) (3)
Theory and Applications of Satisfiability Testing: 8th International Conference, SAT 2005, St Andrews, Scotland, June 19-23, 2005, Proceedings (Lecture Notes in Computer Science) (2005) (2)
Exploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples (2015) (2)
Learning Clause Deletion Heuristics with Reinforcement Learning (2020) (2)
Planning with Temporally Extended Preferences by Heuristic Search (2)
Planning for Temporally Extended (1996) (2)
A Uniform View of Backtracking (2007) (2)
Maximum Satisfiability (2017) (1)
System Demonstration at the International Conference on Automated Planning and Scheduling (ICAPS 2004) (2004) (1)
Learning and refining bayesian network structures from data (1994) (1)
Proceedings of the ICAPS 2003 Workshop on Planning under Uncertainty and Incomplete Information (2003) (1)
Modeling an Agent ' s Incomplete Knowledge during Planning andExecutionFahiem (1998) (1)
Inner and Outer Boundaries of Literals A Mechanism for Computing Domain Specific Information (2000) (1)
Computing Domain Specific Information (1999) (1)
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract) (2021) (1)
Using Expectation Maximization to Find Likely Assignments for Solving Constraint Satisfaction Problems (2007) (1)
Applying Decision Theory to Reactive Planning∗ (1994) (1)
Using temporal logics for planning and control (1996) (1)
Caching in Backtracking Search (2007) (0)
Anil Nerode and Richard A. Shore. Logic for applications . Texts and monographs in computer science. Springer-Verlag, New York, Berlin, Heidelberg, etc., 1993, xvii + 365 pp. (1999) (0)
Default Inferences From Statistical Knowledge (2007) (0)
Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR 1998) (1998) (0)
Table Constraints in Clause Learning CSP Solver (2013) (0)
Uncertainty in artificial intelligence : proceedings of the Twenty-first Conference (2005) : July 26-29, 2005, Edinburgh, Scotland (2005) (0)
Artificial intelligence software competitions: boon or bane? (2001) (0)
AD-A 250 599 MA 81992 A Heterogeneous Inheritance System Based on Probabilities (0)
Probability and logic: a reply to Cheeseman 1 (1990) (0)
Evaluating First Order Formulas — the foundation for a general Search Engine (2007) (0)
Reduced Cost Fixing for Maximum Satisfiability Bacchus , Fahiem (0)
Large Neighbourhood Search for Anytime MaxSAT Solving (2022) (0)
Preface (2011) (0)
IJCAI-07 Reviewers (2007) (0)
Cost-Sensitive Concurrent Planning Under Duration Uncertainty for Service-Level Agreements (2011) (0)
C On Probability Distributions Over Possible Worlds (0)
Review: Anil Nerode, Richard A. Shore, Logic for Applications (1999) (0)

This paper list is powered by the following services:

Other Resources About Fahiem Bacchus

What Schools Are Affiliated With Fahiem Bacchus?

Fahiem Bacchus is affiliated with the following schools:

Fahiem Bacchus's Academic­Influence.com Rankings