Řešení problémů booleovské splnitelnosti
In this thesis we study the possibilities of decomposing Boolean formulae into connected components. For this reason, we introduce a new concept - component trees. We describe some of their properties and suggest some applications. We designed a class of decision heuristics for SAT solvers based on...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Slovak |
| Published: |
2010
|
| Online Access: | http://www.nusl.cz/ntk/nusl-286722 |