Rational Default Quantifier Logic

A canonical framework for monotonic reasoning about first-order default knowledge Extended abstract
  • Emil Weydert
Accepted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1244)


We introduce a powerful new framework for monotonic reasoning about general first-order default knowledge. It is based on an extension of standard predicate logic with a new generalized quantifier, called the rational default quantifier, whose meaning is grasped by quasi-probabilistic κπ-ranking measure constraints over product domains. It subsumes and refines the original propositional notion of a rational default conditional, admits a sound and complete axiomatization, RDQ, and overcomes some basic problems of other first-order conditional approaches.


Predicate Logic Rational Default Ranking Measure Nonmonotonic Reasoning Default Reasoning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Alechina 95]
    N. Alechina. For all typical. In Proceedings of ECSQARU 95. Springer.Google Scholar
  2. [Asher and Morreau 91a]
    N. Asher, M. Morreau. Commonsense entailment: a modal theory of nonmonotonic reasoning. In Logics in AI, ed. J. van Eijck. Springer.Google Scholar
  3. [Asher and Morreau 91b]
    N. Asher, M. Morreau. Commonsense entailment: a modal theory of nonmonotonic reasoning. In Proceedings of the 12th. IJCAI. Morgan Kaufmann.Google Scholar
  4. [Baader and Schlechta 93]
    F. Baader, K. Schlechta. A semantics for open normal defaults via a modified preferential approach. In Proceedings of ECSQARU 93.. Springer.Google Scholar
  5. [Bacchus 90]
    F. Bacchus. Representing and Reasoning with Probabilistic Knowledge. MIT-Press, Cambridge, Massachusetts.Google Scholar
  6. [Barwise and Feferman 85]
    J. Barwise, S. Feferman (eds.). Model-theoretic Logics.. Omega-series, Springer.Google Scholar
  7. [Boutilier 94]
    C. Boutilier. Conditional logics of normality: a modal approach. Artificial intelligence, 68:87–154, 1994.Google Scholar
  8. [Brafman 91]
    R. Brafman. A logic of normality: Predicate calculus incorporating assertions. Master's thesis, Hebrew University of Jerusalem, 1991.Google Scholar
  9. [Brafinan 96]
    R. Brafinan. “Statistical” First Order conditionals. In Proceedings of the Fifth Conference on the Principles of Knowledge Representation and reasoning KR 96. Morgan Kaufmann.Google Scholar
  10. [Delgrande 88]
    J. Delgrande. An approach to default reasoning based on a first-order conditional logic: a revised report. Artificial Intelligence, 36:63–90, 1988.Google Scholar
  11. [GMP 90]
    M. Goldszmidt, P. Morris, J. Pearl. A maximum entropy approach to nonmonotonic reasoning. In Proceedings of AAAI 90. Morgan Kaufmann.Google Scholar
  12. [FHK 96]
    N. Friedman, J.Y. Halpern, D. Koller. First-order conditional logic revisited. In Proceedings of AAAI 96, Morgan Kaufmann.Google Scholar
  13. [KLM 90]
    S. Kraus, D. Lehmann, M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44: 167–207, 1990.Google Scholar
  14. [Lehmann and Magidor 90]
    D. Lehmann, M. Magidor. Preferential logics: the predicate logical case. In Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge TARK 1990, ed. R. Parikh. Morgan Kaufmann.Google Scholar
  15. [Lorenz 89]
    S. Lorenz. Skeptical reasoning with order-sorted defaults. In Proceedings of the Workshop on Nonmonotonic Reasoning, eds. G. Brewka, H. Freitag, TR 443, GMD, Sankt Augustin, Germany, 1989.Google Scholar
  16. [Morreau 92]
    M. Morreau. Conditionals in Philosophy and Artificial Intelligence. Working papers of the SFB 340, Report 26, Stuttgart, 1992.Google Scholar
  17. [Pearl 89]
    J. Pearl. Probabilistic semantics for nonmonotonic reasoning: a survey. In KR 89, Morgan Kaufmann.Google Scholar
  18. [Schlechta 90]
    K. Schlechta. Semantics for defeasible inheritance. In Proceedings of ECAI 90, ed. L.G. Aiello, Pitman, London.Google Scholar
  19. [Schlechta 92]
    K. Schlechta. Results on Nonmonotonic Logics. IWBS-Report 204.Google Scholar
  20. [Schlechta 95]
    K. Schlechta. Defaults as generalized quantifiers. Journal of Logic and Computation, 5 (4), 473–494, 1995.Google Scholar
  21. [Spohn 88]
    W. Spohn. Ordinal conditional functions: A dynamic theory of epistemic states. In Causation in Decision, Belief Change and Statistics, W.L. Harper, B. Skyrms (eds.). Kluwer Academic Publishers, Dordrecht, 1988.Google Scholar
  22. [Westerstahl 89]
    D. Westerstahl. Quantifiers in formal and natural languages. In Handbook of Philosophical Logic, Vol. IV, eds. D. Gabbay and F. Guenthner. Kluwer, 1989.Google Scholar
  23. [Weydert 91]
    E. Weydert. Qualitative magnitude reasoning. Towards a new syntax and semantics for default reasoning. In Nonmonotonic and Inductive Logics, eds. Dix, Jantke, Schmitt. Springer, 1991.Google Scholar
  24. [Weydert 93]
    E. Weydert. Default quantifiers. About plausible reasoning in first-order contexts. Proceedings of the Dutch-German Workshop on Nonmonotonic Reasoning Techniques and Applications, Aachen, 1993.Google Scholar
  25. [Weydert 94]
    E. Weydert. General belief measures. In Tenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 1994.Google Scholar
  26. [Weydert 96a]
    E. Weydert. System J — Revision entailment. Default reasoning through ranking measure updates. In Proceedings of the First Conference on Formal and Applied Practical Reasoning, Bonn 1996, Springer-Verlag.Google Scholar
  27. [Weydert 96b]
    E. Weydert. Default Quantifier Logic. In Proceedings of the ECAI 96 Workshop on Integrating Nonmonotonicity into Automated reasoning systems.Google Scholar
  28. [Weydert 97]
    E. Weydert. Qualitative Entropy Maximization. Proceedings of the Third Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications, eds. G. Brewka et al., MPI for Computer Science, Saarbrücken, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Emil Weydert
    • 1
  1. 1.Max-Planck-Institute for Computer ScienceIm StadtwaldGermany

Personalised recommendations