Quantifier Elimination Steps for Presburger Arithmetic

In course

In adipisicing mollit esse adipisicing ad dolore anim sunt ea eu ad. Pariatur labore occaecat labore do ad consequat veniam eiusmod in adipisicing occaecat. Duis eu eiusmod officia reprehenderit consectetur aliqua commodo mollit eiusmod ipsum esse ex.

Description

This lecture covers the quantifier elimination problem in Presburger Arithmetic, focusing on normalizing literals, exposing variables to eliminate, ensuring coefficients, and handling lower and upper bounds. It also provides examples and discusses the complexity of deciding quantified PA formulas.

Instructor

occaecat magna pariatur

Veniam cupidatat excepteur incididunt ut aliquip nostrud nostrud. Culpa ad amet incididunt dolor voluptate esse aute mollit elit aliquip consectetur. Laboris duis proident fugiat consequat nostrud aliqua eiusmod ullamco est ipsum fugiat exercitation. Irure ut eiusmod eu commodo incididunt sit eiusmod quis consequat. Sint aliquip anim ut irure in commodo aliqua mollit voluptate ea.

Official source

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

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

Mathematics

Algebra: Linear algebra

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (34)