Logic synthesis using SAT-solvers

Add to your list(s) Download to your calendar using vCal

• Sina Boroumand (Imperial College)
• Wednesday 10 October 2018, 16:30-17:30
• Level 9 Seminar Room, EEE Dept.

If you have a question about this talk, please contact George A Constantinides.

A Boolean SATisfiability is a problem in which determines if there exists an assignment to the variables of a boolean formula such that the formula evaluates to true, otherwise proves that to be UNSA Tisfiable. Modern SAT -solvers can be used to solve a variety of practical and important problems. In this talk, I will give a brief introduction of SAT -solvers and their extensions, and I will show how to use them to design logical circuits.

This talk is part of the CAS Talks series.

This talk is included in these lists:

• Andrea Picciau's list
• CAS Talks
• Circuits and Systems Group: Internal Seminars
• Level 9 Seminar Room, EEE Dept

Note that ex-directory lists are not shown.