output
20002026
most citedSoftware development in startup companies: A systematic mapping study

416 citations

Showing cs.AIShow all

31 papers · 1 filter

cs.AI2026

Understanding Personalization Gains in Whisper ASR

Sergei Katkov, Antonio Liotta

Whisper-style ASR models provide strong zero-shot transcription, but their residual errors are not evenly distributed across datasets, recording conditions, and metadata-based grou…

cs.AI2025★ 6 cited

Generating Counterfactual Explanations Under Temporal Constraints

Andrei Buliga, Chiara Di Francescomarino, Chiara Ghidini +2

Counterfactual explanations are one of the prominent eXplainable Artificial Intelligence (XAI) techniques, and suggest changes to input data that could alter predictions, leading t…

cs.AI2024★ 2 cited

WATCHDOG: an ontology-aWare risk AssessmenT approaCH via object-oriented DisruptiOn Graphs

Stefano M. Nicoletti, E. Moritz Hahn, Mattia Fumagalli +2

When considering risky events or actions, we must not downplay the role of involved objects: a charged battery in our phone averts the risk of being stranded in the desert after a…

cs.AI2024★ 6 cited

Guiding the generation of counterfactual explanations through temporal background knowledge for Predictive Process Monitoring

Andrei Buliga, Chiara Di Francescomarino, Chiara Ghidini +2

Counterfactual explanations suggest what should be different in the input instance to change the outcome of an AI system. When dealing with counterfactual explanations in the field…

cs.AI2023

Controller Synthesis for Timeline-based Games

Renato Acampora, Luca Geatti, Nicola Gigante +2

In the timeline-based approach to planning, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints. Traditional timeline-b…

cs.AI2022★ 4 cited

Controller Synthesis for Timeline-based Games

Renato Acampora, Luca Geatti, Nicola Gigante +2

In the timeline-based approach to planning, originally born in the space sector, the evolution over time of a set of state variables (the timelines) is governed by a set of tempora…

cs.AI2022★ 2 cited

A first-order logic characterization of safety and co-safety languages

Alessandro Cimatti, Luca Geatti, Nicola Gigante +2

Linear Temporal Logic (LTL) is one of the most popular temporal logics, that comes into play in a variety of branches of computer science. Among the various reasons of its widespre…

cs.AI2022★ 13 cited

Learning to act: a Reinforcement Learning approach to recommend the best next activities

Stefano Branchi, Chiara Di Francescomarino, Chiara Ghidini +3

The rise of process data availability has recently led to the development of data-driven learning approaches. However, most of these approaches restrict the use of the learned mode…

cs.AI2022★ 14 cited

Explainable Predictive Process Monitoring: A User Evaluation

Williams Rizzi, Marco Comuzzi, Chiara Di Francescomarino +4

Explainability is motivated by the lack of transparency of black-box Machine Learning approaches, which do not foster trust and acceptance of Machine Learning algorithms. This also…

cs.AI2022★ 145 cited

AI-Augmented Business Process Management Systems: A Research Manifesto

Marlon Dumas, Fabiana Fournier, Lior Limonad +11

AI-Augmented Business Process Management Systems (ABPMSs) are an emerging class of process-aware information systems, empowered by trustworthy AI technology. An ABPMS enhances the…

cs.AI2021★ 1 cited

SMT-Based Safety Verification of Data-Aware Processes under Ontologies (Extended Version)

Diego Calvanese, Alessandro Gianola, Andrea Mazzullo +1

In the context of verification of data-aware processes (DAPs), a formal approach based on satisfiability modulo theories (SMT) has been considered to verify parameterised safety pr…

cs.AI2021★ 2 cited

CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT (Extended Version)

Paolo Felli, Alessandro Gianola, Marco Montali +2

Conformance checking is a key process mining task for comparing the expected behavior captured in a process model and the actual behavior recorded in a log. While this problem has…

cs.AI2021★ 19 cited

Learning Description Logic Ontologies. Five Approaches. Where Do They Stand?

Ana Ozaki

The quest for acquiring a formal representation of the knowledge of a domain of interest has attracted researchers with various backgrounds into a diverse field called ontology lea…

cs.AI2020★ 1 cited

Knowledge Graphs Evolution and Preservation -- A Technical Report from ISWS 2019

Nacira Abbas, Kholoud Alghamdi, Mortaza Alinam +71

One of the grand challenges discussed during the Dagstuhl Seminar "Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web" and described in its report is…

cs.AI2020★ 3 cited

sunny-as2: Enhancing SUNNY for Algorithm Selection

Tong Liu, Roberto Amadini, Jacopo Mauro +1

SUNNY is an Algorithm Selection (AS) technique originally tailored for Constraint Programming (CP). SUNNY enables to schedule, from a portfolio of solvers, a subset of solvers to b…

cs.AI2019★ 7 cited

Solving reachability problems on data-aware workflows

Riccardo De Masellis, Chiara Di Francescomarino, Chiara Ghidini +1

Recent advances in the field of Business Process Management have brought about several suites able to model complex data objects along with the traditional control flow perspective…

cs.AI2019

Query Inseparability for ALC Ontologies

Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov +2

We investigate the problem whether two ALC ontologies are indistinguishable (or inseparable) by means of queries in a given signature, which is fundamental for ontology engineering…

cs.AI2018★ 1 cited

Situation Calculus for Synthesis of Manufacturing Controllers

Giuseppe De Giacomo, Brian Logan, Paolo Felli +2

Manufacturing is transitioning from a mass production model to a manufacturing as a service model in which manufacturing facilities 'bid' to produce products. To decide whether to…

cs.AI2018★ 10 cited

Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey

Elena Botoeva, Boris Konev, Carsten Lutz +3

The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for exam…

cs.AI2017★ 1 cited

Enhancing workflow-nets with data for trace completion

Riccardo De Masellis, Chiara Di Francescomarino, Chiara Ghidini +1

The growing adoption of IT-systems for modeling and executing (business) processes or services has thrust the scientific investigation towards techniques and tools which support mo…

cs.AI2016★ 11 cited

Abducing Compliance of Incomplete Event Logs

Federico Chesani, Riccardo De Masellis, Chiara Di Francescomarino +4

The capability to store data about business processes execution in so-called Event Logs has brought to the diffusion of tools for the analysis of process executions and for the ass…

cs.AI2015

Reasoning in Infinitely Valued G-IALCQ

Stefan Borgwardt, Rafael Peñaloza

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs us…

cs.AI2015

Bounded Situation Calculus Action Theories

Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi

In this paper, we investigate bounded action theories in the situation calculus. A bounded action theory is one which entails that, in every situation, the number of object tuples…

cs.AI2015★ 6 cited

Fuzzy Answer Set Computation via Satisfiability Modulo Theories

Mario Alviano, Rafael Penaloza

Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information.…