(Established under the Presidency University Act, 2013 of the Karnataka Act 41 of 2013)

Automated Reasoning and Verification - COURSE HANDOUT

SCHOOL: SOE DEPT.: CSE DATE OF ISSUE: 24/09/2019

NAME OF THE PROGRAM: M. Tech.

P.R.C. APPROVAL REF.: PU/AC-11/9/06_2019

SEMESTER/YEAR: I Semester / 1st Year

COURSE TITLE & CODE: Automated Reasoning and Verification, CSE 371

COURSE CREDIT STRUCTURE: 4-0-0-4

CONTACT HOURS: 4 Hours/week

COURSE INSTRUCTOR: Dr. S C Kulhari

PROGRAM OUTCOMES:
The main outcomes of the CSE (M.Tech.) program are given here. At the end of the program a student
is expected to have:
1. An understanding of the theoretical foundations and the limits of computing.
2. An ability to adapt existing models, techniques, algorithms, data structures, etc. for efficiently
solving problems.
3. An ability to design, develop and evaluate new computer based systems for novel applications
which meet the desired needs of industry and society.
4. Understanding and ability to use advanced computing techniques and tools.
5. An ability to undertake original research at the cutting edge of computer science & its related
areas.
6. An ability to function effectively individually or as a part of a team to accomplish a stated goal.
7. An understanding of professional and ethical responsibility.
8. An ability to communicate effectively with a wide range of audience.
9. An ability to learn independently and engage in life¬long learning.
10. An understanding of the impact of IT related solutions in an economic, social and environment
context

Program Specific Outcomes

Upon completion of the M.Tech in AI programme, students shall be able to:
PSO 1: recognize and analyze problems related to AI and ML applications along with their ethical
implications.
 PSO 2: apply pattern recognition, machine learning, and artificial intelligent techniques including
statistical data analysis and quantitative modeling techniques to solve real world problems from
various domains such as healthcare, social computing, economics, etc.
PSO 3: utilize cutting edge tools and software in AI and ML.
PSO 4: build novel algorithms or modify/improve existing approaches in AI and ML.
PSO 5: demonstrate knowledge by communicate findings and effectively present results.
PSO 6: understand latest development and progress in AI and ML areas
Learning Objectives
1. To understand and apply principles of Artificial Intelligence and Machine Learning.
2. To develop a work product which can step up to the challenges of the future age of artificial
intelligence.
3. To Learn and develop the solutions for Large Scale problems.
4. To develop an expert system for various industry ready applications with help of Machine
Learning Algorithms.
5. To learn to take decision under uncertainties.

COURSE PREREQUISITES: Discrete Mathematics

COURSE DESCRIPTION:

Discrete Mathematics must be a core subject in computer Science as per ACM and IEEE. In contrast to
calculus (for all engineering Courses), Discrete Mathematics is the back bone for Computer Science.

Topics include: Prepositional logic, Predicate logic, Sets, functions, sequences and sums, Basic and
Advance counting techniques, Induction and Recursion, Fundamental Algorithms, the integers, Matrices
and Relations

COURSE OUTCOMES: On successful completion of the course the students shall be able to:

CO1 : Describe a logic sentence in terms of predicates, quantifiers, and logical connectives

CO2 : Understand the basic principles of sets, operations on sets and the principle of inclusion-exclusion.

CO3 : Apply basic counting techniques to combinatorial problem.

CO4 : Define relations and their properties with applications.

CO5 : Explain the concepts of Lattices and algebraic structures in Boolean Algebra
MAPPING OF C.O. WITH P.O.:

CO PO 1 PO2 PO 4
NO.
CO1 H M M
CO2 H M
CO3 H H M
CO4 H M M
CO5 H H L
COURSE CONTENT:

Module: 1: Foundations of Logics and Proofs [10-Hrs] [ L-2 COMPREHENSION]

