A computer program is viewed as a Formula. A programming language, with its formal syntax and
with the proof rules that define its semantics, is a formal system for which program execution
provides only a model. The computers are conceived with the help of logical devices and are
programmed in a logical manner.
Programming Lenguage
Core areas of Discrets Mathematics
Knowledge Management
(Intelligent Information Systems;
Expert Systems; Knowledge
Representation; Automated
Reasoning; Natural Language
Processing etc.)
Database Systems (Data Models:
relational, entityrelationship, etc.;
Query-Processing Languages: model
theory, completeness, consistency,
deduction, etc.; Knowledge-Based
Systems with incomplete, imperfect
and tentative information requiring
probabilistic, modal, possibilistic,
belief and fuzzy reasoning; Natural
Language Interfaces etc.)
Hardware Topics (Circuit
Design/Optimization; Hardware
Design Languages; Processor
verification; Correctness of OS
kernel; Language Implementation of
given processors etc.)
Examples
Some applications of graphs and trees
1) Neural nets (NN )
2)Semantic Nets (SN)
3)Bayesian (Causal) Networks (BN)
4) MinimumSpanning Trees
5) BinaryTrees
6) Compression of(stored or transmitted)
data using Huffman algorithm
7) Creating a totally ordered list and
searching items
8) The reverse Polish notation
Bernardo Ramirez A0120275
Roventa, E. Dept. of
Comput. Sci. & Eng., York
Univ., Toronto, ON Spircu, T.