Zobrazeno 1 - 10
of 172
pro vyhledávání: '"Giuseppe De Giacomo"'
Publikováno v:
Future Internet, Vol 14, Iss 3, p 78 (2022)
In this paper we study Graphol, a fully graphical language inspired by standard formalisms for conceptual modeling, similar to the UML class diagram and the ER model, but equipped with formal semantics. We formally prove that Graphol is equivalent to
Externí odkaz:
https://doaj.org/article/cd3e543e2f094be181bd0f388c8c9009
Publikováno v:
ACM Transactions on Software Engineering and Methodology
Runtime monitoring is a central operational decision support task in business process management. It helps process executors to check on-the-fly whether a running process instance satisfies business constraints of interest, providing an immediate fee
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:90-99
Fully Observable Non-Deterministic (FOND) planning models uncertainty through actions with non-deterministic effects. Existing FOND planning algorithms are effective and employ a wide range of techniques. However, most of the existing algorithms are
Autor:
Marlon Dumas, Fabiana Fournier, Lior Limonad, Andrea Marrella, Marco Montali, Jana-Rebecca Rehse, Rafael Accorsi, Diego Calvanese, Giuseppe De Giacomo, Dirk Fahland, Avigdor Gal, Marcello La Rosa, Hagen Völzer, Ingo Weber
Publikováno v:
ACM Transactions on Management Information Systems, 14(1):11. Association for Computing Machinery, Inc
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 execution of business processes with the aim of making these processes
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031258022
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcbf0a8f996151b80117e21c6ac2fcb7
https://doi.org/10.1007/978-3-031-25803-9_1
https://doi.org/10.1007/978-3-031-25803-9_1
Publikováno v:
Computers in Industry. 149:103916
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
Synthesis techniques for temporal logic specifications are typically based on exploiting symbolic techniques, as done in model checking. These symbolic techniques typically use backward fixpoint computation. Planning, which can be seen as a specific
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
Manufacturing is transitioning from a mass production model to a service model in which facilities `bid' for previously unseen products. To decide whether to bid for a previously unseen product, a facility must be able to synthesize, on the fly, a pr
Autor:
Shufang Zhu, Giuseppe De Giacomo
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
In this paper, we study synthesis of maximally permissive strategies for Linear Temporal Logic on finite traces (LTLf) specifications. That is, instead of computing a single strategy (aka plan, or policy), we aim at computing the entire set of strate
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
``Strong-cyclic policies" were introduced to formalize trial-and-error strategies and are known to work in Markovian stochastic domains, i.e., they guarantee that the goal is reached with probability 1. We introduce ``best-effort" policies for (not n