Files:DescriptionFile size FormatBrowse
Fulltext0.14 MBPDF (requires Acrobat Reader)Previous | Next
Authors:Tibor Tibor: Faculty of Informatics, Eötvös Loránd Univ., Budapest, Hungary
Publication title:Teaching Prolog Programming at the Eötvös Loránd University; Budapest
Conference:Proceedings of the First International Workshop on Teaching Logic Programming: TeachLP 2004
Publication type: Abstract and Fulltext
Article No.:003
Abstract:At the Eötvös Loránd and University (Budapest) we have two courses on Prolog programming; especially for program designer (MsC) students. Our main objective is to help the students find the subproblems in their projects to be solved with Prolog; and enable them to write the necessary code. At first our main concern is to give clear notions. Next we focus on the technical details of writing small programs. Then we incorporate the questions raised by developing big applications.

In our first course we give an overview of the history of logic programming (LP). We introduce the basic notions of this area; and we discuss the widely used LP language; Prolog; emphasizing a kind of pragmatic programming methodology which helps us to develop correct and effective programs. We talk many short examples over; in order to make the students feel the taste of LP in small.

In our second course we focus on writing bigger programs and using advanced Prolog programming techniques like generate and test techniques; exception handling; writing and using second-order predicates; splitting our programs into modules; using partial data structures; d-lists; and logic grammars. We discuss many typical problems to be solved with logic programs.

No. of pages:8
Series:Linköping Electronic Conference Proceedings
ISSN (print):1650-3686
ISSN (online):1650-3740
Publisher:Linköping University Electronic Press; Linköpings universitet

Tibor Tibor (2004). Teaching Prolog Programming at the Eötvös Loránd University; Budapest, Proceedings of the First International Workshop on Teaching Logic Programming: TeachLP 2004;article=003 (accessed 2/9/2016)