Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Winter 2012 Duration: Semester.

Slides:



Advertisements
Similar presentations
Introduction To VHDL for Combinational Logic
Advertisements

UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
Propositional and First Order Reasoning. Terminology Propositional variable: boolean variable (p) Literal: propositional variable or its negation p 
Models and Propositional Logic In propositional logic, a model in general simply fixes the truth value – true or false – for every proposition symbol.
Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
1 Boolean Satisfiability in Electronic Design Automation (EDA ) By Kunal P. Ganeshpure.
1 Polynomial Time Reductions Polynomial Computable function : For any computes in polynomial time.
NP-Complete Problems Problems in Computer Science are classified into
1 Discrete Structures CS 280 Example application of probability: MAX 3-SAT.
SAT Algorithms in EDA Applications Mukul R. Prasad Dept. of Electrical Engineering & Computer Sciences University of California-Berkeley EE219B Seminar.
GRASP: A Search Algorithm for Propositional Satisfiability EE878C Homework #2 2002/11/1 KAIST, EECS ICS Lab Lee, Dongsoo.
Application of Formal Verification Methods to the analysis of Bearings-only Ballistic Missile Interception Algorithms Eli Bendersky Michael Butvinnik Supervisor:
SAT Solver Math Foundations of Computer Science. 2 Boolean Expressions  A Boolean expression is a Boolean function  Any Boolean function can be written.
Boolean Satisfiability and SAT Solvers
Large-scale Hybrid Parallel SAT Solving Nishant Totla, Aditya Devarakonda, Sanjit Seshia.
10/9/2015COSC , Lecture 51 Real-Time Systems, COSC , Lecture 5 Stefan Andrei.
MBSat Satisfiability Program and Heuristics Brief Overview VLSI Testing B Marc Boulé April 2001 McGill University Electrical and Computer Engineering.
Digitaalsüsteemide verifitseerimise kursus1 Formal verification: SAT SAT applied in equivalence checking.
NP Complexity By Mussie Araya. What is NP Complexity? Formal Definition: NP is the set of decision problems solvable in polynomial time by a non- deterministic.
HW #1. Due Mar 22 Midnight Verify the following program using SAT solver 1. Translate the program into a SSA form 2. Create a Boolean formula from.
FPGA PLB Evaluation using Quantified Boolean Satisfiability Andrew C. Ling M.A.Sc. Candidate University of Toronto Deshanand P. Singh Ph.D. Altera Corporation.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module Logic Representations.
HW #2. Due Mar 27 23:59 Do NOT forget to submit both a hardcopy solution to the HW box and a softcopy solution to TA (Youngjoo Kim):
NP-Complete Problems. Running Time v.s. Input Size Concern with problems whose complexity may be described by exponential functions. Tractable problems.
Tommy Messelis * Stefaan Haspeslagh Patrick De Causmaecker *
Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub- Model Gábor Kusper Eszterházy Károly.
Planning as Satisfiability (SAT-Plan). SAT-Plan Translate the planning problem into a satisfiability problem for length n of Plan garb 0 (proposition)present.
Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Spring 2012 Duration: Semester.
Optimality FPGA Technology Mapping: A Study of Optimality Andrew C. Ling M.A.Sc. Candidate University of Toronto Deshanand P. Singh Ph.D. Altera Corporation.
Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Spring 2012 Duration: Semester.
28.
Solving the Logic Satisfiability problem Solving the Logic Satisfiability problem Jesus De Loera.
CSE 6311 – Spring 2009 ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS Lecture Notes – Feb. 3, 2009 Instructor: Dr. Gautam Das notes by Walter Wilson.
Satisfiability and SAT Solvers CS 270 Math Foundations of CS Jeremy Johnson.
Custom Computing Machines for the Set Covering Problem Paper Written By: Christian Plessl and Marco Platzner Swiss Federal Institute of Technology, 2002.
SAT Solving As implemented in - DPLL solvers: GRASP, Chaff and
1 Boolean Satisfiability (SAT) Class Presentation By Girish Paladugu.
Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Winter 2012 Duration: Semester.
Honors Track: Competitive Programming & Problem Solving 2-Satisfiability José Kuiper.
Knowledge Repn. & Reasoning Lecture #9: Propositional Logic UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2005.
Computability Examples. Reducibility. NP completeness. Homework: Find other examples of NP complete problems.
Decision Procedures in First Order Logic
NP-Completeness A problem is NP-complete if: It is in NP
NP-Completeness (2) NP-Completeness Graphs 4/13/2018 5:22 AM x x x x x
Chapter 10 NP-Complete Problems.
Hardware Acceleration of A Boolean Satisfiability Solver
Michael Codish, Michael Frank, Amit Metodi
Inference and search for the propositional satisfiability problem
Introduction to MiniSAT
Richard Anderson Lecture 26 NP-Completeness
Dr. Rachel Ben-Eliyahu – Zohary
NP-Completeness (2) NP-Completeness Graphs 7/23/ :02 PM x x x x
NP-Completeness (2) NP-Completeness Graphs 7/23/ :02 PM x x x x
NP-Completeness Proofs
Richard Anderson Lecture 26 NP-Completeness
Hard Problems Introduction to NP
NP-Completeness (36.4-5) P: yes and no in pt NP: yes in pt NPH  NPC
Watermarking of SAT Using Combinatorial Isolation Lemmas
NP-Completeness (2) NP-Completeness Graphs 11/23/2018 2:12 PM x x x x
NP-Completeness Proofs
Introduction to the Boolean Satisfiability Problem
ECE 667 Synthesis and Verification of Digital Circuits
Introduction to the Boolean Satisfiability Problem
Introduction to MiniSAT
PROPOSITIONAL LOGIC - SYNTAX-
HW #2. Due Apr 25 23:59 Do NOT forget to submit both a hardcopy solution to the HW box and a softcopy solution to TA.
NP-Completeness (2) NP-Completeness Graphs 7/9/2019 6:12 AM x x x x x
The Satisfiability Problem
Presentation transcript:

Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Winter 2012 Duration: Semester

 Boolean Satisfiability Problem  Given a Boolean propositional formula, does there exist assignment of values such that the formula becomes true?  e.g., given the formula f=(x1 ˅ x2 ˅ -x4) ˄ (x4) ˄ (x2 ˅ -x3) are there values of x1,x2,x3,x4 that produce f=‘1’

 Conjunctive Normal Form  In Boolean Logic, a formula is in CNF if it presented as a conjunction of clauses.  e.g., DIMACS CNF format: c Example CNF format file c p cnf

 Hardware based SAT Solver  Implementing DIMACS cnf instances into FPGA

