Conformance Checking of Fuzzy Logs against Declarative Temporal Specifications
- URL: http://arxiv.org/abs/2406.12078v1
- Date: Mon, 17 Jun 2024 20:38:57 GMT
- Title: Conformance Checking of Fuzzy Logs against Declarative Temporal Specifications
- Authors: Ivan Donadello, Paolo Felli, Craig Innes, Fabrizio Maria Maggi, Marco Montali,
- Abstract summary: We consider the problem of checking whether fuzzy event data conform with declarative temporal rules specified as Declare patterns.
This requires relax the assumption that at each instant only one activity is executed.
We provide a proof-of-concept, efficient implementation based on the PyTorch Python library.
- Score: 22.272099472568893
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Traditional conformance checking tasks assume that event data provide a faithful and complete representation of the actual process executions. This assumption has been recently questioned: more and more often events are not traced explicitly, but are instead indirectly obtained as the result of event recognition pipelines, and thus inherently come with uncertainty. In this work, differently from the typical probabilistic interpretation of uncertainty, we consider the relevant case where uncertainty refers to which activity is actually conducted, under a fuzzy semantics. In this novel setting, we consider the problem of checking whether fuzzy event data conform with declarative temporal rules specified as Declare patterns or, more generally, as formulae of linear temporal logic over finite traces (LTLf). This requires to relax the assumption that at each instant only one activity is executed, and to correspondingly redefine boolean operators of the logic with a fuzzy semantics. Specifically, we provide a threefold contribution. First, we define a fuzzy counterpart of LTLf tailored to our purpose. Second, we cast conformance checking over fuzzy logs as a verification problem in this logic. Third, we provide a proof-of-concept, efficient implementation based on the PyTorch Python library, suited to check conformance of multiple fuzzy traces at once.
Related papers
- On the Identification of Temporally Causal Representation with Instantaneous Dependence [50.14432597910128]
Temporally causal representation learning aims to identify the latent causal process from time series observations.
Most methods require the assumption that the latent causal processes do not have instantaneous relations.
We propose an textbfIDentification framework for instantanetextbfOus textbfLatent dynamics.
arXiv Detail & Related papers (2024-05-24T08:08:05Z) - Mitigating LLM Hallucinations via Conformal Abstention [70.83870602967625]
We develop a principled procedure for determining when a large language model should abstain from responding in a general domain.
We leverage conformal prediction techniques to develop an abstention procedure that benefits from rigorous theoretical guarantees on the hallucination rate (error rate)
Experimentally, our resulting conformal abstention method reliably bounds the hallucination rate on various closed-book, open-domain generative question answering datasets.
arXiv Detail & Related papers (2024-04-04T11:32:03Z) - DAPrompt: Deterministic Assumption Prompt Learning for Event Causality
Identification [8.102227953905206]
Event Causality Identification (ECI) aims at determining whether there is a causal relation between two event mentions.
We propose a deterministic assumption prompt learning model, called DAPrompt, for the ECI task.
We use the probabilities of predicted events to evaluate the assumption rationality for the final event causality decision.
arXiv Detail & Related papers (2023-07-19T08:02:20Z) - Conformance Checking with Uncertainty via SMT (Extended Version) [66.58864135810981]
We show how to solve the problem of checking conformance of uncertain logs against data-aware reference processes.
Our approach is modular, in that it homogeneously accommodates for different types of uncertainty.
We show the correctness of our approach and witness feasibility through a proof-of-concept implementation.
arXiv Detail & Related papers (2022-06-15T11:39:45Z) - Logical Satisfiability of Counterfactuals for Faithful Explanations in
NLI [60.142926537264714]
We introduce the methodology of Faithfulness-through-Counterfactuals.
It generates a counterfactual hypothesis based on the logical predicates expressed in the explanation.
It then evaluates if the model's prediction on the counterfactual is consistent with that expressed logic.
arXiv Detail & Related papers (2022-05-25T03:40:59Z) - Nested Counterfactual Identification from Arbitrary Surrogate
Experiments [95.48089725859298]
We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments.
Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
arXiv Detail & Related papers (2021-07-07T12:51:04Z) - Uncertain Process Data with Probabilistic Knowledge: Problem
Characterization and Challenges [13.142848956949033]
This paper presents the task relating a process observation to a process model that can be rendered from a dataset.
Motivated by the abundance of uncertain event data from multiple sources including physical devices and sensors, this paper presents three types of challenging cases.
arXiv Detail & Related papers (2021-06-07T03:56:14Z) - Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values.
We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions.
For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
arXiv Detail & Related papers (2020-08-19T16:04:34Z) - 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.