Skip to main content

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

  • 1130 Accesses

Abstract

The Lang-Marquis framework for reasoning in the presence of inconsistencies, which is based on the so-called forget operation, is generalized here. Despite extending the original proposal, a simpler structure is used. A notion of equivalence is introduced which is proven to provide extensionality for the framework. Some other formal properties are also given which illustrate the versatility of the definitions.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coste-Marquis, S., Lang, J., Liberatore, P., Marquis, P.: Expressive Power and Succinctness of Propositional Languages for Preference Representation. In: Proceedings of the 9th Conference on Knowledge Representation (KR 2004), pp. 203–212. Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  2. Delgrande, J.P., Schaub, T.: A consistency-based approach for belief change. Artificial Intelligence 151(1-2), 1–41 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Konieczny, S., Pérez, R.P.: On the Logic of Merging. In: Proceedings of the 6th Conference on Knowledge Representation (KR 1998), pp. 488–498. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  4. Lang, J., Marquis, P.: Resolving Inconsistencies by Variable Forgetting. In: Proceedings of the 8th Conference on Knowledge Representation (KR 2002), pp. 239–250. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  5. Lang, J., Liberatore, P., Marquis, P.: Propositional Independence: Formula-Variable Independence and Forgetting. Journal of Artificial Intelligence Research 18, 391–443 (2003)

    MATH  MathSciNet  Google Scholar 

  6. Lin, F.: On strongest necessary and weakest sufficient conditions. Artificial Intelligence 128(1-2), 143–159 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lin, F., Reiter, R.: Forget it? In: Proceedings of the AAAI Fall Symposium on Relevance, pp. 154–159 (1994)

    Google Scholar 

  8. Su, K., Guanfeng, L.v., Zhang, Y.: Reasoning about Knowledge by Variable Forgetting. In: Proceedings of the 9th Conference on Knowledge Representation (KR 2004). Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Besnard, P. (2005). Remedying Inconsistent Sets of Premises. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_37

Download citation

  • DOI: https://doi.org/10.1007/11518655_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27326-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics