arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2206.07862cs.AI
收藏

非布尔形式优化的统一框架

Unifying Framework for Optimizations in non-boolean Formalisms

University of Nebraska Omaha(内布拉斯加大学奥马哈分校)

Yuliya Lierler

摘要:

搜索优化问题在科学和工程领域中大量存在。长期以来,人工智能对搜索算法和声明性程序设计语言的发展做出了贡献,这些语言旨在解决和建模搜索优化问题。自动推理和知识表示是人工智能的子领域,特别是在这些发展中。许多流行的自动推理范例为用户提供了支持优化语句的语言。回忆整数线性规划,MaxSAT,最优化可满足性模理论和(约束)答案集规划。这些范例在它们的语言中在表达计算解决方案的质量条件的方式上显着不同。在这里,我们提出了一个统一的框架,所谓的扩展重量系统,消除语法之间的区别范例。它们使我们能够看到不同的自动推理语言提供的优化语句之间的本质相似性和差异。我们还研究了所提出的系统,立即转化为形式属性的范式,可以在我们的框架内捕获的正式属性。逻辑程序设计理论与实践(TPLP)

英文摘要:

Search-optimization problems are plentiful in scientific and engineering domains. Artificial intelligence has long contributed to the development of search algorithms and declarative programming languages geared towards solving and modeling search-optimization problems. Automated reasoning and knowledge representation are the subfields of AI that are particularly vested in these developments. Many popular automated reasoning paradigms provide users with languages supporting optimization statements. Recall integer linear programming, MaxSAT, optimization satisfiability modulo theory, and (constraint) answer set programming. These paradigms vary significantly in their languages in ways they express quality conditions on computed solutions. Here we propose a unifying framework of so called extended weight systems that eliminates syntactic distinctions between paradigms. They allow us to see essential similarities and differences between optimization statements provided by distinct automated reasoning languages. We also study formal properties of the proposed systems that immediately translate into formal properties of paradigms that can be captured within our framework. Under consideration in Theory and Practice of Logic Programming (TPLP).

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

↑