CS5303 - Logical Foundations of Computer Science
1. To check whether a given logical statement is a Tautology, Contradiction or Satisfiable using True and/or False Tableaux Method.
The program is done using SWI Prolog 5.6.x
|
|
2. To check that given Sudoku puzzle is solvable. In other words, checking the validity of the given state.
The program is done using SWI Prolog 5.6.x
|
|
3. Implementing Runtime Assertions using Prolog.
In this project, a language translator was built, that would convert java source code (.java) into prolog source code (.pl). The prolog code would then be used to check assertions.
The program is done with the help of Eclipse (ver: 3.3.2) Scanner and Parser, java in general and SWI Prolog 5.6.x
|
|