close
Model-Based Transformations for Quantified Boolean Formulas強檔特價
網友評鑑4.5顆星，點擊圖片 即可前往購買
博客來電腦-計算機概論 分類超值推薦
想看更多[Model-Based Transformations for Quantified Boolean Formulas]的詳細說明嗎
點圖即可看詳細介紹
內容簡介
| In his 2009 thesis in electronics, information, and mathematics at Paderborn University, Bubeck discusses from both theoretical and practical perspectives techniques for solving quantified Boolean formulas, including dependency quantified Boolean formulas. These formulas extend propositional formulas by allowing both universal and existential quantifiers over propositional variables, and are useful for modeling problems in artificial intelligence and computer science. He addresses them from the perspectives of how the expressiveness of quantifiers depends on the structure of the propositional matrix of the formula, whether it is possible to simplify quantifier prefixes without a significant loss of compactness, and which usage patterns of quantifiers lead to encodings with a good tradeoff between compactness and complexity. Annotation 穢2010 Book News, Inc., Portland, OR (booknews.com) |
美金：73.00元
本類書籍銷售 Top 5
全站熱搜
留言列表
