Skip to main content
SpringerLink
Log in

A Fixed-Point Semantics for Plausible Logic

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

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

Included in the following conference series:

  • 1751 Accesses

Abstract

Plausible Logic is a non-monotonic logic with an efficient implementation, but no semantics. This paper gives Plausible Logic a fixed-point semantics, similar to the extensions of Reiter’s Default Logic. The proof theory is sound but deliberately incomplete with respect to this semantics. This is because the semantics is an attempt to define what follows from a plausible theory, rather than merely giving a different characterisation of what is provable.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.: Nonmonotonic Reasoning. MIT Press, Cambridge (1997)

    MATH  Google Scholar 

  2. 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 

  3. Billington, D.: The Proof Algorithms of Plausible Logic Form a Hierarchy. In: Zhang, S., Jarvis, R.A. (eds.) AI 2005. LNCS (LNAI), vol. 3809, pp. 796–799. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, London (1972)

    MATH  Google Scholar 

  5. Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  6. Maher, M.J.: A Model-Theoretic Semantics for Defeasible Logic. In: Decker, H., Villadsen, J., Waragai, T. (eds.) Paraconsistent Computational Logic, Roskilde University, Roskilde, Denmark, pp. 67–80 (2002); This proceedings volume contains the papers presented at the ICLP 2002 workshop Paraconsistent Computational Logic, July 27, Copenhagen, Denmark, as part of the Federated Logic Conference (FLoC), also available at http://arxiv.org/abs/cs.LO/0207086 , http://arxiv.org/pdf/cs.LO/0207086

  7. Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence 13, 81–132 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information and Communication Technology, Griffith University, Nathan campus, Brisbane, Queensland, 4111, Australia

    David Billington

Authors
  1. David Billington
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Guangxi Normal University, College of CS and IT, Guilin, China, and University of Technology, Faculty of Engineering and Information Technology, Sydney, Australia

    Shichao Zhang

  2. Department of Electrical and Computer Systems Engineering, Monash University, 3800, Melbourne, Victoria, Australia

    Ray Jarvis

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Billington, D. (2005). A Fixed-Point Semantics for Plausible Logic. In: Zhang, S., Jarvis, R. (eds) AI 2005: Advances in Artificial Intelligence. AI 2005. Lecture Notes in Computer Science(), vol 3809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589990_86

Download citation

  • DOI: https://doi.org/10.1007/11589990_86

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31652-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation