Institute for Integrated and Intelligent Systems (IIIS) and School of Information and Communication Technology (ICT)

The Satisfiability problem (SAT) for the propositional logic is an important problem in computer science, and SAT solving has been studied by many researchers for about half a century. In this talk, I shall give an overview of our work on satisfiability checking for the first-order predicate logic and propositional modal logics. I shall also discuss some applications such as problem solving in combinatorics and software test data generation. Finally I mention our recent work on computing the volume or density of the solution space for a set of constraints. Bio: Jian Zhang got his Ph.D. from Chinese Academy of Sciences in 1994. He is currently an assistant director and research professor of the Institute of Software, Chinese Academy of Sciences (ISCAS). His research interests include automated reasoning, program analysis and software testing. He has been a PC member for more than 30 conferences, including APLAS, COMPSAC, ICFEM, ICSE, QSIC, SAT, VSTTE. For more details, see his homepage: http://lcs.ios.ac.cn/~zj/