ASP-Based Declarative Process Mining

• URL: http://arxiv.org/abs/2205.01979v1
• Date: Wed, 4 May 2022 10:11:54 GMT
• Title: ASP-Based Declarative Process Mining
• Authors: Francesco Chiariello, Fabrizio Maria Maggi, Fabio Patrizi
• Abstract summary: We put forward Answer Set Programming (ASP) as a solution approach for three classical problems in Declarative Process Mining. We tackle them in their data-aware variant, i.e., by considering events that carry a payload (set of attribute-value pairs) The contributions of the work include an ASP encoding schema for the three problems, their solution, and experiments showing the feasibility of the approach.
• Score: 4.060731229044571
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We put forward Answer Set Programming (ASP) as a solution approach for three classical problems in Declarative Process Mining: Log Generation, Query Checking, and Conformance Checking. These problems correspond to different ways of analyzing business processes under execution, starting from sequences of recorded events, a.k.a. event logs. We tackle them in their data-aware variant, i.e., by considering events that carry a payload (set of attribute-value pairs), in addition to the performed activity, specifying processes declaratively with an extension of linear-time temporal logic over finite traces (LTLf). The data-aware setting is significantly more challenging than the control-flow one: Query Checking is still open, while the existing approaches for the other two problems do not scale well. The contributions of the work include an ASP encoding schema for the three problems, their solution, and experiments showing the feasibility of the approach.

Related papers

• SPARE: Single-Pass Annotation with Reference-Guided Evaluation for Automatic Process Supervision and Reward Modelling [70.01883340129204]
  Single-Pass.<n>with Reference-Guided Evaluation (SPARE)<n>Novel structured framework that enables single-pass, per-step annotation by aligning each solution step to one or multiple steps in a reference solution, accompanied by explicit reasoning for evaluation.<n>SPARE achieves competitive performance on challenging mathematical datasets while offering 2.6 times greater efficiency, requiring only 38% of the runtime.
  arXiv  Detail & Related papers  (2025-06-18T14:37:59Z)
• The WHY in Business Processes: Unification of Causal Process Models [2.0811729303868005]
  Causal reasoning is essential for business process interventions and improvement.<n>We propose a novel method to unify multiple causal process variants into a consistent model.
  arXiv  Detail & Related papers  (2025-05-28T21:12:30Z)
• Combining Abstract Argumentation and Machine Learning for Efficiently Analyzing Low-Level Process Event Streams [18.821902752237204]
  We propose a data/computation-efficient neuro-symbolic approach to the interpretation problem.<n>Considering the urgent need of developing Green AI solutions, we propose a data/computation-efficient neuro-symbolic approach to the problem.
  arXiv  Detail & Related papers  (2025-05-09T08:45:07Z)
• Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning [48.829971427616854]
  We introduce Recursive Decomposition with Dependencies (RDD), a scalable divide-and-conquer method for solving reasoning problems.<n>RDD can be directly applied to a new problem class even in the absence of any task-specific guidance.<n>We evaluate our approach on two benchmarks with six difficulty levels each and in two in-context settings.
  arXiv  Detail & Related papers  (2025-05-05T11:24:20Z)
• Prompting Strategies for Enabling Large Language Models to Infer Causation from Correlation [68.58373854950294]
  We focus on causal reasoning and address the task of establishing causal relationships based on correlation information. We introduce a prompting strategy for this problem that breaks the original task into fixed subquestions. We evaluate our approach on an existing causal benchmark, Corr2Cause.
  arXiv  Detail & Related papers  (2024-12-18T15:32:27Z)
• Improving Steering and Verification in AI-Assisted Data Analysis with Interactive Task Decomposition [24.845241768474363]
  LLM-powered tools like ChatGPT Data Analysis have the potential to help users tackle the challenging task of data analysis programming. However, our formative study uncovered serious challenges in verifying AI-generated results and steering the AI. We developed two contrasting approaches to address these challenges.
  arXiv  Detail & Related papers  (2024-07-02T20:33:50Z)
