Skip to main content

Constructive Plausible Logic Is Relatively Consistent

  • Conference paper
AI 2003: Advances in Artificial Intelligence (AI 2003)

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

Included in the following conference series:

Abstract

An implemented, efficient, propositional non-monotonic logic, called Constructive Plausible Logic, is defined and explained. Several important properties enjoyed by this logic are stated. The most important property, relative consistency, means that whenever the set of axioms is consistent so is the set of all formulas proved using defeasible information. Hence the non-monotonic deduction mechanism is trustworthy. This is the first Plausible Logic which has been proved to be relatively consistent. Constructive disjunction is characterised by the property that a disjunction can be proved if and only if at least one of its disjuncts can be proved. Constructive Plausible Logic uses constructive disjunction. Moreover the ambiguity propagating proof algorithm is simpler than the one in Billington and Rock [4].

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. Antoniou, G., Billington, D.: Relating defeasible and default logic. In: Stumptner, M., Corbett, D.R., Brooks, M. (eds.) Canadian AI 2001. LNCS (LNAI), vol. 2256, pp. 13–24. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Billington, D.: Defeasible deduction with arbitrary propositions. In: Poster Proceedings of the 11th Australian Joint Conference on Artificial Intelligence, pp. 3–14. Griffith University, Brisbane (1998)

    Google Scholar 

  3. Billington, D.: Constructive Plausible Logic version 1.2 repository. Available from the author (2003)

    Google Scholar 

  4. Billington, D., Rock, A.: Propositional plausible logic: Introduction and implementation. Studia Logica 67, 243–269 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Maher, M.J., Rock, A., Antoniou, G., Billington, D., Miller, T.: Efficient defeasible reasoning systems. International Journal on Artificial Intelligence Tools 10(4), 483–501 (2001)

    Article  Google Scholar 

  6. Nute, D.: Defeasible reasoning. In: Proceedings of the 20th Hawaii International Conference on System Science, University of Hawaii, pp. 470–477 (1987)

    Google Scholar 

  7. Rock, A.: Deimos: A query answering Defeasible Logic system. Available from the author (2000)

    Google Scholar 

  8. Rock, A.: Phobos: A query answering Plausible Logic system. Available from the author (2000)

    Google Scholar 

  9. Rock, A.: Implementation of Constructive Plausible Logic (version 1.2). Available from the author (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Billington, D., Rock, A. (2003). Constructive Plausible Logic Is Relatively Consistent. In: Gedeon, T.(.D., Fung, L.C.C. (eds) AI 2003: Advances in Artificial Intelligence. AI 2003. Lecture Notes in Computer Science(), vol 2903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24581-0_82

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24581-0_82

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20646-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics