arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.09475cs.AIcs.LO
收藏

用SMT求解器求解AI问题的模型

Using SMT Solvers to Validate Models for AI Problems

Alexandru Ioan Cuza University of Iaşi(雅西亚历山德鲁·伊万·库扎大学)

Andrei Arusoaie, Ionut Pistol

摘要:

人工智能问题,从规划/调度到游戏控制,包括一个重要的关键步骤:描述一个模型,该模型准确定义了问题所需的数据,要求,允许的过渡和既定的目标。模型失败的方式有很多,并且通常会导致搜索策略无法提供快速、最佳甚至任何解决方案。本文提出使用SMT(可满足性模理论)求解器,如Z3,来检查模型的有效性。我们提出两个测试:检查最终(目标)状态是否存在于模型描述的问题空间中,并检查所描述的转换是否可以提供从所识别的初始状态到任何目标状态的路径(意味着已经找到解决方案)。使用SMT求解器进行AI模型检验的优点在于,它们替代了实际的搜索策略,并且它们处理模型的抽象表示,即一组逻辑公式。在抽象层面上进行推理并不像探索整个解决方案空间那样昂贵。SMT求解器使用有效的决策过程,为与AI模型相对应的逻辑公式提供证明。Z3最近添加的一个功能允许我们将转换序列描述为递归函数,因此我们可以检查是否可以在定义的模型中找到解决方案。

英文摘要:

Artificial Intelligence problems, ranging form planning/scheduling up to game control, include an essential crucial step: describing a model which accurately defines the problem's required data, requirements, allowed transitions and established goals. The ways in which a model can fail are numerous and often lead to a failure of search strategies to provide a quick, optimal, or even any solution. This paper proposes using SMT (Satisfiability Modulo Theories) solvers, such as Z3, to check the validity of a model. We propose two tests: checking whether a final(goal) state exists in the model's described problem space and checking whether the transitions described can provide a path from the identified initial states to any the goal states (meaning a solution has been found). The advantage of using an SMT solver for AI model checking is that they substitute actual search strategies and they work over an abstract representation of the model, that is, a set of logical formulas. Reasoning at an abstract level is not as expensive as exploring the entire solution space. SMT solvers use efficient decision procedures which provide proofs for the logical formulas corresponding to the AI model. A recent addition to Z3 allowed us to describe sequences of transitions as a recursive function, thus we can check if a solution can be found in the defined model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