Modelling and Solving Problems Using SAT Techniques

• Thesis title in Czech: Modelling and Solving Problems Using SAT Techniques
• Thesis title in English: Modelling and Solving Problems Using SAT Techniques
• Key words: Splnitelnost, Plánování, Modelování
• English key words: Satisfiability, Planning, Modeling
• Academic year of topic announcement: 2010/2011
• Thesis type: dissertation
• Thesis language: angličtina
• Department: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
• Supervisor: prof. RNDr. Roman Barták, Ph.D.
• Author: hidden - assigned and confirmed by the Study Dept.
• Date of registration: 10.10.2010
• Date of assignment: 10.10.2010
• Date and time of defence: 29.09.2014 10:00
• Date of electronic submission: 19.06.2014
• Date of submission of printed version: 19.06.2014
• Date of proceeded defence: 29.09.2014
• Opponents: prof. Ing. Filip Železný, Ph.D.
• Advisors: doc. RNDr. Pavel Surynek, Ph.D.

Guidelines

Student se bude zabývat technikami splňování logických formulí. Konkrétně bude pracovat na metodách, jak reprezentovat (pseudo)-reálné problémy jako problémy Booleovské splnitelnosti, a na technikách jak takové obecné formule řešit, tj. jak hledat jejich model.

References

Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (eds.): Handbook of Satisfiability, IOS Press 2009

sborníky konferencí AAAI, IJCAI, ECAI