Mgr. Juraj Síč

Master's thesis

Satisfiability of DQBF Using Binary Decision Diagrams

Satisfiability of DQBF Using Binary Decision Diagrams
Abstract:
V tejto diplomovej práci navrhneme a implementujeme nástroj DQBDD, ktorý zisťuje splniteľnosť kvantifikovaných Booleovských formúl so závislosťami. Tie sú rozšírením kvantifikovaných Booleovských formúl, avšak závislosti medzi kvantifikátormi sú explicitne dané. Tento nástroj používa binárne rozhodovacie stromy ako podpornú reprezentáciu Booleovských formúl a techniku eliminácie kvantifikátorov na …more
Abstract:
In this thesis, we devise and implement a satisfiability solver DQBDD for dependency quantified Boolean formulas (DQBFs), which are an extension of quantified Boolean formulas (QBFs) where the dependencies between quantifiers are explicitly given. It uses binary decision diagrams (BDDs) as an underlying representation of Boolean formulas with quantifier elimination approach for solving. We show that …more
 

Keywords

dependency quantified Boolean formula DQBF binary decision diagram BDD satisfiability quantifier elimination quantifier localisation
 
Language used: English
Date on which the thesis was submitted / produced: 19. 5. 2020
Identifier: https://is.muni.cz/th/prexv/

Thesis defence

  • Date of defence: 17. 6. 2020
  • Supervisor: doc. RNDr. Jan Strejček, Ph.D.
  • Reader: doc. RNDr. Vojtěch Řehák, Ph.D.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Informatics / Theoretical Informatics

Theses on a related topic

List of theses with an identical keyword.
  • No theses on a related topic available.