Skip to main content
SpringerLink
Log in

Probabilistic Default Reasoning with Conditional Constraints

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We present an approach to reasoning from statistical and subjective knowledge, which is based on a combination of probabilistic reasoning from conditional constraints with approaches to default reasoning from conditional knowledge bases. More precisely, we introduce the notions of z-, lexicographic, and conditional entailment for conditional constraints, which are probabilistic generalizations of Pearl's entailment in system Z, Lehmann's lexicographic entailment, and Geffner's conditional entailment, respectively. We show that the new formalisms have nice properties. In particular, they show a similar behavior as reference-class reasoning in a number of uncontroversial examples. The new formalisms, however, also avoid many drawbacks of reference-class reasoning. More precisely, they can handle complex scenarios and even purely probabilistic subjective knowledge as input. Moreover, conclusions are drawn in a global way from all the available knowledge as a whole. We then show that the new formalisms also have nice general nonmonotonic properties. In detail, the new notions of z-, lexicographic, and conditional entailment have similar properties as their classical counterparts. In particular, they all satisfy the rationality postulates proposed by Kraus, Lehmann, and Magidor, and they have some general irrelevance and direct inference properties. Moreover, the new notions of z- and lexicographic entailment satisfy the property of rational monotonicity. Furthermore, the new notions of z-, lexicographic, and conditional entailment are proper generalizations of both their classical counterparts and the classical notion of logical entailment for conditional constraints. Finally, we provide algorithms for reasoning under the new formalisms, and we analyze its computational complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.W. Adams, The Logic of Conditionals, Synthese Library, Vol. 86 (Reidel, Dordrecht, 1975).

    Google Scholar 

  2. C.E. Alchourrón, P. Gärdenfors and D. Makinson, On the logic of theory change: Partial meet contraction and revision functions, J. Symbolic Logic 50 (1985) 510-530.

    Google Scholar 

  3. S. Amarger, D. Dubois and H. Prade, Constraint propagation with imprecise conditional probabilities, in: Proceedings UAI-91 (1991) pp. 26-34.

  4. F. Bacchus, A. Grove, J.Y. Halpern and D. Koller, Generating new beliefs from old, in: Proceedings UAI-94 (1994) pp. 37-45.

  5. F. Bacchus, A. Grove, J.Y. Halpern and D. Koller, A response to: believing on the basis of evidence, Comput. Intell. 10 (1994) 21-25.

    Google Scholar 

  6. F. Bacchus, A. Grove, J.Y. Halpern and D. Koller, From statistical knowledge bases to degrees of belief, Artif. Intell. 87 (1996) 75-143.

    Google Scholar 

  7. S. Benferhat, C. Cayrol, D. Dubois, J. Lang and H. Prade, Inconsistency management and prioritized syntax-based entailment, in: Proceedings IJCAI-93 (1993) pp. 640-645.

  8. S. Benferhat, D. Dubois and H. Prade, Representing default rules in possibilistic logic, in: Proceedings KR-92 (1992) pp. 673-684.

  9. S. Benferhat, D. Dubois and H. Prade, Nonmonotonic reasoning, conditional objects and possibility theory, Artif. Intell. 92(1-2) (1997) 259-276.

    Google Scholar 

  10. S. Benferhat, A. Saffiotti and P. Smets, Belief functions and default reasoning, Artif. Intell. 122(1-2) (2000) 1-69.

    Google Scholar 

  11. V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence: Complexity and algorithms, in: Proceedings ISIPTA-01 (2001) pp. 51-61.

  12. V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model theoretic probabilistic logic, and default reasoning, in: Proceedings ECSQARU-01 (2001) pp. 290-302.

  13. L. Blume, A. Brandenburger and E. Dekel, Lexicographic probabilities and choice under uncertainty, Econometrica 59(1) (1991) 61-79.

    Google Scholar 

  14. G. Boole, An Investigation of the Laws of Thought, on which are Founded the Mathematical Theories of Logic and Probabilities (Walton and Maberley, London, 1854). Reprint (Dover, New York, 1958).

    Google Scholar 

  15. R.A. Bourne and S. Parsons, Maximum entropy and variable strength defaults, in: Proceedings IJCAI-99 (1999) pp. 50-55.

  16. C. Boutilier, Unifying default reasoning and belief revision in a modal framework, Artif. Intell. 68 (1994) 33-85.

    Google Scholar 

  17. R. Carnap, Logical Foundations of Probability (University of Chicago Press, Chicago, 1950).

    Google Scholar 

  18. G. Coletti, Coherent numerical and ordinal probabilistic assessments, IEEE Trans. Systems Man Cybernet. 24(12) (1994) 1747-1754.

    Google Scholar 

  19. B. de Finetti, Theory of Probability (Wiley, New York, 1974).

    Google Scholar 

  20. D. Dubois and H. Prade, On fuzzy syllogisms, Comput. Intell. 4(2) (1988) 171-179.

    Google Scholar 

  21. D. Dubois and H. Prade, Possibilistic logic, preferential models, non-monotonicity and related issues, in: Proceedings IJCAI-91 (1991) pp. 419-424.

  22. D. Dubois and H. Prade, Conditional objects as non-monotonic consequence relationships, IEEE Trans. Systems Man Cybernet. 24 (1994) 1724-1740.

    Google Scholar 

  23. D. Dubois and H. Prade, Non-standard theories of uncertainty, in: Principles of Knowledge Representation, ed. G. Brewka (CSLI Publications, Stanford, 1996).

    Google Scholar 

  24. D. Dubois, H. Prade, L. Godo and R.L. de Màntaras, Qualitative reasoning with imprecise probabilities, J. Intell. Inform. Systems 2 (1993) 319-363.

    Google Scholar 

  25. D. Dubois, H. Prade and J.-M. Touscas, Inference with imprecise numerical quantifiers, in: Intelligent Systems, eds. Z.W. Ras and M. Zemankova (Ellis Horwood, Chichester, UK, 1990) chapter 3, pp. 53-72

    Google Scholar 

  26. T. Eiter and T. Lukasiewicz, Default reasoning from conditional knowledge bases: Complexity and tractable cases, Artif. Intell. 124(2) (2000) 169-241.

    Google Scholar 

  27. R. Fagin, J.Y. Halpern and N. Megiddo, A logic for reasoning about probabilities, Inf. Comput. 87 (1990) 78-128.

    Google Scholar 

  28. N. Friedman and J.Y. Halpern, Plausibility measures and default reasoning, J. ACM, to appear.

  29. A.M. Frisch and P. Haddawy, Anytime deduction for probabilistic logic, Artif. Intell. 69 (1994) 93-122.

    Google Scholar 

  30. D.M. Gabbay and P. Smets, eds., Handbook on Defeasible Reasoning and Uncertainty Management Systems (Kluwer Academic, Dordrecht, 1998).

    Google Scholar 

  31. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).

    Google Scholar 

  32. H. Geffner, Default Reasoning: Causal and Conditional Theories (MIT Press, Cambridge, MA, 1992).

    Google Scholar 

  33. H. Geffner and J. Pearl, Conditional entailment: bridging two approaches to default reasoning, Artif. Intell. 53(2-3) (1992) 209-244.

    Google Scholar 

  34. G. Georgakopoulos, D. Kavvadias and C.H. Papadimitriou, Probabilistic satisfiability, J. Complexity 4(1) (1988) 1-11.

    Google Scholar 

  35. A. Gilio, Probabilistic reasoning under coherence in system P, Ann. Math. Artif. Intell., to appear.

  36. A. Gilio, Probabilistic consistency of conditional probability bounds, in: Advances in Intelligent Computing, eds. B. Bouchon-Meunier, R.R. Yager and L.A. Zadeh, Lecture Notes in Computer Sciences, Vol. 945 (Springer, New York, 1995) pp. 200-209.

    Google Scholar 

  37. M. Goldszmidt, P. Morris and J. Pearl, A maximum entropy approach to non-monotonic reasoning, IEEE Trans. Pattern Anal. Mach. Intell. 15(3) (1993) 220-232.

    Google Scholar 

  38. M. Goldszmidt and J. Pearl, On the consistency of defeasible databases, Artif. Intell. 52(2) (1991) 121-149.

    Google Scholar 

  39. M. Goldszmidt and J. Pearl, Rank-based systems: A simple approach to belief revision, belief update and reasoning about evidence and actions, in: Proceedings KR-92 (1992) pp. 661-672.

  40. M. Goldszmidt and J. Pearl, Qualitative probabilities for default reasoning, belief revision, and causal modeling, Artif. Intell. 84(1-2) (1996) 57-112.

    Google Scholar 

  41. A. Grove, J.Y. Halpern and D. Koller, Random worlds and maximum entropy, J. Artif. Intell. Res. 2 (1994) 33-88.

    Google Scholar 

  42. T. Hailperin, Sentential Probability Logic: Origins, Development, Current Status, and Technical Applications (Associated University Presses, London, UK, 1996).

    Google Scholar 

  43. J. Heinsohn, Probabilistic description logics, in: Proceedings UAI-94 (1994) pp. 311-318.

  44. M. Jaeger, Probabilistic reasoning in terminological logics, in: Proceedings KR-94 (1994) pp. 305-306.

  45. B. Jaumard, P. Hansen and M.P. de Aragão, Column generation methods for probabilistic logic, ORSA J. Comput. 3 (1991) 135-147.

    Google Scholar 

  46. D.S. Johnson, A catalog of complexity classes, in: Handbook of Theoretical Computer Science, Vol. A, ed. J. van Leeuwen (MIT Press, Cambridge, MA, 1990) chapter 2, pp. 67-161.

    Google Scholar 

  47. S. Kraus, D. Lehmann and M. Magidor, Non-monotonic reasoning, preferential models and cumulative logics, Artif. Intell. 14(1) (1990) 167-207.

    Google Scholar 

  48. H.E. Kyburg, Jr., The Logical Foundations of Statistical Inference (Reidel, Dordrecht, 1974).

    Google Scholar 

  49. H.E. Kyburg, Jr., The reference class, Philos. Sci. 50 (1983) 374-397.

    Google Scholar 

  50. H.E. Kyburg, Jr., Evidential probability, in: Proceedings IJCAI-91 (1991) pp. 1196-1202.

  51. H.E. Kyburg, Jr., Combinatorial semantics: semantics for frequent validity, Comput. Intell. 13 (1997) 215-257.

    Google Scholar 

  52. H.E. Kyburg, Jr. and B. Murtezaoglu, A modification to evidential probability, in: Proceedings UAI-91 (1991) pp. 228-231.

  53. P. Lamarre, A promenade from monotonicity to non-monotonicity following a theorem prover, in: Proceedings KR-92 (1992) pp. 572-580.

  54. D. Lehmann, What does a conditional knowledge base entail?, in: Proceedings KR-89 (1989) pp. 212-222.

  55. D. Lehmann, Another perspective on default reasoning, Ann. Math. Artif. Intell. 15(1) (1995) 61-82.

    Google Scholar 

  56. D. Lehmann and M. Magidor, What does a conditional knowledge base entail?, Artif. Intell. 55(1) (1992) 1-60.

    Google Scholar 

  57. I. Levi, The Enterprise of Knowledge (MIT Press, Cambridge, MA, 1980).

    Google Scholar 

  58. R.P. Loui, Computing reference classes, in: Uncertainty in Artificial Intelligence 2, eds. L.N. Kanal and J.F. Lemmer (North-Holland, Amsterdam, 1988) pp. 273-289.

    Google Scholar 

  59. T. Lukasiewicz, Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events, Internat. J. Approx. Reasoning 21(1) (1999) 23-61.

    Google Scholar 

  60. T. Lukasiewicz, Many-valued disjunctive logic programs with probabilistic semantics, in: Proceedings of the 5th Internat. Conf. on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Inteligence, Vol. 1730 (Springer, Berlin, 1999) pp. 277-289.

    Google Scholar 

  61. T. Lukasiewicz, Probabilistic and truth-functional many-valued logic programming, in: Proceedings of the 29th IEEE Internat. Symposium on Multiple-Valued Logic (1999) pp. 236-241.

  62. T. Lukasiewicz, Probabilistic deduction with conditional constraints over basic events, J. Artif. Intell. Res. 10 (1999) 199-241.

    Google Scholar 

  63. T. Lukasiewicz, Probabilistic logic programming under inheritance with overriding, in: Proceedings UAI-01 (2001) pp. 329-336.

  64. T. Lukasiewicz, Probabilistic logic programming with conditional constraints, ACM Trans. Comput. Logic 2(3) (2001) 289-339.

    Google Scholar 

  65. C. Luo, C. Yu, J. Lobo, G. Wang and T. Pham, Computation of best bounds of probabilities from uncertain data, Comput. Intell. 12(4) (1996) 541-566.

    Google Scholar 

  66. R.T. Ng, Semantics, consistency, and query processing of empirical deductive databases, IEEE Trans. Knowl. Data Engrg. 9(1) (1997) 32-49.

    Google Scholar 

  67. N.J. Nilsson, Probabilistic logic, Artif. Intell. 28 (1986) 71-88.

    Google Scholar 

  68. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).

    Google Scholar 

  69. J. Pearl, Probabilistic semantics for nonmonotonic reasoning: A survey, in: Proceedings KR-89 (1989) pp. 505-516.

  70. J. Pearl, System Z: A natural ordering of defaults with tractable applications to default reasoning, in: Proceedings TARK-90 (1990) pp. 121-135.

  71. J. Pearl and M. Goldszmidt, Probabilistic foundations of reasoning with conditionals, in: Principles of Knowledge Representation, ed. G. Brewka (CSLI Publications, Stanford, CA, 1996).

    Google Scholar 

  72. J.L. Pollock, Nomic Probabilities and the Foundations of Induction (Oxford Univ. Press, Oxford, 1990).

    Google Scholar 

  73. H. Reichenbach, Theory of Probability (University of California Press, Berkeley, CA, 1949).

    Google Scholar 

  74. Y. Shoham, A semantical approach to nonmonotonic logics, in: Proceedings of the 2nd IEEE Symposium on Logic in Computer Science (1987) pp. 275-279.

  75. W. Spohn, Ordinal conditional functions: A dynamic theory of epistemic states, in: Causation in Decision, Belief Change, and Statistics, Vol. 2, eds. W. Harper and B. Skyrms (Reidel, Dordrecht, 1988) pp. 105-134.

    Google Scholar 

  76. H. Thöne, U. Güntzer and W. Kießling, Towards precision of probabilistic bounds propagation, in: Proceedings UAI-92 (1992) pp. 315-322.

Download references

Author information

Authors and Affiliations

  1. Institut und Ludwig Wittgenstein Labor für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, 1040, Wien, Austria

    Thomas Lukasiewicz

Authors
  1. Thomas Lukasiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lukasiewicz, T. Probabilistic Default Reasoning with Conditional Constraints. Annals of Mathematics and Artificial Intelligence 34, 35–88 (2002). https://doi.org/10.1023/A:1014445017537

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014445017537

Search

Navigation