Embedding SAT instances into FPGA (implementation) Measuring build and run times for benchmark examples Implementation Time as function of SAT complexity graph Enabling further development of fast hardware based SAT Solver

c Example CNF format file c p cnf Example.cnf entity SAT is port( x1,x2,x3,x4: in std_logic; F: out std_logic ); end OR_ent; architecture SAT_arc of SAT is begin F <= (x1 or x3 or (not x4) and (x4) and (x2 or (not x3)); end SAT_arc; Example.vhdl

Eclipse for C/C++ Converting Altera Quartus Implementing Modelsim Altera Quartus Simulating, Testing, and Debugging

 LUT Logic Elements  LUT is a function generator that can implement any function of four variables.  Each clause will be implemented on one LUT therefor we 4000 clauses occupy 8000 LUTs (=LEs)  Random Generator (32 Bit output)  Seed * Constant + Constant  Each variable will receive a random bit, therefor 500 variables 64 x 16 = 1024 LUTs (=LEs)

Altera DE2 Altera Cyclone® II 2C35 FPGA deviceAltera Cyclone® II 2C35 FPGA device USB Blaster (on board) for programming and user API control; both JTAG and Active Serial (AS) programming modes are supportedUSB Blaster (on board) for programming and user API control; both JTAG and Active Serial (AS) programming modes are supported Altera Cyclone® II 33,216 LEs33,216 LEs 105 M4K RAM blocks105 M4K RAM blocks 483,840 total RAM bits483,840 total RAM bits 4 PLLs4 PLLs

Conversion Synthesis DeviceProgrammer Running SAT Solver