|Pre-requisites||52 220||Imperative Programming|
|52 221||Object Oriented Programming|
|Recommended||52 344||F.S.D 1 or basic knowledge of formal logic|
|Availability||As an option or an elective|
|Examination||Written [2hr 00]|
To help the student to a theoretical and practical knowledge of the logic programming paradigm, using the language Prolog.
On completion of the class, a student should be able:
Formal Logic: revision of Propositional and First Order Predicate Logic, conjunctive normal form, clausal form, knowledge representation by clausal form.
Logic Programming: basic concepts, the resolution rule of inference, application strategies, pattern matching, backtracking, computational space - total and standard, non-determinism, procedural and declarative semantics.
Prolog: Horn Clauses, terms and terminology, built-in predicates, non-determinism and input/output, the cut, negation, list processing, abstract data types.
Applications: practical work, databases, natural language processing.
|© Paul Goldfinch 1996||Return to 52 349 Menu|