• H-STAR: LLM-driven Hybrid SQL-Text Adaptive Reasoning on Tables [56.73919743039263]
  This paper introduces a novel algorithm that integrates both symbolic and semantic (textual) approaches in a two-stage process to address limitations. Our experiments demonstrate that H-STAR significantly outperforms state-of-the-art methods across three question-answering (QA) and fact-verification datasets.
  arXiv  Detail & Related papers  (2024-06-29T21:24:19Z)
• LaSagnA: Language-based Segmentation Assistant for Complex Queries [39.620806493454616]
  Large Language Models for Vision (vLLMs) generate detailed perceptual outcomes, including bounding boxes and masks. In this study, we acknowledge that the main cause of these problems is the insufficient complexity of training queries. We present three novel strategies to effectively handle the challenges arising from the direct integration of the proposed format.
  arXiv  Detail & Related papers  (2024-04-12T14:40:45Z)
• Extracting Process-Aware Decision Models from Object-Centric Process Data [54.04724730771216]
  This paper proposes the first object-centric decision-mining algorithm called Integrated Object-centric Decision Discovery Algorithm (IODDA) IODDA is able to discover how a decision is structured as well as how a decision is made.
  arXiv  Detail & Related papers  (2024-01-26T13:27:35Z)
• Successive Prompting for Decomposing Complex Questions [50.00659445976735]
  Recent works leverage the capabilities of large language models (LMs) to perform complex question answering in a few-shot setting. We introduce Successive Prompting'', where we iteratively break down a complex task into a simple task, solve it, and then repeat the process until we get the final solution. Our best model (with successive prompting) achieves an improvement of 5% absolute F1 on a few-shot version of the DROP dataset.
  arXiv  Detail & Related papers  (2022-12-08T06:03:38Z)
• Monitoring Constraints in Business Processes Using Object-Centric Constraint Graphs [0.5330240017302619]
  Constraint monitoring aims to monitor the violation of constraints in business processes. Business processes are object-centric, i.e., multiple case notions (objects) exist. We propose an approach to monitoring constraints in object-centric business processes.
  arXiv  Detail & Related papers  (2022-10-21T16:11:29Z)
• Accessing and Interpreting OPC UA Event Traces based on Semantic Process Descriptions [69.9674326582747]
  This paper proposes an approach to access a production systems' event data based on the event data's context. The approach extracts filtered event logs from a database system by combining: 1) a semantic model of a production system's hierarchical structure, 2) a formalized process description and 3) an OPC UA information model.
  arXiv  Detail & Related papers  (2022-07-25T15:13:44Z)
• CINS: Comprehensive Instruction for Few-shot Learning in Task-oriented Dialog Systems [56.302581679816775]
  This paper proposes Comprehensive Instruction (CINS) that exploits PLMs with task-specific instructions. We design a schema (definition, constraint, prompt) of instructions and their customized realizations for three important downstream tasks in ToD. Experiments are conducted on these ToD tasks in realistic few-shot learning scenarios with small validation data.
  arXiv  Detail & Related papers  (2021-09-10T03:23:06Z)
• Recognizing and Splitting Conditional Sentences for Automation of Business Processes Management [2.289790204910258]
  We present our system that resolves an end-to-end problem consisting of 1) recognizing conditional sentences from technical documents, 2) finding boundaries to extract conditional and resultant clauses, and 3) categorizing resultant clause as Action or Consequence. Our best model achieved very promising results of 83.82, 87.84, and 85.75 for extracting Condition, Action, and Consequence clauses.
  arXiv  Detail & Related papers  (2021-04-01T17:53:16Z)
• CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT (Extended Version) [62.96267257163426]
  We introduce the CoCoMoT (Computing Conformance Modulo Theories) framework. First, we show how SAT-based encodings studied in the pure control-flow setting can be lifted to our data-aware case. Second, we introduce a novel preprocessing technique based on a notion of property-preserving clustering.
  arXiv  Detail & Related papers  (2021-03-18T20:22:50Z)
• Partial Order Resolution of Event Logs for Process Conformance Checking [10.58705988536919]
  A key assumption of existing conformance checking techniques is that all events are associated with timestamps that allow to infer a total order of events per process instance. We present several estimators for this task, incorporating different notions of behavioral abstraction. Our experiments with real-world and synthetic data reveal that our approach improves accuracy over the state-of-the-art considerably.
  arXiv  Detail & Related papers  (2020-07-05T18:43:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.