Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CSE420 SYMBOLIC LOGIC AND LOGIC PROCESSING 18306::Savleen Kaur 3.0 0.0 0.0 3.0
Course Category Courses with conceptual focus
TextBooks
Sr No Title Author Edition Year Publisher Name
T-1 LOGIC AND PROLOG
PROGRAMMING
1. SAROJ KAUSHIK 7th 2008 NEW AGE INTERNATIONAL LTD.
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 LOGIC IN COMPUTER SCIENCE:
MODELING AND REASONING
ABOUT SYSTEMS
MICHAEL HUTH AND
MARK RYAN
2nd 2010 CAMBRIDGE UNIVERSITY PRESS
Other Reading
Sr No Journals articles as Compulsary reading (specific articles, complete reference)
OR-1 M. Ben-Ari, Mathematical Logic for Computer Science, Springer. ,
Relevant Websites
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 http://www.learnprolognow.org/ Prolog reference
RW-2 http://rhizomik.net/html/~roberto/thesis/html/KnowledgeRepresentation.html Knowledge representation
RW-3 http://plato.stanford.edu/entries/logical-consequence/ Logical Consequences
RW-4 http://www.rbjones.com/rbjpub/logic/ Roles of logic
RW-5 http://www.mathpath.org /proof/proof.inference.htm Natural Deduction
RW-6 http://www.powershow.com/view/242795-
NjQ5M/Horn_Clauses_flash_ppt_presentation
Horn Clauses
RW-7 http://www.cs.ubc.ca/~kevinlb/teaching/cs322%20-%202005- 6/Lectures/lect18.pdf Syntax and Semantic of logic
RW-8 http://www.emu.edu.tr/aelci/Courses/D-318/D-318-Files/plbook/logic.htm Horn clause and logic programming
RW-9 http://people.hofstra.edu/stefan_waner/realworld/logic/logic2.html Tautolgy and Contradiction
RW-10 http://people.hofstra.edu/stefan_waner/realworld/logic/logic3.html Implications
Week
Number
Lecture
Number
Broad Topic(Sub Topic) Chapters/Sections of
Text/reference
books
Other Readings,
Relevant Websites,
Audio Visual Aids,
software and Virtual
Labs
Lecture Description Learning Outcomes Pedagogical Tool
Demonstration/
Case Study /
Images /
animation / ppt
etc. Planned
Live Examples
Week 1 Lecture 1 Introduction(Union and
Intersection)
R-1:sec 1.1 OR-1 Basics of Boolean
Algebra AND
and OR
At the end of this
lecture the students
understand the basics
of
AND and OR
Discussion with
images and
animation,Peer
Learning
Introduction(Negation and
Double Negation)
R-1:sec 1.1 OR-1 NOT and Double NOT
Boolean Algebra
At the end of this
lecture the students
understand the basics
of
NOT
Discussion with
images and
animation,Peer
Learning
Check for the
equivalence of
the following
p AND (NOT q
---> NOT p) , p
AND (NOT p
---> NOT q)
Lecture 2 Introduction(Role of logic in
Computer Science)
T-1:sec 1.1 OR-1 Introduction to logic and
their types
At the end of this
lecture the student
understand the
different
types of logic and
their
usefulness to real life
Discussion with
images and
animation,Peer
Learning
Introduction(Logic
Representation)
T-1:sec 2.1 OR-1 Logic in Computer
Science
At the end of this
lecture the students
learn to
representation
of logic in computer
science
Discussion with
images and
animation,Peer
Learning
Lecture 3 Boolean Algebra and Truth
Tables(Conditional and By-
conditional Statements)
Implication and Implied
and Implied by
Students learn to use
if
then statements
Discussion with
images and
animation,Peer
Learning
Week 2 Lecture 4 Boolean Algebra and Truth
Tables(Tautology)
Statements having
complete truthness
Always true
statements
Discussion with
images and
animation,Peer
Learning
Detailed Plan For Lectures
LTP week distribution: (LTP Weeks)
Weeks before MTE 7
Weeks After MTE 7
Spill Over 3
Week 2 Lecture 4 Boolean Algebra and Truth
Tables(Contradiction)
Statements having
complete falasy
Always false
statements
Discussion with
images and
animation,Peer
Learning
Lecture 5 Boolean Algebra and Truth
Tables(Truth Tables for
basic Logic Operators)
T-1:sec 2.2 RW-7
RW-9
Introduction to truth
table representation
Usefulness of
representation of
logic
Discussion with
images and
animation,Peer
Learning
Simplify the
Following
question :
AB+BC(B+C)
Lecture 6 Boolean Algebra and Truth
Tables(Operator
Precedence)
T-1:sec 2.3 RW-9
RW-10
Introduction about
various logical operators
Symbolic
representation of
combination of
statements
Discussion with
images and
animation,Peer
Learning
Week 3 Lecture 7 Propositional Logic
Concepts(Propositional
Calculus)
T-1:sec 2.5 RW-4 Representation of
logical
statements with the help
of propositions
Symbolic
representation of
logical
statements
Discussion with
images and
animation,Peer
Learning
Lecture 8 Propositional Logic
Concepts(Syntax)
T-1:sec 2.5.1 RW-4 Discuss syntax and
semantics of
propositional logic
To be able to
understand semantic
rules in propositional
logic
Discussion with
images and
animation,Peer
Learning
Lecture 9 Propositional Logic
Concepts(Equivalence
Laws)
T-1:sec 2.3 RW-3 Relations and
Dependence rules
Logical equivalence
of
statements in
symbolic
representation
Discussion with
images and
animation,Peer
Learning
Week 4 Lecture 10 Propositional Logic
Concepts(Transforming
English Sentences to
Formulas)
T-1:sec 2.6 RW-7 Translation from english
to propositional logic
and problem solving
with
truth table
To be able to
translate
the English sentence
to
propositional logic
formulas
and be able to use the
truth table to solve
the
real world problems
Discussion with
images and
animation,Peer
Learning
Natural Deduction and
Axiomatic System in
Propositional Logic(Natural
Deduction System)
T-1:sec 3.1 RW-7 Disscus the method of
natural deduction and
the
representation ,Topic to
be covered in lecture 10
and lecture 11 to be
considered as
contingency lecture
To be able to
inference
using natural
deduction
in propositional logic
Discussion with
images and
animation,Peer
Learning
Week 4 Lecture 11 Natural Deduction and
Axiomatic System in
Propositional Logic(Natural
Deduction System)
T-1:sec 3.1 RW-7 Disscus the method of
natural deduction and
the
representation ,Topic to
be covered in lecture 10
and lecture 11 to be
considered as
contingency lecture
To be able to
inference
using natural
deduction
in propositional logic
Discussion with
images and
animation,Peer
Learning
Lecture 12 Natural Deduction and
Axiomatic System in
Propositional Logic(Proof
by Deduction)
T-1:sec 3.1.2 RW-4 Discuss the method of
natural deduction and
semantic rules and
assignment of term
paper topics
To be able to
understand the
semantic
rules of Propositional
logic and its
deduction
Discussion with
images and
animation,Peer
Learning
Week 5 Lecture 13 Quiz,Test1
Lecture 14 Natural Deduction and
Axiomatic System in
Propositional Logic(Proof
by Contradiction)
T-1:sec 3.1.4 RW-5 Natural Deduction by
proof of contradiction
To be able to
understand the
semantic
rules of Propositional
logic and its proof by
contradiction
Discussion with
images and
animation,Peer
Learning
Lecture 15 Natural Deduction and
Axiomatic System in
Propositional Logic
(Axiomatic Systems)
T-1:sec 3.2 RW-5 Axiomatic Systems in
Propositional Logic and
Rules associated with it
Learning about
formal
Axiomatic System
Discussion with
images and
animation,Peer
Learning
Week 6 Lecture 16 Natural Deduction and
Axiomatic System in
Propositional Logic
(Soundness and
Completeness Theorem)
T-1:sec 3.2.4 RW-5 Soundness and
Completeness in
Axiomatic System
Checking about the
soundness and
completeness of
statements
Discussion with
images and
animation,Peer
Learning
Lecture 17 Semantic Tableaux and
Resolution in Propositional
Logic(Semantic Tableaux)
T-1:sec 4.1 RW-5 Semantic Tableaux
Representation
Learning how to
draw
the tableaux for the
given propositional
statement
Discussion with
images and
animation,Peer
Learning
Lecture 18 Semantic Tableaux and
Resolution in Propositional
Logic(Normal Forms)
T-1:sec 4.2.1 RW-4 Conjunctive Normal
Form and Disjunctive
Normal Form
Conjunction of
Disjuncts and
Disjunction of
Conjuncts
Discussion with
images and
animation,Peer
Learning
Convert the
following into
CNF and DNF
(NOT (P OR
NOT R) OR (Q
AND R)).
Week 7 Lecture 19 Semantic Tableaux and
Resolution in Propositional
Logic(Resolution Concepts)
T-1:sec 4.2.4 RW-10 Discuss the basics of
Resolution
To be able to
understand the basics
of
Resolution
Discussion with
images and
animation,Peer
Learning
Lecture 20 Semantic Tableaux and
Resolution in Propositional
Logic(Problem Solving
using Resolution)
T-1:sec 4.2.6 RW-2 Solving problems by
resolution refutation
Problem solving by
contradiction in
propositional Logic
Discussion with
images and
animation,Peer
Learning
Week 7 Lecture 20 Semantic Tableaux and
Resolution in Propositional
Logic(Soundness and
Completeness)
T-1:4.2.5 RW-5 Soundness and
Completeness of
resolution,Topic to be
covered in lecture 20
and lecture 21 to be
considered as
contingency lecture
Learning about the
Soundness and
Completeness of
resolution
Discussion with
images and
animation,Peer
Learning
Lecture 21 Semantic Tableaux and
Resolution in Propositional
Logic(Soundness and
Completeness)
T-1:4.2.5 RW-5 Soundness and
Completeness of
resolution,Topic to be
covered in lecture 20
and lecture 21 to be
considered as
contingency lecture
Learning about the
Soundness and
Completeness of
resolution
Discussion with
images and
animation,Peer
Learning
MID-TERM
Week 8 Lecture 22 First Order Predicate Logic
(Predicate Calculus)
T-1:sec 5.1 RW-2 Introduction to Predicate
Logic
Drawback of
Propositional Logic
Discussion with
images and
animation,Peer
Learning
1.John likes all
kinds of food.
2.Apples are
food.
3.Chicken is
food.
4.Anything
anyone eats and
isnt killed
by is food.
5.Bill eats
peanuts, and is
still alive.
6.Sue eats
everything that
Bill eats.
Lecture 23 First Order Predicate Logic
(Interpretation of Formulae)
T-1:sec 5.2.1 RW-4 Predicate Representation
of Sentence
Predicate Logic
overpowers
Propositional Logic
Discussion with
images and
animation,Peer
Learning
Lecture 24 First Order Predicate Logic
(Inference Rules)
T-1:sec 5.2.2 RW-7
RW-8
Various Inference Rules
related to Predicate
Logic
Inferences in
Predicate
Logic
Discussion with
images and
animation,Peer
Learning
Week 9 Lecture 25 First Order Predicate Logic
(First Order Predicate
Calculus)
T-1:sec 5.1.2 RW-3
RW-4
Discussion about the
basics of First Order
Predicate Calculus
Conversion of
sentences into FOPL
Discussion with
images and
animation,Peer
Learning
Lecture 26 Normal Forms in Predicate
Calculus(Prenex Normal
Form)
T-1:sec 5.3 RW-7
RW-9
Conversion of FOPL
into
PNF
Syntax and semantics
of PNF
Discussion with
images and
animation,Peer
Learning
Week 9 Lecture 27 Normal Forms in Predicate
Calculus(Skolemisation)
T-1:sec 5.4 RW-9
RW-10
Discuss the methods of
Skolemization
Methods to remove
quantifiers from the
formula
Discussion with
images and
animation,Peer
Learning
Week 10 Lecture 28 Quiz,Test2
Lecture 29 Normal Forms in Predicate
Calculus(Set of Clauses)
T-1:5.4.2 RW-7
RW-10
Conversion of FOPL in
Clausal Form
Learning about
Clauses
Discussion with
images and
animation,Peer
Learning
Normal Forms in Predicate
Calculus(Algorithm for
Transforming PNF to its
Standard Form)
T-1:5.3.3 RW-3
RW-4
Algorithm for
Transforming PNF to its
Standard Form
Learning about
Conversion into
Standard Form
Discussion with
images and
animation,Peer
Learning
Lecture 30 Semantic Tableaux and
Resolution in Predicate
Calculus(Semantic
Tableaux)
T-1:6.1 RW-5 Semantic Tableaux in
Predicate Logic
Leaning Tableaux
Representation in
Predicate Logic
Discussion with
images and
animation,Peer
Learning
Show that the
following set are
consistent by
constructing the
Simplex
tableau:
(p OR NOT q)
AND (q AND
NOT r) AND (r
p).
Semantic Tableaux and
Resolution in Predicate
Calculus(Soundness and
Completeness)
T-1:6.1.1 RW-5 Soundness and
Completeness in
Predicate Logic
Learning about
Soundness and
Completeness in
Predicate Logic
Discussion with
images and
animation,Peer
Learning
Week 11 Lecture 31 Semantic Tableaux and
Resolution in Predicate
Calculus(Unification
Algorithm)
T-1:11332 sec 6.2.3 RW-8 Basics of Unification in
Predicate Calculus
Learning about
Unification in
Predicate Calculus
Discussion with
images and
animation,Peer
Learning
Lecture 32 Semantic Tableaux and
Resolution in Predicate
Calculus(Resolution in
Predicate Calculus)
T-1:sec 6.2 RW-10 Resolution in FOPL and
submission of term
paper
To be able to deduce
using Resolution
Discussion with
images and
animation,Peer
Learning
Lecture 33 Semantic Tableaux and
Resolution in Predicate
Calculus(Problem Solving
using Resolution)
T-1:6.2 RW-4 Numerical Analysis of
Resolution by
refutation,The topic to
be covered in lecture 32
and lecture 33 be
considered as
contingency lecture
To be able to
understand the
resolution refutation
problems
Discussion with
images and
animation,Peer
Learning
Week 12 Lecture 34 Logic Programming(Basic
Concepts of Logic
Programming)
T-1:sec 7.1 RW-8 Horn Clause and
Concepts of Logical
Programming
To be able to convert
the sentences into
horn
clause
Discussion with
images and
animation,Peer
Learning
Week 12 Lecture 34 Logic Programming
(Execution of Query in
Logic Programming)
T-1:sec 7.1.3 RW-6
RW-8
Horn formulas and
Queries in Logical
Programming
To be able to convert
the sentences into
horn
clause
Discussion with
images and
animation,Peer
Learning
Lecture 35 Logic Programming
(Overview on the available
Logic Programming
Languages)
T-1:sec 7.1.2 RW-4
RW-6
Conversion
of a English into logic
program ,
conversion of
clause into clausal
representation
Basics of Logical
Programming in
detail
Discussion with
images and
animation,Peer
Learning
Logic Programming(Prolog) T-1:sec 7.2 RW-1 Basics of Prolog Prolog Language Discussion with
images and
animation,Peer
Learning
Lecture 36 Quiz,Test3
Week 13 Lecture 37 Logic Programming
(Relational and Arithmetic
Operators)
T-1:sec 7.2.5 RW-1 Operations in Prolog Basic Programming
in Prolog
Discussion with
images and
animation,Peer
Learning
Lecture 38 Programming in Prolog(Key
terms in Prolog)
T-1:sec 7.2.3 RW-1 Various terminology
associated with Prolog
Prolog as Logical
Programming
Language
Discussion with
images and
animation,Peer
Learning
Programming in Prolog(Rule
Order)
T-1:sec 8.4 RW-1 Defining Rule order and
associated terms
At the end of this
lecture students get to
know the basics of
Rule
Order
Discussion with
images and
animation,Peer
Learning
Lecture 39 Programming in Prolog
(Goal Order)
T-1:sec 8.5 RW-1 Defining Goal order and
associated terms
At the end of this
lecture students get to
know the basics of
Goal
Order
Discussion with
images and
animation,Peer
Learning
Week 14 Lecture 40 Programming in Prolog
(Recursion)
T-1:sec 8.1 RW-1 Function calling itself
recursively
To know the basics
of
Recursion through
examples
Discussion with
images and
animation,Peer
Learning
WAP to show
the use of
recursion
Lecture 41 Programming in Prolog
(Lists)
T-1:sec 8.2 RW-1 List Manipulation in
Prolog
Prolog Programming
Continued
Discussion with
images and
animation,Peer
Learning
Programming in Prolog
(Iterative Programming)
T-1:sec 8.7 RW-1 Advanced Prolog
Programming,Topic to
be covered in lecture 41
and 42 to be considered
as contingency lecture
Advanced Prolog
Concepts
Discussion with
images and
animation,Peer
Learning
Week 14 Lecture 42 Programming in Prolog
(Iterative Programming)
T-1:sec 8.7 RW-1 Advanced Prolog
Programming,Topic to
be covered in lecture 41
and 42 to be considered
as contingency lecture
Advanced Prolog
Concepts
Discussion with
images and
animation,Peer
Learning
SPILL OVER
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over
Scheme for CA:
Component Frequency Out Of Each Marks Total Marks
Quiz,Test 2 3 10 20
Total :- 10 20
Details of Academic Task(s)
AT No. Objective Topic of the Academic Task Nature of Academic Task
(group/individuals/field
work
Evaluation Mode Allottment /
submission Week
Test1 To test the
performance and
understanding of the
students about the
subject
The test should consist of syllabus from lecture 1 to lecture 13. Individual Based upon clarity
and correctness of
solutions.
4 / 5
Quiz1 To test the basic
grasp of the students
in Logic.
The MCQ to be conducted based on the syllabus. Individual In a quiz (MCQ
based Test) the
questions must be
so framed that
student is not able
to answer through
sheer guess work.
Each question must
require some sought
of analysis. The
time limit sho
11 / 12
Test2 To test the
performance and
understanding of the
students about the
subject
The test should consist of syllabus from lecture 14 to lecture 27. Individual Based upon clarity
and correctness of
solutions.
10 / 11
List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)
Sr. No. Topic
1 Reasoning exercise using predicate logic
2 Expert System design using prolog
3 Software specification using logic
4 Reasoning exercise using propositional logic
5 Design and analysis of electronic circuits using logic
6 Software verification using logic
7 Symbolic manipulations of algebraic expression
8 Do a natural deduction proof for a simpler version of the wise-men problem: There are two wise men; as usual, they can see each other's hats but not their own. It is
common knowledge that there's only one white hat available and two red ones. So at least one of the men is wearing a red one. Man 1 informs the second that he doesn't
know which hat he is wearing. Man 2 says, "Aha, then I must be wearing a red hat."
9 Develop an application in prolog to solve 8-queen problem to find all ways of arranging 8 queens on a standard chess board such that no queen is in a position to take
any of the others. Your program should find all 92 solutions and display each using character based graphics.
10 This exercise is about the wise-men puzzle. Justify your answers.(a) Each man is asked the question "Do you know the colour of your hat?"Suppose that the first man
says "no" but the second one says "yes." Given this information together with the common knowledge, can we infer the colour of his hat? (b) Can we predict whether
the third man will now answer "yes" or "no" ?(c) What would be the situation if the third man were blind? What about the first man?
11 People have symptoms and diseases, and diseases are associated with symptoms. Analyze an expert system to determine any person has flue or not
12 Tower of Hanoi problem analysis using Prolog
13 Analyzing rule base and knowledge base for "Television Fault Diagnosis system" to develop and expert system
14 Analyzing rule base and knowledge base for "Heart disease advisor " to develop an expert system
15 Analyze a simple expert system to identify 1 rupee, 2 rupee and 5 rupee Indian coins