My home page
My group
Professional activities

Daphne Koller Publications

First-order conditional logic for default reasoning revisited (2000)

by N. Friedman, J.Y. Halpern, and D. Koller
[older version, 1996]

Abstract: Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to confound statistical conditionals over the domain (such as "most birds fly"), and subjective conditionals over possible worlds (such as "I believe that Tweety is unlikely to fly"). We then address the issue of ascribing semantics to first-order conditional logic. As in the propositional case, there are many possible semantics. To study the problem in a coherent way, we use plausibility structures. These provide us with a general framework in which many of the standard approaches can be embedded. We show that while these standard approaches are all the same at the propositional level, they are significantly different in the context of a first-order language. Furthermore, we show that plausibilities provide the most natural extension of conditional logic to the first-order case: We provide a sound and complete axiomatization that contains only the KLM properties and standard axioms of first-order modal logic. We show that most of the other approaches have additional properties, which result in an inappropriate treatment of an infinitary version of the lottery paradox.

Download Information

N. Friedman, J.Y. Halpern, and D. Koller (2000). "First-order conditional logic for default reasoning revisited." ACM Transactions on Computational Logic, 2(1), 175-207. Full version of AAAI '96 paper. pdf

Bibtex citation

  title = {First-order conditional logic for default reasoning revisited},
  author = {N. Friedman and J.Y. Halpern and D. Koller},
  journal = {ACM Transactions on Computational Logic},
  volume = 2,
  number = 1,
  month = {October},
  year = 2000,
  pages = {175--207},
  note = {Full version of AAAI '96 paper},

full list
Click to go to robotics Click to go to theory Click to go to CS Stanford Click to go to Stanford's Webpage
home | biography | research | papers | my group
courses | professional activities | FAQ | personal