(file Exercises-10-ARG.pdf‎ added)
(Structure updated)
Line 35: Line 35:
 
* Fx: less than 23 points
 
* Fx: less than 23 points
  
== Lecture Slides and Exercises ==
+
== Lecture Slides ==
 
+
=== Lectures ===
+
 
# [[File:CompLog2012-Lecture-1-FOL.pdf|First Order Logic, Syntax and Semanics]] (Updated 9 Oct: some notational fixes)  
 
# [[File:CompLog2012-Lecture-1-FOL.pdf|First Order Logic, Syntax and Semanics]] (Updated 9 Oct: some notational fixes)  
 
# [[File:CompLog2012-Lecture-2-Reasoning-with-FOL.pdf|Calculus, Resolution]]  
 
# [[File:CompLog2012-Lecture-2-Reasoning-with-FOL.pdf|Calculus, Resolution]]  
Line 48: Line 46:
 
# [[File:CompLog2012-Lecture-9-SAF.pdf|Structured Argumentation Frameworks]]  
 
# [[File:CompLog2012-Lecture-9-SAF.pdf|Structured Argumentation Frameworks]]  
  
=== Exercises ===
+
== Exercises ==
 
# [[File:Exercises-1-FOL.pdf]]
 
# [[File:Exercises-1-FOL.pdf]]
 
# [[File:Exercises-2-FOL.pdf]]
 
# [[File:Exercises-2-FOL.pdf]]

Revision as of 14:51, 5 March 2013

This is the homepage of 2-AIN-108 Computational Logic course in the Master program of Applied Informatics.

  • Lecturers: Martin Baláž, Martin Homola
  • Lab assistants: Martin Baláž, Jozef Frtús
  • Schedule: Tue 9:50 F1-328 (lectures), Wed 13:10 M-V (labs) Thu 8:10 M-XI (labs)
  • New: Project assignments (student's wiki)
  • New: Lab Evaluation: Google Doc

Note: it is likely that due to low number of students this year one of the lab sessions will be cancelled

Syllabus

  1. First Order Logic
  2. Description logics and ontologies
  3. Logic programming
  4. Dynamic logic
  5. Argumentation
  6. Multi-context systems (*)

Evaluation

  • Midterm: 10 pints
  • Exam: 30 points (min 10)
  • Labs: 10 points (min 3)
  • Project/Homework: 5 points (min 1)
  • Total: 55 points

Grading:

  • A: 47 and more points
  • B: 41 and more points
  • C: 35 and more points
  • D: 29 and more points
  • E: 23 and more points
  • Fx: less than 23 points

Lecture Slides

  1. Súbor:CompLog2012-Lecture-1-FOL.pdf (Updated 9 Oct: some notational fixes)
  2. Súbor:CompLog2012-Lecture-2-Reasoning-with-FOL.pdf
  3. Súbor:CompLog2012-Lecture-3-DL.pdf
  4. Súbor:CompLog2012-Lecture-4-Reasoning-with-DL.pdf
  5. Súbor:CompLog2012-Lecture-5-Logic Programming.pdf
  6. Súbor:CompLog2012-Lecture-6-Prolog.pdf
  7. Súbor:CompLog2012-Lecture-7-ASP.pdf
  8. Súbor:CompLog2012-Lecture-8-AAF.pdf (Updated 5 Dec: fixed definition of admissible set)
  9. Súbor:CompLog2012-Lecture-9-SAF.pdf

Exercises

  1. Súbor:Exercises-1-FOL.pdf
  2. Súbor:Exercises-2-FOL.pdf
  3. Súbor:Exercises-3-DL.pdf
  4. Súbor:Exercises-4-DL.pdf
  5. Súbor:Exercises-5-DL.pdf
  6. Súbor:Exercises-6-LP.pdf
  7. Súbor:Exercises-7-LP.pdf
  8. Súbor:Exercises-8-LP.pdf collection of exercises: stable models
  9. Súbor:Exercises-9-LP.pdf
  10. Súbor:Exercises-10-ARG.pdf