Science of Computational Logic

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Science of Computational Logic

Lehrveranstaltung mit SWS 2/2/0 (Vorlesung/Übung/Praktikum) in WS 2017

Dozent

Tutor

Umfang (SWS)

  • 2/2/0

Module

Leistungskontrolle

  • Mündliche Prüfung

Note that all slides from the lecture are online now. 

This is the follow-up course to Logic. The course will run with 4 hours of lectures and 4 hours of tutorials per week.

We cover the areas of automated deduction and automated deduction systems, knowledge representation and reasoning, logic-based databases, program development, language design, semantics and verification methods, computational logic and machine learning, computational logic and natural language processing.

Schedule

  • the lecture and the tutorial will take place in room E05
  • the lecture will take place on Monday, 4.DS (13:00 - 14:30) and on Thursday, 4.DS (13:00 - 14:30)
  • the tutorial will take place on Tuesday, 2.DS (9:20 - 10:50,) and on Friday, 6.DS (16:40 - 18:10), starting on 5.1.2018
  • The exam will take place on Thursday, 15.2.2018 and on Monday, 19.2.2018. An email with the exact times has been sent around.

Lecture Slides

The lecture slides can be found here (updated on 9.2.2018). The user name is student and the password will be given during the lecture.

Exercises

During the tutorial we will only discuss your solutions to the exercises. That means that you are supposed to solve the exercises by yourself beforehand.


References

  • Description Logics:
    • F. Baader. What's new in description logics. Informatik Spektrum, 34(5):434-442, 2011.
    • F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. Patel-Schneider. The Description Logic Handbook. Cambridge University Press, 2003.
  • Paramodulation/Rewriting:
    • David A. Plaisted. Equational reasoning and term rewriting system. In D. M. Gabbay, C. J. Hogger and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, chapter 5. Oxford University Press, Oxford, 1993.
  • Unification Theory:
    • F. Baader and W. Snyder. Unification Theory. In J. A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers B.V., 1999.
  • Fluent Calculus:
    • S. Hölldobler and J. Schneeberger. A new deductive approach to planning.New Generation Computing, 8:225-244, 1990.
  • Abduction:
    • R. A. Kowalski. Logic programming in arficial intelligence. In Proceedungs of the International Joint Conference on Artificial Intelligence, 1991.
    • A.C. Kakas, R.A. Kowalski and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719-770, 1993.
  • Induction:
    • C. Walther. Mathematical Induction. In D. M. Gabbay, C. J. Hogger and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, pages 127-228. Oxford Science Publications, 1994.
  • Default Logic:
    • G. Antoniou. A tutorial on default logics. ACM Computing Surveys, 31(4):337-359, 1999.
  • Machine Learning:
    • Tom M. Mitchell. Machine Learning, McGraw-Hill and MIT Press,1997.


Additional suggestions by Tobias

  • N. Dershowitz. Termination of Rewriting. In Journal of Symbolic Computation (1987) 3, 69-116