Computational Logic: Rozdiel medzi revíziami
(Revert) |
(Midterm results and details removed. Results (midterm and wiki) are now linked and password-protected.) |
||
| Riadok 20: | Riadok 20: | ||
== Basic Information == | == Basic Information == | ||
| − | + | <!-- | |
| − | ! | + | |
| − | + | ||
'''MIDTERM: Wednesday, November 3th, 9:50 (room C !!! )''' | '''MIDTERM: Wednesday, November 3th, 9:50 (room C !!! )''' | ||
| Riadok 30: | Riadok 28: | ||
- resolution | - resolution | ||
- semantic notions (interpretation, model, entailment); f.ex. a set of formulae is given, propose an interpretation, which is (or is not) a model of the set; decide whether a fomula is entailed by the set | - semantic notions (interpretation, model, entailment); f.ex. a set of formulae is given, propose an interpretation, which is (or is not) a model of the set; decide whether a fomula is entailed by the set | ||
| − | + | --> | |
| − | + | ||
* lectures: Tue 13:10 2h XII | * lectures: Tue 13:10 2h XII | ||
| Riadok 40: | Riadok 37: | ||
* Lecture notes: [http://wiki.matfyz.sk/CL2010_Poznámky_k_predmetu_Výpočtová_logika http://wiki.matfyz.sk/CL2010_Poznámky_k_predmetu_Výpočtová_logika] | * Lecture notes: [http://wiki.matfyz.sk/CL2010_Poznámky_k_predmetu_Výpočtová_logika http://wiki.matfyz.sk/CL2010_Poznámky_k_predmetu_Výpočtová_logika] | ||
| + | |||
| + | * Results (login required) | ||
| + | ** [http://ii.fmph.uniba.sk/~homola/complog/score-midterm.txt Midterm] | ||
| + | ** [http://ii.fmph.uniba.sk/~homola/complog/score-wiki.txt Wiki assignment] | ||
== Evaluation and Conditions == | == Evaluation and Conditions == | ||
Verzia zo dňa a času 13:19, 9. november 2010
Course opens in Winter semester 2010/2011 for the first time. First lecture: Tue 21 September 2010 in lecture room XII. See more details below.
Obsah
Computational Logic 2-AIN-108
| Course name and code: | Computational Logic (2-AIN-108) |
| Prerequisite courses: | none |
| Available in/recommended study year: | Winter semester / 1 |
| Form and # of hours/week: | L - lecture (2), P - practicals (2) |
| Credits: | 5 |
| Evaluation (semester/exam): | 50/50 |
| Course webpage: | you are reading it |
| Information sheet: | 2-AIN-108 information sheet |
| Teacher(s): | Martin Homola, Ján Šefránek |
| E-mail: | homola ii.fmph.uniba.sk, sefranekii.fmph.uniba.sk
|
| Homepage(s): | http://ii.fmph.uniba.sk/~homola/ http://ii.fmph.uniba.sk/~sefranek/ |
Short description:
The course introduces logic as a method for computational problem solving. It introduces multiple practical logics and logic based systems such as logic programs, modal logics, description logics and ontologies, multi context systems, etc. with readily available reasoners.
Offered in these study programs: Compulsory elective for the Master program in Applied Informatics
Recommendations: none
Basic Information
- lectures: Tue 13:10 2h XII
- labs: Wed 9:50 2h V
- labs: Wed 16:30 2h H3
- first lecture: Tue 21 September 2010
- Results (login required)
Evaluation and Conditions
There will be a midterm and a final exam. During the semester you can earn evaluation points at the practicals (possibly for homeworks) and by participating on the wiki-based collaborative lecture notes. You can earn up to 102 points:
- practicals: 3 pts every week (6 weeks)
- lecture notes: 3 pts every week (13 weeks)
- midterm: 15 pts
- exam: 30 pts
The following grading scale will be used:
- A = 85 pts and more
- B = 74 pts and more
- C = 64 pts and more
- D = 54 pts and more
- E = 45 pts and more
- Fx = less than 45 pts
Syllabus
- Propositional Logic (PL) and First Order Logic (FOL)
- The language of PL and FOL
- Semantics: interpretation and model
- Satisfiability and logical consequence
- Proof theory: deduction, skolemization, unification, resolution
- Modal Logic
- Modal operators box and diamond
- System K
- Basic axioms of modal logic
- Semantics: Kripke structures
- Basic axioms of modal logic
- Systems T, B, S4 and S5 (briefly)
- Description Logics (DL) and Ontologies
- Ontologies
- Description logic ALC: syntax and semantics
- Tableaux reasoning algorithm
- More expressive DL (briefly)
- Applications
- Logic Programming (LP)
- Horn clauses
- SLD-resolution and Prolog
- Definite LP
- Normal LP
- Stable model semantics and Answer Set Programming
- Extensions: extended, disjunctive and nested LP (briefly)
- Logic of Context
- Problem of generality in AI, need of context
- Context as a box
- Context properties and operations
- Local Model Semantics
- Multi-context Systems
- Dynamic Logic
- Epistemic Logic
- Temporal Logic (♠)
- Multi-valued Logics (♠)
♠) The last two topics of the course may be left out due to time constraints
Lecture Notes
There is no coherent study-material for this course. You are advised to take notes. To facilitate this, we have created dedicated lecture-notes pages in the students' wiki where you are all asked to regularly contribute in a collaborative fashion. Your goal is to keep coherent, full-scope, up-to-date lecture notes, covering all material from the lectures. And at least briefly, also the practicals. For your activity you can earn up to 3 pts per week. Visit the lecture notes.
Literature
To be specified