Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings
Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings
复制标题
人工智能中的逻辑 - 第 18 届欧洲会议，JELIA 2023，德国德累斯顿，2023 年 9 月 20-22 日，会议记录
DOI：
10.1007/978-3-031-43619-2_16
复制
发表时间：
2023
期刊：
影响因子：
--
通讯作者：
Chrpa L
中科院分区：
文献类型：
--
作者：
Chrpa L
自动规划是人工智能的一个重要领域，也是智能自治代理的重要组成部分。领域独立规划的一个关键方面是领域模型，它对推理给定问题所需的领域知识的形式化表示进行编码。尽管领域模型在自动规划中起着至关重要的作用，但缺乏通过比较不同版本的模型来支持知识工程过程的工具，特别是确定和突出模型的差异。为了测量两个模型的相似性，我们引入了一个有向图表示的提升域模型，允许制定域模型相似性问题作为一个变种的图形编辑距离问题。我们提出了一个答案集编程的方法来最佳地解决域模型相似性问题，确定的最小数量的修改模型需要成为强等价的，我们证明了一系列的基准模型的方法的能力。
Automated planning is a prominent area of Artificial Intelligence, and an important component for intelligent autonomous agents. A critical aspect of domain-independent planning is the domain model, that encodes a formal representation of domain knowledge needed to reason upon a given problem. Despite the crucial role of domain models in automated planning, there is lack of tools supporting knowledge engineering process by comparing different versions of the models, in particular, determining and highlighting differences the models have.In this paper, we build on the notion ofstrong equivalenceof domain models and formalise a novel concept ofsimilarityof domain models. To measure the similarity of two models, we introduce a directed graph representation of lifted domain models that allows to formulate the domain model similarity problem as a variant of the graph edit distance problem. We propose an Answer Set Programming approach to optimally solve the domain model similarity problem, that identifies the minimum number of modifications the models need to become strongly equivalent, and we demonstrate the capabilities of the approach on a range of benchmark models.