Abstract
A new non-monotonic propositional logic called PPL — for Propositional Plausible Logic — is defined. An example is worked and four theorems about PPL are stated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Billington, D.: A defeasible logic for clauses. In: Wang, D., Reynolds, M. (eds.) AI 2011. LNCS, vol. 7106, pp. 472–480. Springer, Heidelberg (2011)
Nute, D.: Defeasible reasoning. In: Proceedings of the 20th Hawaii International Conference on System Science, pp. 470–477 (1987)
Acknowledgement
The author thanks Patrick Marchisella for many helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Billington, D. (2015). A Propositional Plausible Logic. In: Pfahringer, B., Renz, J. (eds) AI 2015: Advances in Artificial Intelligence. AI 2015. Lecture Notes in Computer Science(), vol 9457. Springer, Cham. https://doi.org/10.1007/978-3-319-26350-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-26350-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26349-6
Online ISBN: 978-3-319-26350-2
eBook Packages: Computer ScienceComputer Science (R0)