Working in the field of Iris Recognition? Join NICE-2 Contest!

 
SPIRU HARET University
Department of Mathematics and Computer Science



Artificial Intelligence & Computational Logic Laboratory
Artificial Intelligence Curriculum | Computational Logic Curriculum | Student Area | Student Portfolio | Complementary Lectures
People   Recommended Educational Resources  
Archive \ Artificial Intelligence \ 2009-2010 \ First Semester \

Professor PhD Luminita State, Teaching Assistant, PhD Candidate Nicolaie Popescu-Bodorin

 
  Artificial Intelligence Curriculum   [^ top ^]

Artificial Intelligence & Computational Logic Laboratory

Department of Mathematics and Computer Science

SPIRU HARET University

Artificial Intelligence Laboratory

Computational Logic Laboratory
Nicolaie Popescu-Bodorin
  • Artificial Intelligence 1 (Knowledge Representation & Reasoning): EN, RO
  • Artificial Intelligence 2 (Neural Networks, Classification, Signal & Image Processing): EN, RO
    •   Computational Logic Curriculum   [^ top ^]
  • Computational Logic: EN, RO
    •   Student Area   [^ top ^]
    Artificial Intelligence Labs:
    1. 12-16 Oct 2009, Short Intro to PROLOG:
      (a) Lab.1, (b) Why AI?, (c) Some hints for Lab.1 (d) Code for Lab.1
      Student Contest: Winner of the Week (SC-WW): Iosif Chelu
       
    2. 19-23 Oct 2009, Flow Control Statements in PROLOG:
      (a) Lab.2, (b) Code for Lab.2
      SC-WW: Iosif Chelu, Paul Mateescu
       
    3. 26-30 Oct 2009, Recursion in PROLOG; Lists in PROLOG:
      (a) Lab.3 - Recursion, (b) Code (Recursion), (c) Code (Euler's Number)
      (d) Lab.3 - Lists, (e) Code 1 (Lists), (f) Code 2 (Lists)
      Weekend Lectures:
      A Simple Intelligent Software Adviser for a Simple Problem of Elementary Geometry, Code
      SC-WW: Iosif Chelu, Paul Mateescu
       
    4. 02-06 Nov 2009, Lists in PROLOG
      (a) Lab.4 - List processing examples (code)
      (b) Lab.4 - Data abstraction/aggregation (code)
      (c) Lab.4 - Computing the Histogram of a Signal: code, homework assignment (HA)
      SC-WW: Iosif Chelu, Paul Mateescu
       
    5. 09-13 Nov 2009, List Processing in Prolog: Lists, Lists of lists, Sets, Lists of structured objects
      (a) Lab.5 - List Processing in Prolog: Lists, Lists of lists, Sets (code)
      (b) Lab.5 - Symbolic vs. Numeric Computation - Polynomials (code, HA)
      (c) Lab.5 - Supertypes in Prolog, Composite Lists (code, examples)
      (d) Lab.5 - Lists, Secvential Processing, Recursion (commented code)
      SC-WW: Paul Mateescu, Iosif Chelu
      Students who have demonstrated a Remarkable Progress (RP): Cristina Dumitrescu, Florin Adrian Gerlan, Oana-Monica Micu
       
    6. 16-20 Nov 2009, Lists, Strings & Text Processing in Prolog
      (a) Lab.6 - String Processing in Prolog
      SC-WW: Paul Mateescu, Iosif Chelu
       
    7. 23-27 Nov 2009, Lists, Matrices, Sorting
      (a) Lab.7 - Lists, Matrices, Sorting
      SC-WW: Paul Mateescu, Iosif Chelu
       
    8. 30 Nov - 04 Dec 2009, Implementing Sorting Algorithms in Prolog:
      (a) Lab.8 - Selection Sort
      (b) Lab.8 - Insertion Sort
      (c) Lab.8 - Quick Sort
      (d) Lab.8 - Heap Sort
      SC-WW: Paul Mateescu, Iosif Chelu
       
    9. 07 - 11 Dec 2009, Introduction to Rooted Binary Trees in Prolog:
      (a) Lab.9 - Rooted Binary Trees: Counting nodes and leaves
      (b) Lab.9 - Tree traversals: Preorder, Inorder, Postorder
      SC-WW: Paul Mateescu, Iosif Chelu
       
    10. 14 - 18 Dec 2009, Rooted Binary Trees in Prolog
      (a) Lab.10 - Rooted Binary Trees: Tree Sort
      (b) Lab.10 - Root-to-leaf paths, Depth of a Rooted Binary Tree, Tree Rotation, Root-Balancing, Root-Balancing Tree Sort
      (c) Lab.10 - Full / Perfect Rooted Binary Trees in Prolog
       
    11. 4 & 11 Ian 2009, Prolog exam subjects from previous years

       
    12. 5 Febr 2009, The Exam

       
      Student Portfolio   [^ top ^]
    Paul Mateescu:
    1. Histogram Computation in Prolog
    2. Working with Polynomials in Prolog
    3. Matrix-to-vector and vector-to-marix conversions in Prolog
    4. Transpose of a matrix in Prolog
    5. Insert-Sort, Bubble-Sort, Quick-Sort
    6. A Special Summation
    7. Tree traversal: inorder, postorder, preorder, levels
    Iosif Chelu:
    1. Vector-Matrix Conversion in Prolog
    2. Binary Trees: Summation of nodes
    3. Reading Binary Trees
      Complementary Lectures   [^ top ^]
    Artificial Intelligence 1:
    1. Prolog Experiments in Discrete Mathematics, Logic, and Computability, James L. Hein, Portland State University, 2005.
    2. Logic Programming with Prolog, Max Bramer, Springer, 2005;
    3. The Art of Prolog, Leon Sterling, Ehud Shapiro, The MIT Press (2-nd ED), 1999.
    4. Agent-Oriented Programming - From Prolog to Guarded Definite Clauses, Matthew M Huntbach, Graem A Ringwood, Springer, 1999.
    5. Prolog Programming in Depth, M. Covington, D. Nute, A. Vellino, Prentice Hall, 1997.
    6. Logic, Programming and Prolog, Ulf Nilsson and Jan Maluszynski, John Wiley & Sons (2-nd ED), 1995.
    7. Prolog Programming for Artificial Intelligence, Ivan Bratko, Addison-Wesley, 1986.
      Interesting Educational Resources   [^ top ^]
    Computational Intelligence Resources: General Resources for Students:
    1. EFF Cooperative Computing Awards - Prizes for brilliant minds
    2. www.ProjectEuler.net
    3. How to Be(come) a Good Graduate Student
    4. Don't forget to have fun!
    5. Internal Rules at AICL Laboratory
      People   [^ top ^]
  • Course instructor: Professor Luminita STATE
  • Laboratory instructor: Teaching Assistant Nicolaie Popescu-Bodorin
    		•  
    Page maintained by Nicolaie Popescu-Bodorin,
    Contact (e-mail): nb.popescu.mi # spiruharet.ro
    Last update: February 14, 2010