ITA | ENG
B012503 - ADVANCED PROGRAMMING TECHNIQUES AND PARADIGMS
Main information
Teaching Language
Course Content
Suggested readings
Learning Objectives
Prerequisites
Teaching Methods
Further information
Type of Assessment
Course program
Academic Year 2011-12
Coorte 2011 - Second Cycle Degree in COMPUTER SCIENCE
Course year
First year - Second Semester
Belonging Department
Statistics, IT and its applications "G. Parenti" (DISIA)
Course Type
Single education field course
Scientific Area
INF/01 - INFORMATICS
Credits
6
Teaching Hours
48
Teaching Term
01/03/2012 ⇒ 15/06/2012
Attendance required
No
Type of Evaluation
Final Grade
Course Content
show
Course program
show
Lectureship
Teaching Language
Italian
Course Content
Terms, Syntactic unification. Clausal form. Proof theory: an Hilbert Calculus. Herbrand Algebra and Herbrand theorem.Resolution Calculus for general clauses, its correctness and completeness. Horn clauses Logic. Logic Programming and SLD Resolution. Semantics of logic programming, negation and SLDNF resolution. Prolog language. Sample case studies: difference lists and DCG, terms manipulation, interpreter/compiler construction.
Suggested readings (Search our library's catalogue)
Textbooks:
L. Console, E. Lamma, P. Mello, M. Milano - Programmazione Logica e Prolog, Utet, Torino
V. Sperschneider, G. Antoniou - Logic: A Foundation for Computer Science, Addison Wesley Pub. Co.
J.W. LLoyd - Foundations of Logic Programming, Springer Verlag
K.R. Apt - From Logic Programming to Prolog, Prentice Hall,1997
L. Console, E. Lamma, P. Mello, M. Milano - Programmazione Logica e Prolog, Utet, Torino
V. Sperschneider, G. Antoniou - Logic: A Foundation for Computer Science, Addison Wesley Pub. Co.
J.W. LLoyd - Foundations of Logic Programming, Springer Verlag
K.R. Apt - From Logic Programming to Prolog, Prentice Hall,1997
Learning Objectives
Knowledge acquired:
Theoretical basis (term unification, resolution principle) and practical applications of declarative programming paradigm based on predicate logic. Prolog programming language.
Competence acquired
Suitable use of declarative programming paradigm, particularly use of recursion and information representation by means of terms in the solution of various kind of problems.
Skills acquired (at the end of the course):
Realization of a project as the solution of an actual problem by using logic programming methodologies and Prolog language.
Theoretical basis (term unification, resolution principle) and practical applications of declarative programming paradigm based on predicate logic. Prolog programming language.
Competence acquired
Suitable use of declarative programming paradigm, particularly use of recursion and information representation by means of terms in the solution of various kind of problems.
Skills acquired (at the end of the course):
Realization of a project as the solution of an actual problem by using logic programming methodologies and Prolog language.
Prerequisites
None
Teaching Methods
Total hours of the course (including the time spent in attending lectures, seminars, private study, examinations, etc...): 150
Hours reserved to private study and other indivual formative activities: 102
Hours reserved to private study and other indivual formative activities: 102
Further information
Frequency of lectures, practice and lab: Recommended
Teaching Tools
UniFi E-Learning: http://e-l.unifi.it
Office Hours:
By appointment.
Tel. 055 4598751 - 4598752
Fax. 055 4598930
E_mail: gianni.aguzzi@unifi.it
Teaching Tools
UniFi E-Learning: http://e-l.unifi.it
Office Hours:
By appointment.
Tel. 055 4598751 - 4598752
Fax. 055 4598930
E_mail: gianni.aguzzi@unifi.it
Type of Assessment
Exam modality:
Oral exam and discussion of an elaborate (in Prolog).
Oral exam and discussion of an elaborate (in Prolog).
Course program
Course Contents (detailed programme):
Syntactic unification among terms and its decidability.
Proof theory. Hilbert Calculus. Normal forms of formulas, clausal form. Herbrand Algebra and Herbrand theorem. Proof by refutation, Resolution Calculus for general clauses, its correctness and completeness.
Horn clauses Logic.
Logic Programming and SLD Resolution.
Operational semantics of logic programming. The negation: SLDNF resolution.
Prolog language.
Applications: difference lists and DCG, terms manipulation, interpreter/compiler construction.
Syntactic unification among terms and its decidability.
Proof theory. Hilbert Calculus. Normal forms of formulas, clausal form. Herbrand Algebra and Herbrand theorem. Proof by refutation, Resolution Calculus for general clauses, its correctness and completeness.
Horn clauses Logic.
Logic Programming and SLD Resolution.
Operational semantics of logic programming. The negation: SLDNF resolution.
Prolog language.
Applications: difference lists and DCG, terms manipulation, interpreter/compiler construction.