Lecture

Introduction to SMT Solving

In course

Occaecat nostrud mollit do est voluptate veniam commodo adipisicing consequat sit eu ut nostrud. Dolore anim incididunt qui ea ullamco pariatur tempor ut elit duis sunt proident culpa consequat. Reprehenderit fugiat duis excepteur do eiusmod consequat nisi aliquip est officia in pariatur mollit.

Description

This lecture introduces Satisfiability Modulo Theories (SMT) solving, focusing on determining truth values for complex formulas involving propositional logic and uninterpreted functions. It covers the flattening and extraction of propositional structure, handling function symbols and arithmetic, the theory of uninterpreted function symbols, decision procedures in SMT solvers, and quantifier instantiation during the solving process.

Instructor

eu duis laborum

Anim velit Lorem labore consequat nostrud voluptate voluptate ut. Velit officia veniam ullamco consectetur magna aliqua commodo nostrud non. Quis nisi non magna non minim velit sint culpa velit aute mollit aliquip. Officia laboris cillum sit ullamco magna amet.

Official source

https://mediaspace.epfl.ch/media/0_gciyd25o

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Related lectures (29)