Academia.eduAcademia.edu

Outline

Abductive Logics in a Belief Revision Framework

2005, Journal of Logic, Language and Information

Abstract

Abduction was first introduced in the epistemological context of scientific discovery. It was more recently analyzed in artificial intelligence, especially with respect to diagnosis analysis or ordinary reasoning. These two fields share a common view of abduction as a general process of hypotheses formation. More precisely, abduction is conceived as a kind of reverse explanation where a hypothesis H can be abduced from events E if H is a “good explanation” of E. The paper surveys four known schemes for abduction that can be used in both fields. Its first contribution is a taxonomy of these schemes according to a common semantic framework based on belief revision. Its second contribution is to produce, for each non-trivial scheme, a representation theorem linking its semantic framework to a set of postulates. Its third contribution is to present semantic and axiomatic arguments in favor of one of these schemes, “ordered abduction,” which has never been vindicated in the literature.

References (27)

  1. B1': trivial because for every world w, K*w=w. B2: let E ! F and H ! G i.e. F⊆ K*E and G⊆ K*H. From A45: K*(E∪H) = K*E or K*H or (K*E∪K*H). Hence F⊆ K*(E∪H) or G ⊆ K*(E∪H) hence E∪H ! F or E∪H ! G. B3: If H⊆ K*E then H⊆ E because K*E⊆ E by A2. B4: trivial. B5: If E H and E ! G then H⊆ K*E and G⊆ K*E. Then G∪H⊆ K*E hence E ! G∪H. B6: Assume ∅ ≠ H⊆ K*E and H⊆ F. Then H⊆ K*E∩F. By A4: K*E ∩ F⊆ K(*E∩F). Hence H⊆K*(E∩F). B7: Assume G⊆K*E, G⊆F, H⊆K*(E∩F). By A5, K*(E∩F) ⊆ K*E ∩ F. Hence H⊆K*E. Theorem 2: Let ! be a non reflexive inference relation satisfying the axiom system B NR = {B0, B1', B2, B3, B4, B5, B6, B7}. Then the operation * defined by K*E = ∪H, E ! H (union of all events abduced from E) where we set K=K*T, respects the axiom system A={A1, A2, A3, A4, A5} and therefore it is a revision function. Moreover, (E ! H) ≡ (∅ ≠ H ⊆ K*E) and K*E = {w: E ! w}. Proof: a) We show first that (E ! H) ≡ (∅ ≠ H ⊆ K*E). If sense: If ∅≠H⊆ K*E then E ! H. Let Abd(E) be the set of events abduced from E. By B5, Abd(E) is closed under union. By B4, Abd(E) is closed under the sub-set operation.
  2. Let ∅≠H⊆ K*E. There exists a family {F i } of elements from Abd(E) such as H⊆∪F i . Now ∪F i ∈Abd(E) and since Abd(E) is closed under sub-set operation H∈Abd(E) hence E ! H. Only if sense: If E ! H then ∅≠H⊆ K*E. Trivial from the definition of K*E and B0.
  3. Let's show now that K*E = {w, E ! w}. Let w be abduced from E. Then {w}⊆ K*E hence w∈K*E. Vice versa, let w∈K*E, hence there exist H such as E ! H and {w}⊆H hence by B4, E ! {w}.
  4. We can now prove that * is a revision function satisfying the axioms A1 to A5: A1: Assume E≠∅. If E is a single world then E ! E and K*E=E≠∅. If E contains more than a world, let E = ∪w i , i∈I with I = {1, 2, ….}. Now, w i ! w i for every i by B1'. REFERENCES
  5. ALCHOURRON, C. E., GÄRDENFORS, P., MAKINSON, D., (1985): On the logic of theory change: partial meet contraction and revision functions, Journal of Symbolic Logic, 50, 510-530.
  6. BOUTILIER, C., BECHER, V. (1995): Abduction as Belief Revision, Artificial Intelligence, 77(1), 43-94.
  7. CIALDEA MAYER, M., PIRRI, F. (1996): Abduction is not Deduction-in-Reverse, Journal of the IGPI, 4(1), 1-14.
  8. DARWICHE, A., PEARL, J. (1997): On the logic of iterared belief revision, Artificial Intelligence, 89, 1-29.
  9. DENECKER, M., KAKAS, A. (2001): Abduction in Logic Programming, in Computational Logic : Logic Progamming and Beyond (in honour of Robert A. Kowalski), Lectures Notes in Artificial Springer Verlag.
  10. FLACH, P. (1996): Rationality Postulates for Induction, TARK VI, Sixth Conference on Theoretical Aspects of Rationality and Knowledge, Morgan Kaufmann.
  11. FLACH, P., KAKAS, A. (2000): Abduction and induction, Kluwer.
  12. van FRAASSEN, B.C. (1980): The Scientific Image, Oxford University Press.
  13. HARMAN, G.H. (1978): The inference to the best explanation, Philosophical Review, 71, 88-95.
  14. HEMPEL, C.G. (1965): Aspects of scientific explanation and other essays in the philosophy of science, The Free Press.
  15. HEMPEL, C.G. (1988): A Problem Concerning the Inferential Function of Scientific Theories, in A.Grünbaum and W.C.Salmon eds. The Limitations of Deductivism, University of California Press.
  16. KRAUS, S., LEHMANN D., MAGIDOR, M. (1990): Non monotonic reasoning, preferential models and cumulative logics, Artificial Intelligence , 44,167-208.
  17. LEHMANN D., MAGIDOR, M. (1992): What does a conditional base entail ? Artificial Intelligence, 55, 1-60.
  18. LEVI, I. (1979): Abduction and Demands for Information, in I.Niinuloto and R.Tuomela eds. The Logic and Epistemology of Scientific Change, Northe Holland for Societas Philosophica Fennica, Amsterdam, 405-29. Reprinted in I.Levi, Decisions and Revisions, Cambridge University Press, 1984.
  19. LIPTON, P. (1991): Inference to the best explanation, Routledge.
  20. LOBO, J., UZCATEGUI, C. (1997): Abductive consequence relations, Artificial Intelligence, 89, 149-171.
  21. PEIRCE, C. S. (1931-1958): Collected papers of Charles Sanders Peirce, ed. by C. Hartshorne & P. Weiss, Harvard University Press.
  22. PINO-PEREZ, R., UZCATEGUI, C. (1999): Jumping to explanations versus jumping to conclusions, Artificial Intelligence, 111, 131-169.
  23. POPPER, K.R. (1959): The Logic of Scientific Discovery, Hutchinson & Co.
  24. RESCHER, N. (1978): Peirce's philosophy of science: Critical studies in his theory of induction and scientific method, University of Notre Dame Press.
  25. STALNAKER, R. (1968): A theory of conditionals, in N.Rescher ed., Philosophical Quarterly Monograph Series, 2, Basil Blackwell.
  26. THAGARD, P. (1978): The best explanation: criteria for theory choice, Journal of Philosophy, 75, 76-92.
  27. ZWIRN D., ZWIRN H. (1996): Metaconfirmation, Theory and Decision, 3, 195-228.