Deductive database systems
J Ceddia
6 points
* 4 hours per week
* Second semester
* Caulfield,
Peninsula
* Prerequisites: COT4230
Objectives At the completion of this subject students should understand the meaning of a logic program; appreciate the limitations of a relational DBMS; and understand how a relational DBMS may be extended to simulate a logic program.
Synopsis Information representation using predicate calculus, converting predicate calculus well-formed formulae to clausal form, horn clauses, unification and resolution using horn clauses. Prolog syntax, non-logical predicates. Computational models. Integrity constraints: domain, entity, referential and user-defined - how they are used and implemented. Relational representation using rules. The application of recursive retrieval techniques. Applications in SQL, Prolog, SQL2 and other systems.
Assessment Examination (2 hours): 50%
* Practical work: 50%
Prescribed texts
Ullman J The principles of database and knowledge-based systems vols 1 and 2, Computer Science Press, 1989
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |