Papers
Topics
Authors
Recent
Search
2000 character limit reached

Human Conditional Reasoning in Answer Set Programming

Published 8 Nov 2023 in cs.AI and cs.LO | (2311.04412v2)

Abstract: Given a conditional sentence "P=>Q" (if P then Q) and respective facts, four different types of inferences are observed in human reasoning. Affirming the antecedent (AA) (or modus ponens) reasons Q from P; affirming the consequent (AC) reasons P from Q; denying the antecedent (DA) reasons -Q from -P; and denying the consequent (DC) (or modus tollens) reasons -P from -Q. Among them, AA and DC are logically valid, while AC and DA are logically invalid and often called logical fallacies. Nevertheless, humans often perform AC or DA as pragmatic inference in daily life. In this paper, we realize AC, DA and DC inferences in answer set programming. Eight different types of completion are introduced and their semantics are given by answer sets. We investigate formal properties and characterize human reasoning tasks in cognitive psychology. Those completions are also applied to commonsense reasoning in AI.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Alviano, M. & Dodaro, C. 2016. Completion of disjunctive logic programs. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 886–892.
  2. Apt, K. R., Blair, H. A. & Walker, A. 1988. Towards a theory of declarative knowledge. In: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, pp. 89–148.
  3. Braine, M. D. S. 1978. On the relation between the natural logic of reasoning and standard logic. Psychological Review 85:1–21.
  4. Braine, M. D. S. & O’Brien, D. P. (eds.) 1998. Mental Logic. Mahwah, NJ: Erlbaum.
  5. Byrne, R. M. J. 1989. Suppressing valid inferences with conditionals. Cognition 31(1), pp. 61–83.
  6. Byrne, R. M. J. 2005. The Rational Imagination: How People Create Alternatives to Reality. Cambridge, MA: MIT Press.
  7. Cheng, P. W. & Holyoak, H. J. 1985. Pragmatic reasoning schemas. Cognitive Psychology 17:391–416.
  8. Chu, W. W., Chen, Q. & Lee, R.-C. 1990. Cooperative query answering via type abstraction hierarchy. In: S. M. Deen (ed.), Cooperating Knowledge Based Systems, Springer, pp. 271–290.
  9. Clark, K. L. 1978. Negation as failure. In: H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, pp. 293–322.
  10. Console, L., Dupré, D. T. & Torasso, P. 1991. On the relationship between abduction and deduction. Journal of Logic and Computation 1, pp. 661–690.
  11. Cosmides, L. & Tooby, J. 1992. Cognitive adaptions for social exchange. In Barkow, J., Cosmides, L., Tooby, J. (eds.). The adapted mind: Evolutionary psychology and the generation of culture. New York: Oxford University Press. pp. 163–228.
  12. Cramer, M., Hölldobler, S. & Ragnl, M. 2021. Modeling human reasoning about conditionals. In: Proceedings of the 19th International Workshop on Non-Monotonic Reasoning (NMR-21), pp. 223–232.
  13. Dietz, E., Hölldobler, S. & Ragni, M. 2012. A computational approach to the suppression task. In: Proceedings of the 34th Annual Conference of the Cognitive Science Society, pp. 1500–1505.
  14. Dietz, E., Fichte, J. K. & Hamiti, F. 2022. A quantitative symbolic approach to individual human reasoning. In: Proceedings of the 44th Annual Conference of the Cognitive Science Society, pp. 2838–2846.
  15. Eichhorn, C., Kern-Isberner, G. & Ragni, M. 2018. Rational inference patterns based on conditional logic. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI-18), pp. 1827–1834.
  16. Fitting, M. 1985. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming 2, pp. 295–312.
  17. Fung, T. H. & Kowalski, R. 1997. The iff procedure for abductive logic programming. Journal of Logic Programming 33, pp. 151–165.
  18. Gaasterland, T., Godfrey, P. & Minker, P. 1992. Relaxation as a platform for cooperative answering. Journal of Intelligence Information Systems 1(3/4):293–321.
  19. Geis, M. L. & Zwicky, A. 1971. On invited inferences. Linguistic Inquiry 2, pp. 561–566.
  20. Gelfond, M. & Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (3&4), pp. 365–385.
  21. Griggs, R. A. & Cox, J. R. 1982. The elusive thematic-materials effect in Wason’s selection task. British journal of psychology 73(3), pp. 407–420.
  22. Hölldobler, S. & Kencana Ramli, C. D. 2009. Logic programs under three-valued Lukasiewicz’s semantics. In: Proceedings of the 25th International Conference on Logic Programming, Lecture Notes in Computer Science, vol. 5649, Springer, pp. 464–478.
  23. Horn, L. R. 2000. From if to iff: conditional perfection as pragmatic strengthening. Journal of Pragmatics 32, pp. 289–326.
  24. Inoue, K. & Sakama, C. 1998. Negation as failure in the head. Journal of Logic Programming 35(1), pp. 39–78.
  25. Inoue, K. & Sakama, C. 1999. Computing extended abduction through transaction programs. Annals of Mathematics and Artificial Intelligence 25(3&4), pp. 339–367.
  26. Johnson-Laird, P. N. 1983. Mental models. Cambridge, MA: Harvard University Press.
  27. Kakas, A. C., Kowalski, R. A. & Toni, F. 1992. Abductive logic programming. Journal of Logic and Computation 2(6), pp. 719–770.
  28. Kowalski, R. A. 2011. Computational Logic and Human Thinking: How to be Artificially Intelligent. Cambridge University Press.
  29. Lifschitz, V. & Woo, T. Y. C. 1992. Answer sets in general nonmonotonic reasoning (preliminary report). In: B. Nebel, C. Rich, and W. Swartout (eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference, Morgan Kaufmann, pp. 603–614.
  30. Lifschitz, V., Pearce, D. & Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, pp. 526–541.
  31. Lewis, D. 1973. Counterfactuals. Blackwell Publishing.
  32. Weak completion theory for non-Horn programs. In: R. A. Kowalski and K. A. Bowen (eds.), Proceedings of the Fifth lnternational Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, pp. 828–842.
  33. Nieves, J. C. & Osorio, M. 2018. Extending well-founded semantics with Clark’s completion for disjunctive logic programs. Hindawi Scientific Programming, Article ID 4157030.
  34. Oaksford, M. & Chater, N. 2001. The probabilistic approach to human reasoning. Trends in Cognitive Science 5, pp. 349–357.
  35. Pereira, L. P., Aparício, J. N. & Alferes, J. J. 1991. Counterfactual reasoning based on revising assumptions. In: Logic Programming, Proceedings of the 1991 International Symposium, MIT Press, pp. 566–577.
  36. Pereira, L. P. & Saptawijaya, A. 2017. Counterfactuals in logic programming. In: Programming Machine Ethics, Springer, pp. 81–93.
  37. Reiter, R. 1978. On closed world data bases. In: H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, pp. 119–140.
  38. Reiter, R. 1980. A logic for default reasoning. Artificial Intelligence 13:81–132.
  39. Conversational comprehension processes are responsible for reasoning fallacies in children as well as adults: IF is not the biconditional. Developmental Psychology 19:471–481.
  40. Sakama, C. & Inoue, K. 1995. Paraconsistent stable semantics for extended disjunctive programs. Journal of Logic and Computation 5(3):265–285.
  41. Stenning, K. & van Lambalgen, M. 2008. Human Reasoning and Cognitive Science, MIT Press.
  42. Wason,, P. C. 1968. Reasoning about a rule. Quarterly Journal of Experimental Psychology 20:273–281.
  43. Wason, P. C. & Shapiro, D. 1971. Natural and contrived experience in a reasoning problem. Quarterly Journal of Experimental Psychology 23:63–71.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Chiaki Sakama 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up