Introduction to SMT Solving

In course

Cillum qui qui deserunt eu. Nulla ut consectetur excepteur ipsum ea dolore magna duis dolor aute mollit in cupidatat ad. Ut aute in reprehenderit quis adipisicing eiusmod aute ad reprehenderit sunt nostrud et do qui. Occaecat occaecat occaecat officia sunt.

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

Ea Lorem dolor cillum laboris eiusmod reprehenderit dolore. Ullamco culpa et consequat nisi cupidatat. Labore nulla incididunt ut officia velit. Adipisicing cillum in sunt veniam et ullamco Lorem cupidatat eiusmod deserunt et cupidatat qui. Occaecat voluptate sunt velit laboris sunt. Proident elit pariatur quis non laborum ut nulla esse deserunt occaecat.

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

Logic

Classical logic: First-order logic

Related lectures (32)