Skip to main content

Overriding Subsuming Rules

  • Conference paper

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

Abstract

This paper is concerned with intelligent agents that are able to perform nonmonotonic reasoning, not only with, but also about general rules with exceptions. More precisely, the focus is on enriching a knowledge base Γ with a general rule that is subsumed by another rule already there. Such a problem is important because evolving knowledge needs not follow logic as it is well-known from e.g. the belief revision paradigm. However, belief revision is mainly concerned with the case that the extra information logically conflicts with Γ. Otherwise, the extra knowledge is simply doomed to extend Γ with no change altogether. The problem here is different and may require a change in Γ even though no inconsistency arises. The idea is that when a rule is to be added, it might need to override any rule that subsumes it: preemption must take place. A formalism dedicated to reasoning with and about rules with exceptions is introduced. An approach to dealing with preemption over such rules is then developed.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Brass, S.: On the semantics of supernormal defaults. In: Thirteenth International Joint Conference on Artificial Intelligence (IJCAI 1993), pp. 578–583 (1993)

    Google Scholar 

  3. Pequeno, T., Buchsbaum, A.: The logic of epistemic inconsistency. In: Second International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), pp. 453–460 (1991)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Besnard, P., Grégoire, É., Ramon, S. (2011). Overriding Subsuming Rules. In: Liu, W. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2011. Lecture Notes in Computer Science(), vol 6717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22152-1_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22152-1_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22151-4

  • Online ISBN: 978-3-642-22152-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics