Zobrazeno 1 - 10
of 16
pro vyhledávání: '"kompilace"'
Autor:
Illner, Petr
An NNF circuit is a directed acyclic graph (DAG), where each leaf is labelled with either true/false or a literal, and each inner node represents either a conjunction (∧) or a disjunction (∨). A decomposable NNF (DNNF) is an NNF satisfying the de
Externí odkaz:
http://www.nusl.cz/ntk/nusl-451073
Autor:
Illner, Petr
An NNF circuit is a directed acyclic graph (DAG), where each leaf is labelled with either true/false or a literal, and each inner node represents either a conjunction (∧) or a disjunction (∨). A decomposable NNF (DNNF) is an NNF satisfying the de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::5707a52fcb66504ff0d1affd58f92938
http://www.nusl.cz/ntk/nusl-451073
http://www.nusl.cz/ntk/nusl-451073
Autor:
Chromý, Miloš
Title: Boolean techniques in Knowledge representation Author: Miloš Chromý Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Doc. RNDr. Ondřej Čepek, Ph.D., Department of Theoretical Com- puter Science
Externí odkaz:
http://www.nusl.cz/ntk/nusl-437024
Autor:
Pantůčková, Kristýna
One of the possible approaches to automated planning is compilation to sat- isfiability or constraint satisfaction. Compilation enables to take advantage of the advancement of SAT or CSP solvers. In this thesis, we implement three of the encodings re
Externí odkaz:
http://www.nusl.cz/ntk/nusl-415952
Autor:
Horký, Filip
PHP language has been dominating the web development industry for a long time now. Each major PHP framework brings together a large community and a solid codebase, providing features and tools that make the PHP web application devel- opment even simp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::086aac2082ec67bbc2c320d98b660f40
http://www.nusl.cz/ntk/nusl-415863
http://www.nusl.cz/ntk/nusl-415863
Autor:
Pantůčková, Kristýna
One of the possible approaches to automated planning is compilation to sat- isfiability or constraint satisfaction. Compilation enables to take advantage of the advancement of SAT or CSP solvers. In this thesis, we implement three of the encodings re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::c4ac0814fd18eeba3cfd3171bfaf70f1
http://www.nusl.cz/ntk/nusl-415952
http://www.nusl.cz/ntk/nusl-415952