文章基本信息

标题：A SAT Encoding for Solving Games with Energy Objectives
本地全文：下载
作者：Raffaella Gentilini
期刊名称：Computer Science & Information Technology
电子版ISSN：2231-5403
出版年度：2014
卷号：4
期号：1
页码：45-52
DOI：10.5121/csit.2014.4105
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Recently, a reduction from the problem of solving parity games to the satisfiability problem inpropositional logic (SAT) have been proposed in [5], motivated by the success of SAT solvers insymbolic verification. With analogous motivations, we show how to exploit the notion of energyprogress measure to devise a reduction from the problem of energy games to the satisfiabilityproblem for formulas of propositional logic in conjunctive normal form.