直接用ASP规则表达声明约束，提升流程挖掘效率。
Direct Encoding of Declare Constraints in ASP
- 不通过中间表示，直接将声明约束转为ASP规则
- 在两个流程挖掘任务中表现优于现有ASP编码和Python库
- 适合需要高效处理声明式流程规范的研究者
答案集编程（ASP）作为一种声明式逻辑编程范式，近年来在流程挖掘中得到实际应用，尤其用于建模基于声明规范的业务流程。其中，Declare是使用最广泛的声明式流程建模语言，通过要求合法轨迹满足一组约束来描述流程，这些约束可用有限迹上的线性时序逻辑（LTLf）表达。现有基于ASP的解决方案通过建模对应的LTLf公式或其等价自动机来实现声明约束编码，这些自动机可通过已有技术获得。本文提出一种新型声明约束编码方法，直接以ASP规则的形式建模其语义，无需中间表示。我们在两个流程挖掘任务中评估该方法的有效性，与其它ASP编码方案及一个Python声明库进行对比。研究被提交至《理论与实践逻辑编程》（TPLP）。
原文摘要 · Abstract (English)
Answer Set Programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to model tasks involving declarative specifications of business processes. In this area, Declare stands out as the most widely adopted declarative process modeling language, offering a means to model processes through sets of constraints valid traces must satisfy, that can be expressed in Linear Temporal Logic over Finite Traces (LTLf). Existing ASP-based solutions encode Declare constraints by modeling the corresponding LTLf formula or its equivalent automaton which can be obtained using established techniques. In this paper, we introduce a novel encoding for Declare constraints that directly models their semantics as ASP rules, eliminating the need for intermediate representations. We assess the effectiveness of this novel approach on two Process Mining tasks by comparing it with alternative ASP encodings and a Python library for Declare. Under consideration in Theory and Practice of Logic Programming (TPLP).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。