Propositional Logic, Propositional Logic Equivalences, Inference rules, Normal forms, FOPL, Conversion to
clausal form, Resolution by Refutation.

Module: 2: Basic Structures: Sets, Functions, Sequences and Induction [6 Hrs] [L-2 COMPREHENSION]

Sets and set-operations, Functions, Sequence & Series, Number Theory, Mathematical Induction,

Module: 3: Advanced Counting Techniques [9-Hrs] [L-2 COMPREHENSION]

Basics of counting, Pigeonhole Principle, Permutations & Combinations, Binomial & multinomial
Theorems (only statement), Generalized Permutations and Combinations, Recurrence Relations and
solving linear recurrence relations (homogenous & Non-Homogenous), Generating functions and solving
recurrence relations, Principle of Inclusion and Exclusion

Module: 4: Relations and their Properties [5– Hrs] [L-2 COMPREHENSION]

Relations and their properties & representations, various closures of relations and their applications.

Module: 5: Posets, Lattices and Boolean Algebra [8 Hrs] [L-2 COMPREHENSION]

Partial ordering, Poset, Lattices & Algebraic structures, Basic properties of algebraic systems by lattices,
Distributive lattices, complement of an element in a lattice, Boolean lattice & Boolean algebra,
Demorgan’s Law.

DELIVERY PROCEDURE (PEDAGOGY): Chalk and Talk

Self Learning Topics: Fermat’s Theorm, Well Ordering Principle, Vander monde’s Identity, Applications of
Inclusion and Exclusion, Modular lattice and its properties.

Rest of the topics will be covered through Technology Enabled Learning mode (PPTs, Videos)

REFERENCE MATERIALS: Textbooks, reference books, Class Notes, any other resources like webpages.

(a) Text book

T1. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, McGrawHill, 7th Edition,2011.

(b) Reference book(s):

R1. Susanna EPP, “Discrete Mathematics with Applications”, Cengage Learning, 4th Edition, 2010
R2. Thomas Koshy, “Discrete Mathematics with Applications”, Elsevier, India, 2009.
R3. Discrete mathematics for Computer Scientists and Mathematicians, Paperback (Rs. 533)
Joel Mott, Abraham Kandel, Theodore Baker; Pearson Education India; 2 edition (2015), ISBN-13: 978-
9332550490
 GUIDELINES TO STUDENTS:

1. Be regular to the classes.

2. More practice on problems discussed in the class and assignments given.
3. There will be certain classes for which calculators will be required, hence students may need a
scientific calculator for some classes. The objective of the tutorial is to solve / understand /
relate real-time engineering problems with mathematical concepts
4. Refer the materials given by the instructor
5. Chamber consultation hour will be announced in the class.
6. All notices concerning the course will be displayed on Department and Class Notice Boards only.

COURSE SCHEDULE:

Sl. No. ACTIVITY STARTING CONCLUDING TOTAL NUMBER OF

DATE DATE PERIODS
01 Over View of the course 07-08-2019 07-08-2019 1
02 Module : 01 13-08-2019 06-09-2019 10 + 4
02 Module: 02 09-09-2019 23-09-2019 06 + 3
03 Assignment 07-09-2019 14-09-2019
04 Test-1 27-09-2019 30-09-2019
05 Module:03 24-09-2019 25-10-2019 9+4
06 Module:04 28-10-2019 08-11-2019 5+1
07 Quiz 02-11-2019 09-11-2019
08 Test- 2 16-11-2019 19-11-2019
09 Module:05 11-11-2019 26-11-2019 8+2

SCHEDULE OF INSTRUCTION:

Sl. Session Lesson Title Topics Course Delivery Reference

no no / date Outcome Mode
Number
1, 2 Module 1 : Propositional Logic CO1 Chalk & Ch:1 of
Foundations of Talk Rosen
1 Logics and Proofs
2 3 Propositional Logic Equivalences
3 4, 5 Inference rules
4 6, 7 Normal forms
5 8 FOPL
6 9 Conversion to clausal form
7 10 Resolution by Refutation
8 Self-Learning Topic Fermat’s Theorm
End of Module 1
9 11 Module 2 : Basic Sets and set-operations CO2 Chalk & Ch: 2,4,5
Structures: Sets, Talk of Rosen
Functions,
 Sequences and
