Rozhodování pravdivosti formulí Presburgerovy aritmetiky pomocí eliminace kvantifikátorů

Thumbnail Image

Files

JUR516_FEI_B2647_2612R025_2011.pdf (346.75 KB)
JUR516_FEI_B2647_2612R025_2011_zadani.pdf (295.02 KB)
JUR516_FEI_B2647_2612R025_2011_priloha.zip (8.61 KB)
JUR516_FEI_B2647_2612R025_2011_posudek_vedouci_Sawa_Zdenek.pdf (54.89 KB)
JUR516_FEI_B2647_2612R025_2011_posudek_oponent_Bohm_Stanislav.pdf (48.61 KB)

Downloads

5

Date issued

2011

Authors

Jurečka, Pavel

Journal Title

Journal ISSN

Volume Title

Publisher

Vysoká škola báňská - Technická univerzita Ostrava

Location

Signature

Abstract

The bachelor thesis deals with possibility to decide truth of formulas of Presburger arithmetic using quantifier elimination. In first chapter is general description of Presburger arithmetic, quantifier elimination and specification of problem. Next chapter describes the computer program, used principles and techniques, from reading input formula through its processing by quantifier elimination method to final evaluation of truth.

Description

Import 03/08/2012

Subject(s)

Presburger arithmetic, quantifier elimination, Cooper, lexical analysis, syntactic analysis, OCaml, functional programming

Citation

Item identifier

http://hdl.handle.net/10084/93246

Collections

Vysokoškolské kvalifikační práce Fakulty elektrotechniky a informatiky / Theses and dissertations of Faculty of Electrical Engineering and Computer Science (FEI)