Abstract
Ford has introduced a non-monotonic logic, System LS, inspired by an empirical study of human non-monotonic reasoning. We define here a defeasible logic FDL based on Ford’s logic, and in doing so identify some similarities and differences between Ford’s logic and existing defeasible logics. Several technical results about FDL are established, including its inference strength in relation to other defeasible logics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Representation results for defeasible logic. ACM Transactions on Computational Logic 2, 255–287 (2001)
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Embedding Defeasible Logic into Logic Programming. Theory and Practice of Logic Programming 6, 703–735 (2006)
Antoniou, G., Billington, D., Governatori, G., Maher, M.J., Rock, A.: A family of defeasible reasoning logics and its implementation. In: Proc. 14th European Conference on Artificial Intelligence (ECAI 2000), pp. 459–463. IOS Press, Amsterdam (2000)
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: A Flexible Framework for Defeasible Logics. In: Proc. National Conference on Artificial Intelligence (AAAI 2000), pp. 405–410 (2000)
Antoniou, G., Billington, D., Maher, M.J.: On the analysis of regulations using defeasible rules. In: Proc. 32nd Hawaii International Conference on Systems Science (1999)
Billington, D., de Coster, K., Nute, D.: A Modular Translation from Defeasible Nets to Defeasible Logic. Journal of Experimental and Theoretical Artificial Intelligence 2, 151–177 (1990)
Billington, D., Antoniou, G., Governatori, G., Maher, M.J.: An Inclusion Theorem for Defeasible Logics. ACM Transactions on Computational Logic ( to appear)
Dumas, M., Governatori, G., ter Hofstede, A., Oaks, P.: A formal approach to negotiating agents development. Electronic Commerce Research and Applications 1, 193–207 (2002)
Evans, J.S.B.T.: Bias in Human Reasoning. Erlbaum, Mahwah (1989)
Ford, M.: System LS: A three-tiered nonmonotonic reasoning system. Computational Intelligence 1, 89–107 (2004)
Ford, M.: Human nonmonotonic reasoning: The importance of seeing the logical strength of arguments. Synthese 146(1&2), 71–92 (2005)
Ford, M.: On using human nonmonotonic reasoning to inform artificial systems. Psychologica Belgica 45(1), 57–70 (2005)
Ford, M., Billington, D.: Strategies in human commonsense reasoning. Computational Intelligence 16, 446–468 (2000)
Gilio, A.: Probabilistic Reasoning Under Coherence in System P. Annals of Mathematics and Artificial Intelligence 34(1-3), 5–34 (2002)
Governatori, G.: Representing business contracts in RuleML. International Journal of Cooperative Information Systems 14, 181–216 (2005)
Governatori, G., Maher, M.J.: An Argumentation-Theoretic Characterization of Defeasible Logic. In: Proc. 14th European Conference on Artificial Intelligence (ECAI 2000), pp. 469–474. IOS Press, Amsterdam (2000)
Governatori, G., Maher, M.J., Antoniou, G., Billington, D.: Argumentation Semantics for Defeasible Logics. Journal of Logic and Computation 14, 675–702 (2004)
Grosof, B.N., Labrou, Y., Chan, H.Y.: A Declarative Approach to Business Rules in Contracts: Courteous Logic Programs in XML. In: Proc. 1st ACM Conference on Electronic Commerce (EC 1999). ACM Press, New York (1999)
Horty, J.F., Thomason, R.H.: Mixing Strict and Defeasible Inheritance. In: Proc. National Conference on Artificial Intelligence (AAAI 1988), pp. 427–432 (1988)
Johnson-Laird, P.N., Byrne, R.M.J.: Deduction. Erlbaum, Mahwah (1991)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44, 167–207 (1990)
Maher, M.J.: A Denotational Semantics for Defeasible Logic. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 209–222. Springer, Heidelberg (2000)
Maher, M.J.: Propositional Defeasible Logic has Linear Complexity. Theory and Practice of Logic Programming 1, 691–711 (2001)
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)
Maher, M.J.: A Model-Theoretic Semantics for Defeasible Logic. In: Proc. Workshop on Paraconsistent Computational Logic, pp. 67–80 (2002)
Nute, D.: Defeasible Logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 353–395. Oxford University Press, Oxford (1994)
Reeves, D.M., Grosof, B.N., Wellman, M.P., Chan, H.Y.: Towards a Declarative Language for Negotiating Executable Contracts. In: Proc. AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC 1999). AAAI Press/MIT Press (1999)
Touretzky, D.D., Horty, J.F., Thomason, R.H.: A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems. In: Proc. 10th International Joint Conference on Artificial Intelligence (IJCAI 1987), pp. 476–482. Morgan Kaufmann, San Francisco (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maher, M.J. (2010). Human and Unhuman Commonsense Reasoning. In: Fermüller, C.G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16242-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-16242-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16241-1
Online ISBN: 978-3-642-16242-8
eBook Packages: Computer ScienceComputer Science (R0)