|Mathematical foundations of Computer Science|
|Teaching Staff in Charge|
|Assoc.Prof. TATAR Doina, Ph.D., firstname.lastname@example.org
Lect. ROBU Judit, Ph.D., email@example.com
Lect. LUPEA Mihaiela, Ph.D., firstname.lastname@example.org
The aims of the course is the presentation of logic foundations for computer science: propositional and predicate calculus, boolean algebra and boolean functions. The connection with logic programming and logical circuits is presented. Additionally, the codes of information representation are introduced.
1. The propositional and predicate calculus, from algebric point of view and as deductive systems. Normal forms. Decidability problem in predicate calculus: direct and by refutation methods of theorem proving (Herbrand method, resolution method).
2. Boolean algebra, boolean functions and applications. Canonic and maximal monoms. Simplification of boolean functions by Veitch, Mc. Quine and Moisil methods. Boolean equations.
3. Combinational and sequential circuits.
4. Systems of numeration, conversions. The direct, inverse, and complementary codes. Theorems of addition. Representation of numeric information.
1. Cl.Benzaken, "Systeme formels. Introduction a la logique", ed.Masson, 1991.
2. M.Clarke, "Logic for Computer Science", ed. Addison-Wesley 1990.
3. J.P.Delahaye, "Outils logiques pour l'intelligence artificielle", ed.Eyrolls, 1986.
4. M.Fitting, "First-order logic and Automated Theorem Proving", Ed.Springer Verlag, 1990.
5. Lawrense C. Paulson : "Logic and Proof", U. Cambridge, 2000, curs on-line.
6. D.Tatar: " Inteligenta artificiala: demonstrare automata de teoreme si NLP", Ed. Microinformatica, 2001.
7. D.Tatar, "Bazele matematice ale calculatoarelor", litografiat, editia 1993, editia 1999.
8.(ed) A.Thayse : "From standard logic to Logic Programming", ed.J.Wiley, vol1(1989), vol2(1989), vol3(1990).
The examination consists of writed exam with the subject from all the matter.