I050 Logic programming II

Faculty of Informatics
Spring 2001
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Luděk Matyska, CSc. (lecturer)
Guaranteed by
prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: prof. RNDr. Luděk Matyska, CSc.
Timetable
Thu 9:00–10:50 B411
Prerequisites
I013 Logic Programming I
Passing through the lecture I013 Logic Programming I is essential.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Advanced programming techniques in Prolog. Queues, lists, enumeration; cuts, all solutions. DCG grammars.
  • Alternative computational models -- bottom up versus top down. Databaze operations and their use to evaluate logic programs. Magic sets and transformations.
  • Abstract interpretation. Program transformation. Global analysis, analysis of computational independence of program parts.
  • Parallel logic programming. Concurrent Constraint Logic Programming.
  • Implementation. derivation of individual instructions, abstract machine. Implementation of parallel logic programming languages, ANDORA, PANDORA and other systems. Special constructions (blocks, events, ...).
  • Constraint logic programming: practical usability issues.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught once in two years.
The course is also listed under the following terms Spring 1997, Spring 1999.

I050 Logic programming II

Faculty of Informatics
Spring 1999
Extent and Intensity
2/0. 2 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Luděk Matyska, CSc. (lecturer)
Guaranteed by
Contact Person: prof. RNDr. Luděk Matyska, CSc.
Prerequisites
I013 Logic Programming I
Passing through the lecture I013 Logic Programming I is essential.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Advanced programming techniques in Prolog. Queues, lists, enumeration; cuts, all solutions. DCG grammars.
  • Alternative computational models -- bottom up versus top down. Databaze operations and their use to evaluate logic programs. Magic sets and transformations.
  • Abstract interpretation. Program transformation. Global analysis, analysis of computational independence of program parts.
  • Parallel logic programming, ANDORA princip
  • Implementation. derivation of individual instructions, abstract machine. Implementation of parallel logic programming languages. Special constructions (blocks, events, ...).
  • Constraint logic programming, theoretical foundations, over-constrained systems, generalized propagation.
Literature
  • sborníky ILP, ISLP a další z posledních let
  • AÏT-KACI, Hassan. Waren's abstract machine : a tutorial reconstruction. Cambridge: Massachusetts Institute of Technology, 1991, 114 s. ISBN 0262510588. info
  • O'KEEFE, Richard A. The Craft of Prolog. Cambridge: Massachusetts Institute of Technology, 1990, 387 s. ISBN 0262150395. info
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught annually.
The course is taught every week.
The course is also listed under the following terms Spring 1997, Spring 2001.

I050 Logické programování II

Faculty of Informatics
Spring 1997
Extent and Intensity
2/0. 2 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Luděk Matyska, CSc. (lecturer)
Guaranteed by
Contact Person: prof. RNDr. Luděk Matyska, CSc.
Prerequisites
Passing through the lecture I013 Logic Programming I is essential.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Advanced programming techniques in Prolog. Queues, lists, enumeration; cuts, all solutions. DCG grammars.
  • Alternative computational models -- bottom up versus top down. Databaze operations and their use to evaluate logic programs. Magic sets and transformations.
  • Abstract interpretation. Program transformation. Global analysis, analysis of computational independence of program parts.
  • Parallel logic programming. Concurrent Constraint Logic Programming.
  • Implementation. derivation of individual instructions, abstract machine. Implementation of parallel logic programming languages, ANDORA, PANDORA and other systems. Special constructions (blocks, events, ...).
  • Constraint logic programming: practical usability issues.
Language of instruction
Czech
The course is also listed under the following terms Spring 1999, Spring 2001.

I050 Logic programming II

Faculty of Informatics
Spring 2002

The course is not taught in Spring 2002

Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Luděk Matyska, CSc. (lecturer)
Guaranteed by
prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: prof. RNDr. Luděk Matyska, CSc.
Prerequisites
I013 Logic Programming I
Passing through the lecture I013 Logic Programming I is essential.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Advanced programming techniques in Prolog. Queues, lists, enumeration; cuts, all solutions. DCG grammars.
  • Alternative computational models -- bottom up versus top down. Databaze operations and their use to evaluate logic programs. Magic sets and transformations.
  • Abstract interpretation. Program transformation. Global analysis, analysis of computational independence of program parts.
  • Parallel logic programming. Concurrent Constraint Logic Programming.
  • Implementation. derivation of individual instructions, abstract machine. Implementation of parallel logic programming languages, ANDORA, PANDORA and other systems. Special constructions (blocks, events, ...).
  • Constraint logic programming: practical usability issues.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught once in two years.
The course is taught every week.
The course is also listed under the following terms Spring 1997, Spring 1999, Spring 2001.

I050 Logic programming II

Faculty of Informatics
Spring 2000

The course is not taught in Spring 2000

Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Luděk Matyska, CSc. (lecturer)
Guaranteed by
prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: prof. RNDr. Luděk Matyska, CSc.
Prerequisites
I013 Logic Programming I
Passing through the lecture I013 Logic Programming I is essential.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Advanced programming techniques in Prolog. Queues, lists, enumeration; cuts, all solutions. DCG grammars.
  • Alternative computational models -- bottom up versus top down. Databaze operations and their use to evaluate logic programs. Magic sets and transformations.
  • Abstract interpretation. Program transformation. Global analysis, analysis of computational independence of program parts.
  • Parallel logic programming. Concurrent Constraint Logic Programming.
  • Implementation. derivation of individual instructions, abstract machine. Implementation of parallel logic programming languages, ANDORA, PANDORA and other systems. Special constructions (blocks, events, ...).
  • Constraint logic programming: practical usability issues.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught once in two years.
The course is taught every week.
The course is also listed under the following terms Spring 1997, Spring 1999, Spring 2001.
  • Enrolment Statistics (recent)