基于模拟推理的应答集编程中的编码Petri网
Encoding Petri Nets in Answer Set Programming for Simulation Based Reasoning
摘要：
我们的长期研究目标之一是开发系统来回答现实问题（例如，一些在教科书中提到的）关于生物学家可能会问的生物途径。为了回答这些问题，我们需要能够对路径建模、模拟其执行、对这些路径的干预建模并在不同情况下比较模拟的形式化。我们发现Petri网是一个合适的形式主义的建模和仿真需要的起点。然而，我们需要对Petri网模型进行扩展，并使用多个仿真运行和并行状态演化进行推理。为此，Petri网的回答集编程（ASP）实现将允许我们做到这两点。在本文中，我们将展示如何ASP可以用来编码基本的Petri网在一个直观的方式。然后，我们将展示如何修改这种编码模型的几个Petri网扩展进行小的更改。然后，我们强调了一些推理能力，我们将使用它来实现我们的最终研究目标。
英文摘要：
One of our long term research goals is to develop systems to answer realistic questions (e.g., some mentioned in textbooks) about biological pathways that a biologist may ask. To answer such questions we need formalisms that can model pathways, simulate their execution, model intervention to those pathways, and compare simulations under different circumstances. We found Petri Nets to be the starting point of a suitable formalism for the modeling and simulation needs. However, we need to make extensions to the Petri Net model and also reason with multiple simulation runs and parallel state evolutions. Towards that end Answer Set Programming (ASP) implementation of Petri Nets would allow us to do both. In this paper we show how ASP can be used to encode basic Petri Nets in an intuitive manner. We then show how we can modify this encoding to model several Petri Net extensions by making small changes. We then highlight some of the reasoning capabilities that we will use to accomplish our ultimate research goal.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
