Skip to main content
SpringerLink
Log in

Connecting Lexicographic with Maximum Entropy Entailment

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1638))

  • 390 Accesses

Abstract

This paper reviews and relates two default reasoning mechanisms, lexicographic (lex) and maximum entropy (me) entailment. Meentailment requires that defaults be assigned specific strengths and it is shown that lex-entailment can be equated to me-entailment for a class of specific strength assignments. By clarifying the assumptions which underlie lex-entailment, it is argued that me-entailment is a superior method of handling default inference for reasons of both expressiveness and objective justification.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Adams. The Logic of Conditionals. Reidel, Dordrecht, Netherlands, 1975.

    MATH  Google Scholar 

  2. S. Benferhat, C. Cayrol, D. Dubois, J. Lang, and H. Prade. Inconsistency management and prioritized syntax-based entailment. In R. Bajcsy, editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 640–645. Morgan Kaufmann, 1993.

    Google Scholar 

  3. R. A. Bourne and S. Parsons. Maximum entropy and variable strength defaults. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999.

    Google Scholar 

  4. M. Goldszmidt, P. Morris, and J. Pearl. A maximum entropy approach to nonmonotonic reasoning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15:220–232, 1993.

    Article  Google Scholar 

  5. E. Jaynes. Where do we stand on maximum entropy? In R. Levine and M. Tribus, editors, The Maximum Entropy Formalism, pages 15–118, Cambridge, MA, 1979. MIT Press.

    Google Scholar 

  6. S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44:167–207, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  7. D. Lehmann. Another perspective on default reasoning. Annals of Mathematics and Artificial Intelligence, 15:61–82, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. Lehmann and M. Magidor. What does a conditional knowledge base entail? Artificial Intelligence, 55:1–60, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. Makinson. General theory of cumulative inference. In M. Reinfrank, J. de Kleer, M. L. Ginsberg, and E. Sandewall, editors, Lecture Notes in Artificial Intelligence 346, pages 1–18, Berlin, 1988. Springer.

    Google Scholar 

  10. J. Pearl. System Z: a natural ordering of defaults with tractable applications to default reasoning. In Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, pages 121–135, 1990.

    Google Scholar 

  11. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, Queen Mary and Westfield College, University of London, E1 4NS, London, UK

    Rachel A. Bourne & Simon Parsons

Authors
  1. Rachel A. Bourne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon Parsons
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK

    Anthony Hunter

  2. Department of Electronic Engineering, University of London, Queen Mary and Westfield College, E1 4NS, London, UK

    Simon Parsons

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bourne, R.A., Parsons, S. (1999). Connecting Lexicographic with Maximum Entropy Entailment. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48747-6_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66131-3

  • Online ISBN: 978-3-540-48747-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation