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

解决模块化模型扩展任务

Solving Modular Model Expansion Tasks

Shahab Tasharrofi, Xiongnan, Wu, Eugenia Ternovska

摘要:

我们在这里描述的工作是一个研究计划的一部分,发展基础的声明解决搜索问题。我们认为模型扩展任务是代表搜索问题本质的任务,在搜索问题中,我们给出了一个问题的实例,并正在搜索满足某些属性的解决方案。这样的任务在人工智能、形式化验证、计算生物学中很常见。最近,模型扩展框架被扩展到处理多个模块。在本文中,受实际组合求解器的启发,我们介绍了一种算法来解决模块化系统的模型扩展任务。我们表明,我们的算法密切对应于在实践中所做的不同领域,如可满足性模理论(SMT),线性规划(ILP),回答集编程(ASP)。

英文摘要:

The work we describe here is a part of a research program of developing foundations of declarative solving of search problems. We consider the model expansion task as the task representing the essence of search problems where we are given an instance of a problem and are searching for a solution satisfying certain properties. Such tasks are common in artificial intelligence, formal verification, computational biology. Recently, the model expansion framework was extended to deal with multiple modules. In the current paper, inspired by practical combined solvers, we introduce an algorithm to solve model expansion tasks for modular systems. We show that our algorithm closely corresponds to what is done in practice in different areas such as Satisfiability Modulo Theories (SMT), Integer Linear Programming (ILP), Answer Set Programming (ASP).

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

↑