0% found this document useful (0 votes)
97 views3 pages

CS F214 Logic in Computer Science 1st Sem 2021-22

This document provides details about the Logic in Computer Science course offered in the first semester of 2021-2022 at BITS Pilani Dubai Campus. The course covers topics in propositional logic, predicate logic, verification approaches like model checking and temporal logic, program verification using Hoare logic, and modal and logic programming. It will be taught over 42 lectures and evaluated through tests, quizzes, assignments, and a comprehensive exam. Students are expected to regularly attend lectures and consultations to be eligible to appear for exams.

Uploaded by

Urvi Modi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
97 views3 pages

CS F214 Logic in Computer Science 1st Sem 2021-22

This document provides details about the Logic in Computer Science course offered in the first semester of 2021-2022 at BITS Pilani Dubai Campus. The course covers topics in propositional logic, predicate logic, verification approaches like model checking and temporal logic, program verification using Hoare logic, and modal and logic programming. It will be taught over 42 lectures and evaluated through tests, quizzes, assignments, and a comprehensive exam. Students are expected to regularly attend lectures and consultations to be eligible to appear for exams.

Uploaded by

Urvi Modi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

BITS PILANI, DUBAI CAMPUS

ACADEMIC – UNDERGRADUATE STUDIES DIVISION


FIRST SEMESTER 2021 – 2022
Course Handout (Part – II)
Date: 05.09.2021
In addition to Part I (General Handout for all courses appended to the Time Table) this portion further
specific details regarding the course.

Course No. : CS F214 (3 0 3)


Course Title : Logic in Computer Science
Course Instructor(s) : Rahul C S and Dr. Siddhaling Urolagin
Instructor-in-charge : Rahul C S

Scope and Objective of the Course:


Logic plays a fundamental role in computer science. The objective of the course is to present the
fundamental basic notions of logic that are important in computer science. The course covers topics in
propositional logic – syntax, semantics, satisfiability & validity, predicate or first order logic – syntax,
semantics, satisfiability & validity, completeness & compactness, Undecidability & incompleteness. The
course also deals with verification by model checking, linear-time temporal logic (LTL), & computational
tree logic (CTL). Program verification using Hoare logic & proofs of correctness. Modal logic & logic
programming are also introduced.

Course Pre/Co- requisite (if any) & Catalogue / Bulletin Description:


Given in the Catalogue 2021– 2022

Text book [TB]:


Michael Huth and Mark Ryan, Logic in Computer Science, 2e, Cambridge University Press, 2004.
Reference book(s) [RB]:
RB1: Johan van Benthem, Hans van Ditmarsch, Jan van Eijck, Jan Jaspars, Logic in action, 1e,
HAL-Inria, 2016.
RB2: Ben-Ari, Mordechai, Mathematical Logic for Computer Science, 3e, Springer, 2012.

Course Plan / Schedule:


Lec.# Learning objectives Topics to be covered Chapter No
To introduce the concepts of logic  Course overview
1-2 and to understand its role in  Introduction to logic Class Notes,
computer science  Introduction to propositional & RB1: Ch 1
predicate logic
To understand propositional logic  Declarative sentences
3-11 & its syntax & semantics  Deductive systems TB: Ch 1
 Propositional logic as a formal RB2: Ch 2-4
language
 Semantics
 Normal forms
To understand the need for a  Limitations of propositional logic
12-20 richer logic – predicate logic  Predicate logic as a formal TB: Ch 2
language RB2: Ch 5-7
 Proof theory
 Semantics
 Satisfiability & validity
 Completeness & compactness
 Undecidability &
incompleteness
 Godel’s Incompleteness
theorem
To understand the importance of  Need for verification
21-29 verification and the various  Approaches to verification TB: Ch 3
approaches to verification  Verification by model checking
 Temporal Logic
 LTL
 Limitations of LTL
 CTL & CTL*
To understand the need for  Overview of program
30-34 verification and the various verification TB: Ch 4
approaches to program verification  Framework for software
verification
 Hoare logic
 Proofs of correctness
