Skip to main content

Enforcing Logically Weaker Knowledge in Classical Logic

  • Conference paper

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

Abstract

This paper is concerned with a fundamental issue in knowledge representation and reasoning that, surprisingly, has received little attention so far. The point is that inserting some logically weaker (but, in a sense, more precise) information within a logic-based representation is not a straightforward process if the extra information must prevail. Indeed, it does neither prevail by itself nor disable the already existing logically stronger (but less precise) information that subsumes it. A general framework for solving this problem is introduced and instantiated to the task of making some rules prevail over more general ones.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-25975-3_5
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   74.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-25975-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   99.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. SAT Live, http://www.satlive.org/

  2. Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning. LNCS. Springer, Heidelberg (2011)

    Google Scholar 

  3. SAT Competition (2011), http://www.satcompetition.org/2011/

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

    MathSciNet  CrossRef  MATH  Google Scholar 

  5. Besnard, P., Grégoire, É., Ramon, S.: Overriding Subsuming Rules. In: Liu, W. (ed.) ECSQARU 2011. LNCS, vol. 6717, pp. 532–544. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  6. Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence 57(2-3), 227–270 (1992)

    MathSciNet  CrossRef  MATH  Google Scholar 

  7. Fuhrmann, A., Hansson, S.O.: A survey of multiple contractions. Journal of Logic, Language and Information 3(1), 39–76 (1994)

    MathSciNet  CrossRef  MATH  Google Scholar 

  8. Grégoire, É.: Fusing cooperative technical-specification knowledge components. In: Proceedings of ICTAI 2002, pp. 535–542 (2002)

    Google Scholar 

  9. Grégoire, É.: Fusing cooperative technical-specification knowledge components. International Journal on Artificial Intelligence Tools 12(3), 265–278 (2003)

    MathSciNet  CrossRef  Google Scholar 

  10. Grégoire, É.: Knowledge refinement through revision. In: Proceedings of IEEE IRI 2007, pp. 285–290 (2007)

    Google Scholar 

  11. Grégoire, É., Mazure, B., Piette, C.: Local-search extraction of muses. Constraints 12(3), 325–344 (2007)

    MathSciNet  CrossRef  MATH  Google Scholar 

  12. Grégoire, É., Mazure, B., Piette, C.: Does This Set of Clauses Overlap with at Least One Mus? In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 100–115. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  13. Grégoire, É., Mazure, B., Piette, C.: Using local search to find msses and muses. European Journal of Operational Research 199(3), 640–646 (2009)

    CrossRef  MATH  Google Scholar 

  14. Moore, R.C.: The role of logic in knowledge representation and commonsense reasoning. In: Proceedings of AAAI 1982, pp. 428–433 (1982)

    Google Scholar 

  15. Newell, A.: The knowledge level. Artificial Intelligence 18(1), 87–127 (1982)

    MathSciNet  CrossRef  Google Scholar 

  16. Richards, B.L., Mooney, R.J.: Automated refinement of first-order horn-clause domain theories. Machine Learning 19(2), 95–131 (1995)

    Google Scholar 

  17. Wrobel, S.: First order theory refinement. In: Advances in Inductive Logic Programming, pp. 14–33. IOS Press, Amsterdam (1995)

    Google Scholar 

  18. Zhang, D., Grégoire, É.: Special issue on Managing and Reasoning in the Presence of Inconsistency. International Journal of Semantic Computing (to appear, 2011)

    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). Enforcing Logically Weaker Knowledge in Classical Logic. In: Xiong, H., Lee, W.B. (eds) Knowledge Science, Engineering and Management. KSEM 2011. Lecture Notes in Computer Science(), vol 7091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25975-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25975-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25974-6

  • Online ISBN: 978-3-642-25975-3

  • eBook Packages: Computer ScienceComputer Science (R0)