Algorithms in Logic - 096265
|
|
|
|
|
| |
Lecture |
Exercise |
Laboratory |
Project or
Seminar |
House
Work |
Weekly
Hours |
2 |
|
|
2 |
4 |
|
Determination of the grade according to progress during the semester and the submission of the final thesis
|
Prerequisites
| | | | Intro. to Computability and Complexity |
097447
| |
The Course Covers Modeling of Decision Problems in Various Logic, and Algorithms (Called "Decision Procedures") for Solving Them. the Problems Include Classic Np Problems and Various Challenges Arising in the Formal Verification of Programs. Among Other Things, the Course Covers Algorithms for Solving the Satisfiability Problem of Propositional Formulas (Sat) and of Linear Systems. the Course Begins with Propositional Logic and First-Order Logic.
Timetable to semester 01/2022
2022/2023 Winter Semester
| Room | Building | Hour | day | Lecturer | Exercise
Lecture | no. | Registering
Group |
|---|
| 152 | áìåîôéìã | 12:30-14:30 | Monday | Prof. Strichman Ofer | Lecture | 10 | 10 |
| | | | | | Project | 10 |
Textbooks| Published | Publisher | Authors | Book |
|---|
| 2008 | springer | d. kroening and o. strichman | decision procedures - an algorithmic point of view |
| 2008 | springer | a. bradley and z. manna | the calculus of computation |
Created in 02/12/2022 Time 15:22:01
