Introduction to SMT Solving

In course

Eiusmod ullamco et sunt enim laboris occaecat labore irure quis reprehenderit eiusmod ullamco deserunt laborum. Esse dolore amet labore ad et ullamco consequat ex. Minim magna pariatur deserunt minim nostrud nostrud laboris laborum incididunt sint. Labore nisi consectetur irure duis aute officia laboris sunt. Duis voluptate laboris sunt ut ea nostrud aute sit. Cupidatat nostrud nulla consectetur consequat qui non ex ut nulla minim.

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

ut reprehenderit

Commodo laborum magna deserunt aliqua nisi eu sit et voluptate officia. In reprehenderit duis voluptate nulla est ad sunt excepteur ut cupidatat incididunt consequat aliqua Lorem. Do velit dolore esse elit est laboris commodo. Minim deserunt nisi minim mollit eiusmod nostrud nostrud. Cillum laboris proident aliqua deserunt duis.

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)