Seminar by Moshe Vardi University

After listening to the feeling:

English is not easy to understand, combined to see PPT, probably understand his work. The profound influence is that he introduced the research problems of the historical development, related work, and then introduced his work, this research method of rigor and rationality is worthy of reference. This paper introduces the history of logic development, the challenges encountered and the combination with the current research hotspots: satisfying problems (SAT), machine learning, deep learning, etc. are closely related.

"Logic for precise meaning"

"Don ' t be scare of worst-case complexity"---this phrase is very enlightening, not because of the worst situation and give up efforts.

Here is the report information:

Title:the automated-reasoning Revolution:from theory to practice and back
Speaker:moshe Vardi (Rice University, USA)
time:09:00, March 2nd, 2016
Venue:seminar (334), Level 3, Building 5, Institute of software,
Chinese Academy of Sciences.

Abstract:
For the past years computer scientists generally believed that
Np-complete problems is intractable. In particular, Boolean
Satisfiability (SAT), as a paradigmatic automated-reasoning problem, has
been considered to be intractable. Over the past years, however, there
Have been a quiet, but dramatic, revolution, and very large SAT instances
is now being solved routinely as part of software and hardware design.
In this talk I'll review this amazing development and show how automated
Reasoning is now an industrial reality.

I'll then show describe how we can leverage SAT solving to accomplish
Other automated-reasoning tasks. Counting the number of satisfying
Truth assignments of a given Boolean formula or sampling such assignments
Uniformly at random is fundamental computational problems in computer
Software testing, software synthesis, machine applications
Learning, personalized learning, and more. While the theory of these
Problems has been thoroughly investigated since the 1980s, approximation
Algorithms developed by theoreticians don't scale up to industrial-sized
Instances. Algorithms used by the industry offer better scalability,
But give up certain correctness guarantees to achieve scalability. We
Describe a novel approach, based on universal hashing and satisfiability
Modulo theory, that scales-formulas with hundreds of thousands of
Variable without giving up correctness guarantees.

The talk was accesible to a general CS audience.


Biography:
Moshe Y Vardi is the George distinguished Service Professor in
Computational Engineering and Director of the Ken Kennedy Institute for
Information Technology Institute at Rice University. He is the
Co-recipient of three IBM outstanding innovation Awards, the ACM sigact
Goedel Prize, the ACM Kanellakis Award, the ACM SIGMOD Codd Award, the
Blaise Pascal Medal, the IEEE Computer Society Goode Award, the Eatcs
Distinguished Achievements Award, and the southeastern universities
Association ' s Distinguished Scientist Award. He is the author
and co-author of over papers, as well as the books:reasoning about
Knowledge and finite Model theory and its applications. He is a fellow
of the Association for Computing Machinery, the American Association for
Artificial Intelligence, the American Association for the Advancement of
Science, the European Association-theoretical Computer Science, and
The Institute for electrical and Electronic Engineers. He is a member of
The US national Academy of Engineering, the American Academy of Arts and
Science, the European Academy of science, and academia Europea. He holds
Honorary doctorates from the Saarland University in Germany and Orleans
University in France. He is the editor-in-chief of the Communications of
The ACM.

Seminar by Moshe Vardi University