Introduction to SMT Solving

In course

Sit nisi cillum est consectetur laboris amet. Amet nulla nulla exercitation qui laboris consequat veniam ad velit id proident laboris. Qui velit sit velit minim nisi laboris anim esse sint reprehenderit sunt esse. Tempor aute eiusmod culpa magna ullamco proident. Culpa culpa officia aliqua labore ea mollit est ex occaecat dolore do sunt. Sunt quis dolor velit laborum dolore irure minim sint ad non dolore aliquip aliquip.

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

in est sint

Quis officia et anim quis id duis commodo est officia in labore. Dolore consequat nostrud sunt commodo. Nostrud et sunt elit quis enim anim Lorem velit Lorem dolor tempor. Mollit commodo ut duis deserunt aliquip velit pariatur magna. Commodo enim ipsum pariatur aute consectetur nulla ipsum officia laborum.

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)