To understand the role of modal  History of modal logic
35-39 logic in computer science  Syntax & semantics TB: Ch 5
 Kripke's Formulation of Modal
Logic
 Logic engineering
 Knowledge in multi-agent
systems
To understand the usage of logical  Evaluation of assertions as a
40-42 concepts in game design logical game RB1: Ch7
 Zermelo’s theorem and winning Additional
strategies Materials
 Sabotage Games: From Simple
Actions to Games
 Model Comparison as a Logic
Game
* The lectures may slightly diverge from aforesaid plan based on students ‘background & interest in the topic, which
may perhaps include special lectures and discussions that would be planned and schedule notified accordingly

Course Schedule: Lecture(Section 1):Su1 M6 T5 (257), Lec.(Sec. 2): Su1 M6 T5 (334),


Lec.(Sec. 3): Su7 W5 Th2 (334), Tutorial(Sec.1): W8 (257) Tut.(Sec. 2): W8 (336), Tut.(Sec. 3): W1 (257)

valuation scheme:
EC Evaluation Nature of Duration Weightage(%) Date & Time Venue
No Components Component
1 Test - 1 Closed book 50 minutes 20 04.10.21 M2
2 Quiz I Closed book 20 minutes 10 27.10.21 W8
3 Test – 2 Open book 50 minutes 20 08.11.21 M2 TBA
4 Assignment(s) Open book Continuous 10 TBA
5 Compre-Exam Closed book 3 hours 40 27.12.21 FN
*Open book - Only prescribed text book(s) and hand written notes are permitted
**Tutorial sheets will be distributed in tutorial classes. This will help you to enhance your  abilities in
problem solving. Assistance will be given in solving them during the classes. No make-up will be provided
for tutorials.
Assignments will be intimated through a separate notification or announced in the class and the deadlines
would be indicated therein. It is necessary that all students stick to time schedule and do not postpone
submission of assignment. This will prevent extra load during last two weeks of class work. No make-ups
would be allowed for submission of assignment.

Mid-sem Grading:
Mid-sem grading will be displayed after two evaluation components or earlier whenever about 30% of
evaluation components are completed.
Note: A student will be likely to get “NC”, if he / she
 Doesn’t appear / appear for the sake of appearing, for the evaluation components / scoring zero in
pre-compre total.

Makeup and Attendance policies:


Makeups are not given as a routine. It is solely dependent upon the genuineness of the circumstances
under which a student fails to appear in a scheduled evaluation component. In such circumstances, prior
permission should be obtained from the Instructor-in-Charge (I/C).The decision of the I/C in the above
matter will be final. No make-up will be on offer for Quiz-I.
Attendance: Every student is expected to be responsible for regularity of his/her attendance in class
rooms and laboratories, to appear in scheduled tests and examinations and fulfill all other tasks assigned
to him/her in every course. A student should have a minimum of 60% of attendance in a course to be
eligible to appear for the Comprehensive Examination in that course. For the students under the purview of
Academic Counseling Board (ACB), the Board shall prescribe the minimum attendance requirement on a
case-to-case basis. Attendance in the course will be a deciding factor in judging the seriousness of a
student which may be directly / indirectly related to grading.

General timings for consultation:


Each instructor will specify his / her chamber consultation hours during which the student can contact him /
her in his / her chamber for consultation. For Rahul CS, this would be on Monday 13:00 – 13:50 (offline)
and Tuesday 15:40 – 16:30 (online), once a week and for Dr. Siddhaling, Tuesday 13:55 – 14:45 (offline)
and Wednesday 15:45 – 16:35 (online). We prefer you to take prior appointments whenever possible.

General instructions:
Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the
Course Faculty to the class.

Notices:
All notices/announcements concerning the course will be displayed on the respective notice Boards and/or
google classroom.

Instructor – In- Charge


CS F214

Instructors’ Contact Details:

Rahul CS, Chamber No: 232 Contact No: +971-4-2753700x322


email: [email protected]

Dr. Siddhaling Urolagin, Chamber No: 179 Contact No: +971-4-2753700x424


email: [email protected]

You might also like