|
|
| Zeile 9: |
Zeile 9: |
| |SWSExercise=2 | | |SWSExercise=2 |
| |SWSPractical=0 | | |SWSPractical=0 |
| |Exam type=mündliche Prüfung
| |
| |Description=<font color="red">
| |
| * Note that all slides from the lecture are online now.
| |
|
| |
| * There will be a workshop on [https://iccl.inf.tu-dresden.de/web/Hrclws2018 Human Reasoning and Computational Logic] from the 10th to the 12th of April. You are welcome to come along!
| |
| </font>
| |
|
| |
| In the lecture ''Human Reasoning and Computational Logic'' we present a new cognitive theory — the weak completion semantics — for selected human reasoning tasks. The weak completion semantics is based on logic programs, the three-valued Łukasiewicz logic, an appropriate fixed point operator, abduction and revision. It can be mapped onto an artificial neural network based on the core method. The networks can be trained by (deep) learning.
| |
|
| |
| The language of instruction is English. If, however, only German speaking students are in the lecture hall, then the language of instruction is German. The slides will be in English. The literature is usually in English.
| |
|
| |
| Contents
| |
|
| |
| 1. Logic Programs
| |
|
| |
| 2. Three-valued Łukasiewicz Logic
| |
|
| |
| 3. Abduction and Revision
| |
|
| |
| 4. Relation to Stable Model Semantics and Well-Founded Semantics
| |
|
| |
| 5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals
| |
|
| |
| 6. Artificial Neural Networks
| |
|
| |
| 7. The Core Method
| |
|
| |
| 8. Learning
| |
|
| |
|
| |
| ===Schedule ===
| |
|
| |
| * the lecture and the tutorial will take place in room E05
| |
| * the lecture will take place on Wednesday, 3.DS (11:10 - 12:40, starting on 11.10.2017) and on Thursday, 5.DS (14:50 - 16:20)
| |
| * the tutorial will take place on Wednesday, delayed 4.DS (13:15 - 14:45, starting on 18.10.2017)
| |
|
| |
| ===Lecture Slides===
| |
|
| |
| The lecture slides can be found [http://www.wv.inf.tu-dresden.de/materials/hr2017/ here] (updated on 04.02.2018). the user name is ''student'' and the password will be given during the lecture.
| |
|
| |
| You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].
| |
| <!--
| |
| * [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]
| |
| * [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]
| |
| * [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]
| |
| * [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]
| |
| * [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]
| |
| -->
| |
|
| |
| ===Exercises===
| |
|
| |
| During the tutorial we will only discuss your solutions to the exercises. That means that you are supposed to solve the exercises by yourself beforehand.
| |
|
| |
| * [https://iccl.inf.tu-dresden.de/w/images/9/9e/Ex1-2017.pdf Exercise 1] (18.10.17)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)
| |
| * [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)
| |
|
| |
|
| |
| ===Practical Assignment===
| |
|
| |
| * [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]
| |
| * [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]
| |
|
| |
| You can find more information and ideas in the following papers:
| |
| * [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1]
| |
| M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In
| |
| G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th
| |
| Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,
| |
| TX: Cognitive Science Society, 2017
| |
| * [http://ceur-ws.org/Vol-1651/12340059.pdf 2]
| |
| M. Ragni, E.-A. Dietz, I. Kola, and S. Hölldobler. Two-valued logic is not sufficient to model human reasoning, but three-valued logic is: A formal analysis. In C. Schon and U. Furbach, editors,
| |
| Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning
| |
| co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New
| |
| York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016
| |
| * [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2)
| |
| P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.
| |
|
| |
| ===Software===
| |
|
| |
| To compute the least fixed point of the SvL operator, you can use the following implementations:
| |
| * [https://iccl.inf.tu-dresden.de/w/images/f/f2/Svloperator.zip SvL Operator with graphical user interface] (edit the environment path of your computer to run swipl from command line)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]
| |
|
| |
| ===Additional material===
| |
|
| |
| Most of the proofs discussed in the exercises can be found here:
| |
| * [https://iccl.inf.tu-dresden.de/w/images/1/13/Master_ramli.pdf Logic Programs and Three-Valued Consequence Operators by Carroline Dewi Puspa Kencana Ramli (Master thesis)]
| |
| * [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]
| |
|
| |
| <!--
| |
|
| |
| ===Software===
| |
|
| |
| To compute the least fixed point of the SvL operator, you can use the following implementations:
| |
| * [https://iccl.inf.tu-dresden.de/w/images/f/f2/Svloperator.zip SvL Operator with graphical user interface] (edit the environment path of your computer to run swipl from command line)
| |
| * [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]
| |
|
| |
| ===Practical Assignment===
| |
|
| |
| * [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]
| |
| * [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]
| |
| * The original paper with the participants conclusions about the 64 syllogistic premises can be found [http://mentalmodels.princeton.edu/papers/ssk/ssk2012syllogisms-meta-analysis.pdf here] (pp. 22-23)
| |
|
| |
|
| |
| [[File:Task.png|upright|center|alt=Experiment.|Experiment.]]
| |
|
| |
| [http://olb.computational-logic.org/experiment.php Experiment]
| |
| -->
| |
| |Literature=Der erste Teil der Vorlesung basiert auf die folgenden Bücher:
| |
|
| |
| S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.
| |
|
| |
| J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.
| |
|
| |
| S. Hölldober. [http://ceur-ws.org/Vol-1412/2o.pdf Weak Completion Semantics and its Applications in Human Reasoning]. In Claudia Schon Ulrich Furbach, editor, Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning on the 25th International Conference on Automated Deduction (CADE-25), pages 2–16. CEUR-WS.org, 2015.
| |
|
| |
| <!--
| |
| Emmanuelle-Anna Dietz, Steffen Hölldobler, and Marco Ragni. A computational logic approach to the suppression task. In N. Miyake, D. Peebles, and R. P. Cooper,editors, Proceedings of the 34th Annual Conference of the Cognitive Science Society, CogSci 2013, pages 1500–1505. Austin, TX: Cognitive Science Society, 2012a
| |
|
| |
| Emmanuelle-Anna Dietz, Steffen Hölldobler, and Marco Ragni. A computational logic approach to the abstract and the social case of the selection task. In Proceedings of the 11th International Symposium on Logical Formalizations of Commonsense Reasoning, COMMONSENSE 2013, Aeya Nappa, Cyprus, 2013.
| |
|
| |
| E.-A. Dietz. A computational logic approach to syllogisms in human reasoning. In Claudia Schon Ulrich Furbach, editor, Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning on the 25th International Conference on Automated Deduction (CADE-25), pages 17–31. CEUR-WS.org, 2015.
| |
|
| |
| E.-A. Dietz, S. Hölldobler, and R. Höps. A computational logic approach to human spatial reasoning. In IEEE Symposium on Human-Like Intelligence (CIHLI), 2015a.
| |
|
| |
| Ana Costa, Emmanuelle-Anna Dietz, Steffen Hölldobler, and Marco Ragni. Syllogistic reasoning under the weak completion semantics. In Claudia Schon Ulrich Furbach, editor, Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning on the 25th International Joint Conference on Artificial Intelligence (IJCAI-16). CEUR-WS.org, 2015.
| |
| -->
| |
| Pascal Hitzler, Steffen Hölldobler, Anthony Karel Seda, [http://ac.els-cdn.com/S1570868304000151/1-s2.0-S1570868304000151-main.pdf?_tid=831124dc-596a-11e6-8bed-00000aacb360&acdnat=1470222648_83181aeb393190f89debbedd17c17ed4 Logic programs and connectionist networks]. Journal of Applied Logic, Volume 2, Issue 3, 2004, Pages 245-272
| |
| }}
| |