Induction
10 12, 13 Functions,
11 14 Sequence & Series
12 15 Number Theory
13 16 Mathematical Induction
14 Self-Learning Topic Well Ordering Principle
End of Module 2
15 17, 18 Module 3 : Basics of counting, Pigeonhole CO3 Chalk & Ch:6, 8 of
Advanced Counting Principle Talk Rosen
Techniques
16 19, 20 Permutations & Combinations
17 21 Binomial & multinomial
Theorems (only statement)
18 22 Generalized Permutations and
Combinations
19 23, 24 Recurrence Relations and solving
linear recurrence relations
(homogenous & Non-
Homogenous)
20 25 Generating functions and solving
recurrence relations,
21 25 Principle of Inclusion and
Exclusion
22 Self-Learning Topic Vander monde’s Identity
End of Module 3
23 26, 27, Module 4 : Relations and their properties & CO4 Chalk & Ch:8 of
28 Relations and their representations, Talk Rosen
Properties
24 29, 30 various closures of relations &
their applications
25 Self-Learning Topic Applications of Inclusion and
Exclusion
End of Module 4
26 Module 5 : Posets, Partial ordering CO5 Chalk & Ch:9,12 of
Lattices and Talk Rosen
Boolean Algebra
27 31 Posets
28 32, 33 Lattices & Algebraic structures
29 33 Basic properties of algebraic
systems by lattices
30 34 Distributive lattices
31 35 complement of an element in a
lattice
32 36, 37 Boolean lattice & Boolean
algebra
33 38 Demorgan’s Law
34 Self-Learning Topic Modular lattice and its
properties
End of Module 5

ASSESSMENT SCHEDULE:

Sl.no Assessment contents Course Duration marks weightage Venue,

type[Include here outcome In Hours DATE
assessment Number &TIME
method for self-
learning
component also]
1 Test 1 Module 1 & 2 CO1, CO2 60 Mins 40 20%
2 Test 2 Module 3 & 4 CO3, CO4 60 MIns 40 20%
3 Term End Exam All the modules CO1, 2, 3, 180 80 40%
4, 5 Mins
4 Assignment Module 1, 2, 3 CO1, 2, 3 20 10%
5 Quiz Module 4 & 5 CO4, 5 15 Mins 20 10%
6

COURSE CLEARANCE CRITERIA:

1. Course clearance criteria: Minimum 75% attendance is compulsory to appear for Test1, Test2
and Final exam. Those falling below will be awarded an NP grade.
2. Minimum 30% marks is needed in Final exam to pass the course, even if you have more than 40% in
prior components.NE grade will be given to those who fails to maintain minimum 40% in Total.
3. Make-up Policy: Make-up will be granted for genuine reasons, only when prior permission is
obtained from the Instructor-in- charge, approved by the Dean SoE.

CONTACT TIMINGS IN THE CHAMBER FOR ANY DISCUSSIONS:

Will be announced in class by respective teachers.

SAMPLE THOUGHT PROVOKING QUESTIONS:

QUESTION MARKS COURSE BLOOM’S

SL OUTCOME NO. LEVEL
NO
1 In a remote village, there exists two types of 5 CO1 L2
people

 Truth tellers who will always tell the truth

 Liars who will always lie
One day, a stranger visited the village. He met
two of the inhabitants, Jack and Emily. The
stranger asked them: "Is anyone of you a liar?".
Jack replied: "At least one of us is a liar."
 What are Jack and Emily? Truth tellers or liars?

2. A certain school has three performing arts 5 CO2 L2

