10 found
Order:
  1.  45
    Against Conditionalization.Fahiem Bacchus, Henry E. Kyburg & Mariam Thalos - 1990 - Synthese 85 (3):475-506.
  2.  17
    From statistical knowledge bases to degrees of belief.Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern & Daphne Koller - 1996 - Artificial Intelligence 87 (1-2):75-143.
  3.  11
    Using temporal logics to express search control knowledge for planning.Fahiem Bacchus & Froduald Kabanza - 2000 - Artificial Intelligence 116 (1-2):123-191.
  4.  24
    Reasoning about noisy sensors and effectors in the situation calculus.Fahiem Bacchus, Joseph Y. Halpern & Hector J. Levesque - 1999 - Artificial Intelligence 111 (1-2):171-208.
  5.  19
    Downward refinement and the efficiency of hierarchical problem solving.Fahiem Bacchus & Qiang Yang - 1994 - Artificial Intelligence 71 (1):43-100.
  6.  15
    A heuristic search approach to planning with temporally extended preferences.Jorge A. Baier, Fahiem Bacchus & Sheila A. McIlraith - 2009 - Artificial Intelligence 173 (5-6):593-618.
  7.  12
    A non-reified temporal logic.Fahiem Bacchus, Josh Tenenberg & Johannes A. Koomen - 1991 - Artificial Intelligence 52 (1):87-108.
  8.  17
    Binary vs. non-binary constraints☆☆This paper includes results that first appeared in [1,4,23]. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program. [REVIEW]Fahiem Bacchus, Xinguang Chen, Peter van Beek & Toby Walsh - 2002 - Artificial Intelligence 140 (1-2):1-37.
  9.  11
    (1 other version)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. [REVIEW]Fahiem Bacchus - 1999 - Journal of Symbolic Logic 64 (1):404-405.
  10.  27
    Theory and applications of satisfiability testing: 8th international conference, SAT 2005, St Andrews, UK, June 19-23, 2005: proceedings.Fahiem Bacchus & Toby Walsh (eds.) - 2005 - New York: Springer.
    This book constitutes the refereed proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing, SAT 2005, held in St Andrews, Scotland in June 2005. The 26 revised full papers presented together with 16 revised short papers presented as posters during the technical programme were carefully selected from 73 submissions. The whole spectrum of research in propositional and quantified Boolean formula satisfiability testing is covered including proof systems, search techniques, probabilistic analysis of algorithms and their properties, problem (...)
    Direct download  
     
    Export citation  
     
    Bookmark