https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&user=Emma+Dietz&feedformat=atomInternational Center for Computational Logic - Benutzerbeiträge [de]2024-03-29T15:06:51ZBenutzerbeiträgeMediaWiki 1.35.6https://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=30097Human Reasoning and Computational Logic (WS2019)2020-01-31T16:04:48Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (31.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf<font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf<font color="red">here</font>]. <br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
* Syllogistic Reasoning Challenge<br />
** [https://iccl.inf.tu-dresden.de/w/images/6/66/DatenanalyseYourPredictions.ods template for your predictions]<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Applications2019-pw.pdf&diff=30096Datei:Applications2019-pw.pdf2020-01-31T16:04:04Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Applications2019-pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=30093Knowledge Representation and Reasoning Seminar (WS2019)2020-01-30T15:50:41Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description===Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach and ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I)<br />
<br />
<!--<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
<br />
--><br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=30088Human Reasoning and Computational Logic (WS2019)2020-01-29T11:05:07Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (29.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/3/3f/Applications2019_pw.pdf<font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf<font color="red">here</font>]. <br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
* Syllogistic Reasoning Challenge<br />
** [https://iccl.inf.tu-dresden.de/w/images/6/66/DatenanalyseYourPredictions.ods template for your predictions]<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Applications2019_pw.pdf&diff=30087Datei:Applications2019 pw.pdf2020-01-29T11:04:32Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Applications2019 pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Stellenausschreibung15&diff=30060Stellenausschreibung152020-01-24T19:50:47Z<p>Emma Dietz: </p>
<hr />
<div>{{Stellenausschreibung<br />
|Title DE=Wissensch. Mitarbeiter/in / Doktorand/in / Postdoc an der Professur für Wissensverarbeitung<br />
|Title EN=Research Associate / PhD Student / Postdoc at the chair of Knowledge Representation and Reasoning<br />
|Beschreibung DE=Am '''Institut für Künstliche Intelligenz''' ist an der [[Wissensverarbeitung|'''Professur für Wissensverarbeitung''']] zum '''01.02.2020''' eine Stelle als<br />
<br />
'''wiss. Mitarbeiter/in / Doktorand/in / Postdoc'''<br />
<br />
(bei Vorliegen der persönlichen Voraussetzungen E 13 TV-L)<br />
<br />
für die Dauer von 36 Monaten (Beschäftigungsdauer gem. WissZeitVG) mit dem Ziel der eigenen wiss. Weiterqualifikation (i. d. R. Promotion oder Habilitation) zu besetzen. <br />
<br />
'''Aufgaben:''' wiss. Forschung vorzugsweise im Gebiet des Lösens von Erfüllbarkeitsproblemen (SAT) oder der Modellierung menschlichen Schließens mittels Verfahren der Logikprogrammierung und der logik-basierten Wissensverarbeitung; Durchführung von Lehrveranstaltungen, insb. von Übungen und Seminaren; Betreuung von Studierenden; Erstellung von Klausuraufgaben; Kontrolle von Klausuren und Mitwirkung bei der Abnahme von mündlichen Prüfungen im Gebiet der Wissensverarbeitung unter der fachlichen Verantwortung des Inhabers der Professur; Mitarbeit bei der akademischen Selbstverwaltung inklusive der Durchführung wiss. Veranstaltungen sowie der Einwerbung von Drittmitteln.<br />
<br />
'''Voraussetzungen:''' wiss. HSA der Fachrichtung Informatik (oder angrenzenden Disziplinen); strukturierte Arbeitsweise und die Fähigkeit, Projekte selbstständig voranzubringen und mit allen Beteiligten zu kommunizieren; ausgezeichnetes schriftliches und mündliches Ausdrucksvermögen in deutscher und englischer Sprache.<br />
Frauen sind ausdrücklich zur Bewerbung aufgefordert. Selbiges gilt auch für Menschen mit Behinderungen. <br />
<br />
Ihre aussagefähige Bewerbung senden Sie bitte mit den üblichen Unterlagen bis zum '''31.01.2020''' (es gilt der Poststempel der ZPS der TU Dresden) bevorzugt über das SecureMail Portal der TU Dresden https://securemail.tu-dresden.de als ein PDF-Dokument an sh@iccl.tu-dresden.de (Achtung: z. Zt. Kein Zugang für elektronisch signierte sowie verschlüsselte elektronische Dokumente) oder an: '''TU Dresden, Fakultät Informatik, Institut für Künstliche Intelligenz, Professur für Wissensverarbeitung, Herrn Prof. Steffen Hölldobler, Helmholtzstr. 10, 01069 Dresden.''' Ihre Bewerbungsunterlagen werden nicht zurückgesandt, bitte reichen Sie nur Kopien ein. Vorstellungskosten werden nicht übernommen.<br />
<br />
<small>'''Hinweis zum Datenschutz:''' Welche Rechte Sie haben und zu welchem Zweck Ihre Daten verarbeitet werden sowie weitere Informationen zum Datenschutz haben wir auf der Webseite https://tu-dresden.de/karriere/datenschutzhinweis für Sie zur Verfügung gestellt.</small><br />
|Beschreibung EN=At the '''Institute of Artificial Intelligence''' the [[Wissensverarbeitung/en|'''Chair of Knowledge Representation and Reasoning''']] offers a position as<br />
<br />
'''Research Associate / PhD Student / Postdoc '''<br />
<br />
(Subject to personal qualification employees are remunerated according to salary group E13 TV-L)<br />
<br />
starting on '''01.02.2020'''. The position is limited for 36 months. The period of employment is governed by Fixed Term Research Contracts Act (Wissenschaftszeitvertragsgesetz-WissZeitVG). The position aims at obtaining further academic qualification (e.g. PhD / habilitation thesis).<br />
<br />
'''Tasks:''' scientific research preferably in either the area of satisfiability (SAT) testing or in the area of modelling human reasoning tasks by appropriate logics; organisation of lectures, especially of excercises and seminars; supervision of students; organisation of examinations under the responsibility of the Chair of Knowledge Representation and Reasoning; participation in administrative processes including organisation of scientific events; support in applications for third-party funding.<br />
<br />
'''Requirements:''' university degree in computer science (or related disciplines); the ability to communicate and to develop projects in a structured way; good command of the German and the English language. <br />
Applications from women are particularly welcome. The same applies to people with disabilities.<br />
<br />
Please submit your comprehensive application including the usual documents by '''31.01.2020''' (stamped arrival date of the university central mail service applies) preferably as a single pdf-document to sh@iccl.tu-dresden.de (Please note: We are currently not able to receive electronically signed and encrypted data.) or by mail to: '''TU Dresden, Fakultät Informatik, Institut für Künstliche Intelligenz, Professur für Wissensverarbeitung, Herrn Prof. Steffen Hölldobler, Helmholtzstr. 10, 01069 Dresden.''' Please submit copies only, as your application will not be returned to you. Expenses incurred in attending interviews cannot be reimbursed.<br />
<br />
<small>'''Reference to data protection:''' Your data protection rights, the purpose for which your data will be processed, as well as further information about data protection is available to you on the website: https: //tu-dresden.de/karriere/datenschutzhinweis </small><br />
|Stellenart=Wissenschaftliche(r) Mitarbeiter(in) / Doktorand(in)<br />
|Forschungsgruppe=Wissensverarbeitung<br />
|Ausschreibender=Steffen Hölldobler<br />
|Bewerbungsfrist=2020/01/31<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=30039Knowledge Representation and Reasoning Seminar (WS2019)2020-01-23T15:41:37Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Thursday, 30.1.2020 at 14:50 in APB2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach and ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I)<br />
<br />
<!--<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
<br />
--><br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=30038Human Reasoning and Computational Logic (WS2019)2020-01-23T15:31:08Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides and the manuscript are updated (23.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/3/3f/Applications2019_pw.pdf<font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf<font color="red">here</font>]. <br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
* Syllogistic Reasoning Challenge<br />
** [https://iccl.inf.tu-dresden.de/w/images/6/66/DatenanalyseYourPredictions.ods template for your predictions]<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Main_pw.pdf&diff=30037Datei:Main pw.pdf2020-01-23T15:30:22Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Main pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Applications2019_pw.pdf&diff=30036Datei:Applications2019 pw.pdf2020-01-23T15:28:04Z<p>Emma Dietz: </p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=30010Human Reasoning and Computational Logic (WS2019)2020-01-16T13:15:57Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (16.1.2020) and the manuscript is updated (14.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/1/1b/Main-pw.pdf<font color="red">here</font>]. <br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
* Syllogistic Reasoning Challenge<br />
** [https://iccl.inf.tu-dresden.de/w/images/6/66/DatenanalyseYourPredictions.ods template for your predictions]<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Applications2019-pw.pdf&diff=30009Datei:Applications2019-pw.pdf2020-01-16T13:15:28Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Applications2019-pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=30005Human Reasoning and Computational Logic (WS2019)2020-01-15T12:45:38Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (8.1.2020) and the manuscript is updated (14.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/1/1b/Main-pw.pdf<font color="red">here</font>]. <br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
* Syllogistic Reasoning Challenge<br />
** [https://iccl.inf.tu-dresden.de/w/images/6/66/DatenanalyseYourPredictions.ods template for your predictions]<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:DatenanalyseYourPredictions.ods&diff=30004Datei:DatenanalyseYourPredictions.ods2020-01-15T12:44:50Z<p>Emma Dietz: </p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=30003Human Reasoning and Computational Logic (WS2019)2020-01-15T12:43:41Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (8.1.2020) and the manuscript is updated (14.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/1/1b/Main-pw.pdf<font color="red">here</font>]. <br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Main-pw.pdf&diff=30002Datei:Main-pw.pdf2020-01-15T12:42:48Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Main-pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29984Knowledge Representation and Reasoning Seminar (WS2019)2020-01-09T15:03:30Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Thursday, 16.1.2020 at 14:50 in APB2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
<!--<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
<br />
--><br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29983Knowledge Representation and Reasoning Seminar (WS2019)2020-01-09T15:02:52Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Thursday, 16.1.2020 at 14:50 in APB2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
<br />
--><br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29982Knowledge Representation and Reasoning Seminar (WS2019)2020-01-09T15:02:20Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Thursday, 16.1.2020 at 14:50 in APB2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=29981Human Reasoning and Computational Logic (WS2019)2020-01-09T14:52:50Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (8.1.2020) and the manuscript is updated (9.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/1/1b/Main-pw.pdf<font color="red">here</font>].<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Main-pw.pdf&diff=29980Datei:Main-pw.pdf2020-01-09T14:48:53Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Main-pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=29976Human Reasoning and Computational Logic (WS2019)2020-01-08T13:18:02Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (8.1.2020).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf <font color="red">here</font>].<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Applications2019-pw.pdf&diff=29975Datei:Applications2019-pw.pdf2020-01-08T13:16:49Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Applications2019-pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29946Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:55:27Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Thursday, 9.1.2020 at 14:50 in APB2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29945Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:55:08Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29944Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:52:44Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29943Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:42:54Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.19</b> initial meeting<br />
* <b>24.10.19</b> Presentation of the topics<br />
* <b>29.10.19</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.19</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.19</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.19</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.19</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.19</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.19</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.19</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.19</b> Feedback on handed in presentations<br />
* <b>09.01.20</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.01.20</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.01.20</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Lingaraja Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.01.20</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29942Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:41:44Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.</b> Feedback on handed in presentations<br />
* <b>9.1.</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.1.</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.1.</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Lingaraja Hugar and ''COPA: Choice of Plausible Alternatives'' by Aldo Kurmeta<br />
* <b>30.1.</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29941Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:41:04Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.</b> Feedback on handed in presentations<br />
* <b>9.1.</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.1.</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.1.</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Lingaraja Hugar and "COPA: Choice of Plausible Alternatives" by Aldo Kurmeta<br />
* <b>30.1.</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29940Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:40:34Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.</b> Feedback on handed in presentations<br />
* <b>9.1.</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.1.</b> ''Machine Learning approaches towards WSC'' by Vidya Chandrashekar (part I) and by Abhiram Uppoor (part II)<br />
* <b>23.1.</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Lingaraja Hugar<br />
and "COPA: Choice of Plausible Alternatives" by Aldo Kurmeta<br />
* <b>30.1.</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29939Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:39:49Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.</b> Feedback on handed in presentations<br />
* <b>9.1.</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.1.</b> ''Machine Learning approaches towards WSC (1)'' by Vidya Chandrashekar and ''Machine Learning approaches towards WSC (2)'' by Abhiram Uppoor<br />
* <b>23.1.</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Lingaraja Hugar<br />
and "COPA: Choice of Plausible Alternatives" by Aldo Kurmeta<br />
* <b>30.1.</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
Feedback on handed in presentations<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29938Knowledge Representation and Reasoning Seminar (WS2019)2019-12-23T14:39:05Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 9.1.2020 at 14:50 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.</b> Feedback on handed in presentations<br />
* <b>9.1.</b> ''Google’s T5 - A Unified Text-to-Text Transformer'' by Patrick Wienhöft <br />
* <b>16.1.</b> ''Machine Learning approaches towards WSC (1)'' by Vidya Chandrashekar<br />
and ''Machine Learning approaches towards WSC (2)'' by Abhiram Uppoor<br />
* <b>23.1.</b> ''Human Baseline for Commonsense Reasoning Tasks'' by Vishwanath Lingaraja Hugar<br />
and "COPA: Choice of Plausible Alternatives" by Aldo Kurmeta<br />
* <b>30.1.</b> ''How Reasonable are Common-Sense Reasoning Tasks'' by Lukas Gerlach<br />
<br />
Feedback on handed in presentations<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=29931Human Reasoning and Computational Logic (WS2019)2019-12-19T08:42:27Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (19.12.2019).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf <font color="red">here</font>].<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
* [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)]<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Applications2019-pw.pdf&diff=29930Datei:Applications2019-pw.pdf2019-12-19T08:39:55Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Applications2019-pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=29929Human Reasoning and Computational Logic (WS2019)2019-12-18T10:59:32Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (12.12.2019) and the manuscript is updated (11.12.2019).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf <font color="red">here</font>].<br />
<br />
Most of the proofs discussed in the lecture can be found in Carroline Kencana Ramli's master thesis, [http://www.wv.inf.tu-dresden.de/Publications/Diploma/master_ramli.pdf <font color="red">here</font>].<br />
<br />
<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
** [https://iccl.inf.tu-dresden.de/w/images/d/da/Ex3-2019.pdf Abduction in WCS]<br />
<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Ex3-2019.pdf&diff=29928Datei:Ex3-2019.pdf2019-12-18T10:59:00Z<p>Emma Dietz: </p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Ex1-2019.pdf&diff=29927Datei:Ex1-2019.pdf2019-12-18T10:58:15Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Ex1-2019.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29900Knowledge Representation and Reasoning Seminar (WS2019)2019-12-12T14:27:45Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 17.12.2019 at 15:00 in APB2028.<br />
<br />
Important: To be able to give a presentation in January, you have to hand in a draft of your slides, latest on Monday, 16.12.2019!<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00 in APB2028)<br />
* <b>19.12.</b> Feedback on handed in presentations<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29899Knowledge Representation and Reasoning Seminar (WS2019)2019-12-12T14:24:29Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar will take place on Tuesday, 17.12.2019 at 15:00 in APB2028.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Justifying All Differences Using Pseudo-Boolean Reasoning'' by Marcos Cramer<br />
* <b>17.12.</b> ''Graph matching, theory and SAT implementation'' by Stephan Gocht (this talk will take place on Tuesday, 15:00)<br />
* <b>19.12.</b> Feedback on handed in presentations and How to give a research talk<br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=29896Human Reasoning and Computational Logic (WS2019)2019-12-12T09:20:35Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The slides are updated (12.12.2019) and the manuscript is updated (11.12.2019).<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and [https://iccl.inf.tu-dresden.de/w/images/6/65/Applications2019-pw.pdf <font color="red">here</font>]. The manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf <font color="red">here</font>].<br />
<br />
Most of the proofs discussed in the lecture can be found in Carroline Kencana Ramli's master thesis, [http://www.wv.inf.tu-dresden.de/Publications/Diploma/master_ramli.pdf <font color="red">here</font>].<br />
<br />
<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
Old exercises can be found [https://iccl.inf.tu-dresden.de/web/Human_Reasoning_and_Computational_Logic_(WS2017) here].<br />
<br />
* In the tutorials, we will discuss exercises that are written on the lecture slides or here:<br />
** [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf about the tp operator]<br />
** [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf about some properties of WCS] <br />
<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Applications2019-pw.pdf&diff=29895Datei:Applications2019-pw.pdf2019-12-12T09:16:03Z<p>Emma Dietz: </p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=29888Human Reasoning and Computational Logic (WS2019)2019-12-11T13:39:16Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The manuscript is updated! (11.12.2019)<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and the manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf <font color="red">here</font>].<br />
<br />
Most of the proofs discussed in the lecture can be found in Carroline Kencana Ramli's master thesis, [http://www.wv.inf.tu-dresden.de/Publications/Diploma/master_ramli.pdf <font color="red">here</font>].<br />
<br />
<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf Exercise 1] (27.11.19)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/46/Ex2-2019.pdf Exercise 2] (11.12.19)<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Ex2-2019.pdf&diff=29887Datei:Ex2-2019.pdf2019-12-11T13:38:26Z<p>Emma Dietz: </p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Main_pw.pdf&diff=29886Datei:Main pw.pdf2019-12-11T11:48:41Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Main pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Main_pw.pdf&diff=29885Datei:Main pw.pdf2019-12-11T11:48:03Z<p>Emma Dietz: Emma Dietz lud eine neue Version von Datei:Main pw.pdf hoch</p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Human_Reasoning_and_Computational_Logic_(WS2019)&diff=29882Human Reasoning and Computational Logic (WS2019)2019-12-11T10:21:14Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Human Reasoning and Computational Logic<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-PM-FOR, INF-VERT2, MCL-KR, MCL-PI, INF-E-3, MCL-AI<br />
|SWSLecture=2<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung<br />
|Description=<font color="red"> <br />
The manuscript is updated! (11.12.2019)<br />
</font><br />
<br />
<br />
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.<br />
<br />
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.<br />
<br />
Contents<br />
<br />
1. Logic Programs<br />
<br />
2. Three-valued Łukasiewicz Logic <br />
<br />
3. Abduction and Revision <br />
<br />
4. Relation to Stable Model Semantics and Well-Founded Semantics<br />
<br />
5. Selected Human Reasoning Tasks: Suppression Task, Selection Task, Syllogisms, Belief Bias, Spatial Reasoning, Reasoning about Conditionals<br />
<br />
6. Artificial Neural Networks<br />
<br />
7. The Core Method<br />
<br />
8. Learning<br />
<br />
<br />
===Schedule ===<br />
<br />
* the lecture and the tutorial will take place in room E05<br />
* the lectures will take place on Wednesday, 4.DS (13:00 - 14:30) starting on 16.10.2019<br />
* the tutorials will take place on Wednesday, 5.DS (14:50 - 16:20) starting on 23.10.2019<br />
<br />
===Lecture Slides===<br />
<!-- http://www.wv.inf.tu-dresden.de/materials/hr2019/ --><br />
The lecture slides can be found [https://iccl.inf.tu-dresden.de/w/images/c/c4/Basictheory-pw.pdf <font color="red">here</font>] and the manuscript can be found [https://iccl.inf.tu-dresden.de/w/images/c/c7/Main_pw.pdf <font color="red">here</font>].<br />
<br />
Most of the proofs discussed in the lecture can be found in Carroline Kencana Ramli's master thesis, [http://www.wv.inf.tu-dresden.de/Publications/Diploma/master_ramli.pdf <font color="red">here</font>].<br />
<br />
<br />
<!--<br />
You can find an overview paper on neural-symbolic learning and reasoning [https://arxiv.org/pdf/1711.03902 here].<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/0e/Hr2016.pdf Introduction]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/82/Flp2016.pdf Foundations of Logic Programming]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8b/Wcs2016.pdf Weak Completion Semantics] (updated on 02.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/fd/Bst2016.pdf Byrne's Suppression Task] (updated on 07.12.16)<br />
* [https://iccl.inf.tu-dresden.de/w/images/6/6f/Wst2016.pdf Wason's Selection Task]<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/28/Syllogisms2016.pdf Syllogisms]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/97/Syllogisms2016.pdf.zip Syllogisms2016.pdf.zip]<br />
--><br />
<br />
===Exercises===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/2/27/Ex1-2019.pdf Exercise 1] (27.11.17)<br />
<br />
<br />
<!--<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f0/Ex2-2017.pdf Exercise 2] (25.10.17)<br />
* [https://iccl.inf.tu-dresden.de/web/Datei:Ex3-2017.pdf Exercise 3] (1.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/4/4b/Ex4-2017.pdf Exercise 4] (8.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/8a/Ex5-2017.pdf Exercise 5] (29.11.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/1/1e/Ex6-2017.pdf Exercise 6] (6.12.17)<br />
* [https://iccl.inf.tu-dresden.de/w/images/f/f3/Ex7-2017.pdf Exercise 7] (20.12.17)<br />
--><br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following tools:<br />
* http://olb.computational-logic.org/processing/svl.php<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/8/86/Svl_prolog.zip Prolog files]<br />
<br />
<br />
<br />
<!--<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9d/Assignment-WST.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/9/9e/Summary-exp-results.ods Summary of Experimental Results]<br />
<br />
You can find more information and ideas in the following papers:<br />
* [https://mindmodeling.org/cogsci2017/papers/0192/paper0192.pdf 1] <br />
M. Ragni, I. Kola, and P. Johnson-Laird. The wason selection task: A meta-analysis. In<br />
G. Gunzelmann, A. Howes, T. Tenbrink, and E. Davelaar, editors, Proceedings of the 39th<br />
Annual Conference of the Cognitive Science Society, (CogSci 2017), pages 980–985. Austin,<br />
TX: Cognitive Science Society, 2017<br />
* [http://ceur-ws.org/Vol-1651/12340059.pdf 2] <br />
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,<br />
Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning<br />
co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New<br />
York, USA, vol. 1651 of CEUR Workshop Proceedings, pages 61–73. CEUR-WS.org, 2016<br />
* [http://mentalmodels.princeton.edu/papers/1970insight.pdf 3] (Figure 1 and Figure 2) <br />
P. Johnson-Laird and P. Wason. A theoretical analysis of insight into a reasoning task. 1:134–148, 05 1970.<br />
<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Additional material===<br />
<br />
Most of the proofs discussed in the exercises can be found here:<br />
* [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)]<br />
* [http://www.wv.inf.tu-dresden.de/Publications/Prediploma/bachelor_tobias.pdf Human Reasoning and Abduction by Tobias Philipp (Bachelor thesis)]<br />
<br />
<br />
--><br />
<!--<br />
<br />
===Software===<br />
<br />
To compute the least fixed point of the SvL operator, you can use the following implementations:<br />
* [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) <br />
* [https://iccl.inf.tu-dresden.de/w/images/e/e1/Svl_prolog_files.zip Prolog files]<br />
<br />
===Practical Assignment===<br />
<br />
* [https://iccl.inf.tu-dresden.de/w/images/0/07/Assignment-2016.pdf Assignment]<br />
* [https://iccl.inf.tu-dresden.de/w/images/8/89/Syllsoftware.zip Java implementation of Syllogistic Reasoning Task]<br />
* 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)<br />
<br />
<br />
[[File:Task.png|upright|center|alt=Experiment.|Experiment.]]<br />
<br />
[http://olb.computational-logic.org/experiment.php Experiment]<br />
--><br />
|Literature=The first part of the lecture is based on the following books:<br />
<br />
S. Hölldober. Logik und Logikprogrammierung, volume 1: Grundlagen. Synchron Publishers GmbH, Heidelberg, 2009.<br />
<br />
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag New York, Inc., New York, NY, USA, 1984.<br />
<br />
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.<br />
<br />
<!--<br />
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<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
<br />
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.<br />
--><br />
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<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Main_pw.pdf&diff=29881Datei:Main pw.pdf2019-12-11T10:20:19Z<p>Emma Dietz: </p>
<hr />
<div></div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29863Knowledge Representation and Reasoning Seminar (WS2019)2019-12-09T16:24:47Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The seminar this week, on Thursday, 12.12.2019, will take place at 15:15 in ABP2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Approximation Fixpoint Theory and its Application to Knowledge Representation'' by Marcos Cramer<br />
<!--<br />
* <b>19.12.</b> Feedback on handed in presentations and How to give a research talk<br />
<br />
--><br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29862Knowledge Representation and Reasoning Seminar (WS2019)2019-12-09T16:24:35Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<font color="red"> <br />
The next seminar this week, on Thursday, 12.12.2019, will take place at 15:15 in ABP2026.<br />
</font><br />
<br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Approximation Fixpoint Theory and its Application to Knowledge Representation'' by Marcos Cramer<br />
<!--<br />
* <b>19.12.</b> Feedback on handed in presentations and How to give a research talk<br />
<br />
--><br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietzhttps://iccl.inf.tu-dresden.de/w/index.php?title=Knowledge_Representation_and_Reasoning_Seminar_(WS2019)&diff=29856Knowledge Representation and Reasoning Seminar (WS2019)2019-12-06T09:14:49Z<p>Emma Dietz: </p>
<hr />
<div>{{Vorlesung<br />
|Title=Knowledge Representation and Reasoning Seminar<br />
|Research group=Wissensverarbeitung<br />
|Lecturers=Steffen Hölldobler; Emmanuelle Dietz;<br />
|Term=WS<br />
|Year=2019<br />
|Module=INF-04-HS,INF-AQUA,INF-BAS2,INF-D-940,MCL-KR,MCL-PI,MCL-PCS,EMCL-A-KR,EMCL-PI,EMCL-PCS<br />
|SWSLecture=0<br />
|SWSExercise=2<br />
|SWSPractical=0<br />
|Exam type=mündliche Prüfung, Referat<br />
|Description=<!--<br />
<br />
<font color="red"> <br />
The next seminar, on Thursday, 5.12.2019, will take place at the regular time and location, on 14:50 in ABP2026.<br />
</font><br />
<br />
--><br />
<br />
==Knowledge Representation and Reasoning Seminar==<br />
<br />
The seminar will be about the most recent results on the Winograd Schema Challenge. See for more information below.<br />
<br />
The requirements for the KRR Seminar are as follows:<br />
* You need to be at least a minimum of five students that want to participate<br />
* You attend '''all''' talks during the semester<br />
* You select one of the papers presented below and communicate your choice to Emmanuelle Dietz until 14.11.2019<br />
* You give a presentation of 30 minutes about the chosen paper in January 2020<br />
* You send (a preliminary version of) your presentation slides until 16.12.2019 to Emmanuelle Dietz<br />
<br />
<br />
==Schedule==<br />
<br />
The seminar meetings will take place on thursdays, 5.DS (14:50 - 16:20, starting on 24.10.2019) in room APB2026.<br />
<br />
* <b>17.10.</b> initial meeting<br />
* <b>24.10.</b> Presentation of the topics<br />
* <b>29.10.</b> ''Graph matching, theory and SAT implementation'' by Orianne Laura Bargain (this talk will take place on Tuesday, 10:30)<br />
* <b>07.11.</b> ''SCF2 - an Argumentation Semantics for Rational Human Judgments on Argument Acceptability'' by Marcos Cramer<br />
* <b>14.11.</b> ''Abduction in a neuro-symbolic system'' by Andrzej Gajda <br />
* <b>21.11.</b> How to make a presentation in LaTeX. Template slides in Beamer for presentations are online. You can find them [https://iccl.inf.tu-dresden.de/w/images/1/1b/Beamer-intro.zip here] [https://iccl.inf.tu-dresden.de/w/images/a/a5/A-TALK-ON-GIVING-TALKS-I-beamer-emma.pdf how to give a talk I] [https://iccl.inf.tu-dresden.de/w/images/d/d3/A-TALK-ON-GIVING-TALKS-II-beamer-emma.pdf how to give a talk II]<br />
* <b>28.11.</b> ''TE-ETH: Lower Bounds for QBFs of Bounded Treewidth'' by Markus Hecher, joint work with Johannes Fichte and Andreas Pfandler (this talk will take place at 13:00 together with the [https://iccl.inf.tu-dresden.de/web/KBS_Seminar/en KBS seminar] in APB3027, see also the recent [https://fg-kp.gi.de/fileadmin/FG/KP/user_upload/newsletter/newsletter-sep19.pdf GI newsletter] for their guest commentary in German)<br />
* <b>5.12.</b> ''Human Syllogistic Reasoning: Towards Predicting Individuals' Reasoning Behavior based on Cognitive Principles'' by Robert Schambach (joint work with Emmanuelle Dietz)<br />
* <b>12.12.</b> ''Approximation Fixpoint Theory and its Application to Knowledge Representation'' by Marcos Cramer<br />
<!--<br />
* <b>19.12.</b> Feedback on handed in presentations and How to give a research talk<br />
<br />
--><br />
<br />
==Commonsense Reasoning==<br />
<br />
This seminar will be about commonsense reasoning in AI, and the Winograd Schema Challenge, an alternative to the Turing Test.<br />
<br />
===Topics===<br />
<br />
* What is commonsense reasoning?<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Davis; Marcus (2015). "Commonsense reasoning". Communications of the ACM. Vol. 58 no. 9. pp. 92–103.<br />
*** McCarthy, J. (1959). "Programs with Common Sense". Proceedings of the Teddington Conference on the Mechanization of Thought Processes (pp. 75--91), London: Her Majesty's Stationary Office.<br />
<br />
* Winograd Schema Challenge (WSC)<br />
** sources<br />
*** wikipedia<br />
*** http://commonsensereasoning.org/<br />
*** Levesque, Davis, and Morgenstern (2012). "The Winograd Schema Challenge". KR<br />
*** Levesque (2013). "On Our Best Behaviour". IJCAI Research Excellence Award Presentation <br />
*** Morgenstern, Davis, and Ortiz (2016). "Planning, Executing, and Evaluating the Winograd Schema Challenge". AI Magazine<br />
<br />
* Human Baseline for Commonsense Reasoning Tasks<br />
** sources<br />
*** Davis, Morgenstern, Oriz (2016). [https://cs.nyu.edu/faculty/davise/papers/WinogradSchemas/WS2016SubjectTests.pdf Human tests of materials for the Winograd SchemaChallenge 2016]<br />
*** Bender, Establishing a Human Baseline for the Winograd Schema Challenge. MAICS 2015 <br />
*** Nangia and Bowman, [https://woollysocks.github.io/assets/GLUE_Human_Baseline.pdf A Conservative Human Baseline Estimate for GLUE: People Still (Mostly) Beat Machines] <br />
*** Nangia, Bowma, Human vs. Muppet: A Conservative Estimate of Human Performance on the GLUE Benchmark, 2019<br />
<br />
* Machine Learning approaches towards WSC<br />
** sources<br />
*** Trichelair et al. (2018). [https://arxiv.org/abs/1811.01778 On the Evaluation of Common-Sense Reasoning in Natural Language Understanding]<br />
*** Trinh and Le (2018). [https://arxiv.org/abs/1806.02847 A Simple Method for Commonsense Reasoning]<br />
*** Radford et al. (2019). [https://d4mucfpksywv.cloudfront.net/better-language-models/language_models_are_unsupervised_multitask_learners.pdf Language Models are Unsupervised Multitask Learners]<br />
*** Ruan, Zhu, Ling, Liu, Wei .[https://arxiv.org/pdf/1904.09705.pdf Exploring Unsupervised Pretraining and Sentence Structure Modeling for Winograd Schema Challenge] <br />
*** Kocijan, Cretu, Camburu, Yordanov, Lukasiewicz (2019). [https://arxiv.org/abs/1905.06290 A Surprisingly Robust Trick for Winograd Schema Challenge] <br />
<br />
* A critical view on Commonsense Reasoning Tasks<br />
** possible sources<br />
*** Trichelair, Emami, Trischler, Suleman, Cheung. "How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG"<br />
}}</div>Emma Dietz