extracurricular activities: Band, Chorus, or
Drama. Students must participate in at least
one, and may participate in two or even in all
three. There are 120 students in the
school. There are 70 students in Band, 73 in the
Chorus, and 45 in the Drama. Furthermore, 37
students are in both the Band and Chorus, 20
are in both the Band and the Drama, and 8
students are in all three groups. Twenty-five
students are just in the chorus, not in anything
else. How many students participate in only the
drama?
3. 12 people at a party shake hands once with 5 CO3 L2
everyone else in the room. How many
handshakes took place?
4. Are any relations in a family an Equivalence 5 CO4 L2
relation?

Target set for Course Outcome attainment:

Sl.no CO Course Outcomes Target set for
No. attainment in
percentage
01 CO1 Describe a logic sentence in terms of predicates, quantifiers, 45%
and logical connectives
02 CO2 Understand the basic principles of sets, operations on sets 45%
and the principle of inclusion-exclusion.
03 CO3 Apply basic counting techniques to combinatorial problem. 45%
04 CO4 Define relations and their properties with applications. 45%
05 CO5 Explain the concepts of Lattices and algebraic structures in 45%
Boolean Algebra

Signature of the course Instructor

This course has been duly verified Approved by the D.A.C.

Signature of the Chairperson D.A.C.

Course Completion Remarks & Self-Assessment.[This has to be filled after the completion of
the course]

[Please mention about the course coverage details w.r.t. the schedule prepared and
implemented. Any specific suggestions to incorporate in the course content. Any Innovative
practices followed and its experience. Any specific suggestions from the students about the
content, Delivery, Evaluation etc.]
Sl.no. Activity Scheduled Completion Actual Completion Remarks
As listed in the course Date Date
Schedule

Any specific suggestion/Observations on content/coverage/pedagogical methods used etc.:

Course Outcome Attainment:
Sl.no C.O. Course Outcomes Target set for Actual C.O. Remarks on
No. attainment in Attainment attainment
percentage In Percentage &Measures to
enhance the
attainment
01 Co1
02 Co2
03
04
05
06

Name and signature of the Faculty member:

D.A.C. observation and approval:

 BLOOM'S TAXONOMY

Learning Outcomes Verbs at Each Bloom Taxonomy Level to be used for writing the course
Outcomes.

Cognitive Level Illustrative Verbs Definitions

arrange, define, describe, duplicate, identify,
label, list, match, memorize, name, order, remembering previously learned
Knowledge
outline, recognize, relate, recall, repeat, information
reproduce, select, state
classify, convert, defend, discuss, distinguish,
estimate, explain, express, extend, generalize,
grasping the meaning of
Comprehension give example(s), identify, indicate, infer, locate,
information
paraphrase, predict, recognize, rewrite, report,
restate, review, select, summarize, translate
apply, change, choose, compute, demonstrate,
discover, dramatize, employ, illustrate,
applying knowledge to
Application interpret, manipulate, modify, operate, actual situations
practice, predict, prepare, produce, relate
schedule, show, sketch, solve, use write
analyze, appraise, breakdown, calculate,
categorize, classify, compare, contrast, criticize,
derive, diagram, differentiate, discriminate, breaking down objects or ideas
Analysis distinguish, examine, experiment, identify, into simpler parts and seeing how
illustrate, infer, interpret, model, outline, point the parts relate and are organized
out, question, relate, select, separate,
subdivide, test
arrange, assemble, categorize, collect, combine,
comply, compose, construct, create, design,
develop, devise, explain, formulate, generate, rearranging component ideas into
Synthesis
plan, prepare, propose, rearrange, reconstruct, a new whole
relate, reorganize, revise, rewrite, set up,
summarize, synthesize, tell, write
appraise, argue, assess, attach, choose,
compare, conclude, contrast, defend, describe, making judgments based on
Evaluation discriminate, estimate, evaluate, explain, judge, internal evidence or external
justify, interpret, relate, predict, rate, select, criteria
summarize, support, value