Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Pacenza, Francesco"'
Autor:
Pacenza, Francesco, Zangari, Jessica
Answer Set Programming (ASP) is a widely used declarative programming paradigm that has shown great potential in solving complex computational problems. However, the inability to natively support non-integer arithmetic has been highlighted as a major
Externí odkaz:
http://arxiv.org/abs/2312.04249
In imperative programming, the Domain-Driven Design methodology helps in coping with the complexity of software development by materializing in code the invariants of a domain of interest. Code is cleaner and more secure because any implicit assumpti
Externí odkaz:
http://arxiv.org/abs/2307.06382
The repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such contexts, one can avoid the iterative generation of ground programs thus ac
Externí odkaz:
http://arxiv.org/abs/2008.04108
Autor:
Pacenza, Francesco
Publikováno v:
EPTCS 306, 2019, pp. 420-426
The aim of my Ph.D. thesis concerns Reasoning in Highly Reactive Environments. As reasoning in highly reactive environments, we identify the setting in which a knowledge-based agent, with given goals, is deployed in an environment subject to repeated
Externí odkaz:
http://arxiv.org/abs/1909.08260
Autor:
Calimeri, Francesco, Ianni, Giovambattista, Pacenza, Francesco, Perri, Simona, Zangari, Jessica
Publikováno v:
Theory and Practice of Logic Programming 19 (2019) 957-973
Repeated executions of reasoning tasks for varying inputs are necessary in many applicative settings, such as stream reasoning. In this context, we propose an incremental grounding approach for the answer set semantics. We focus on the possibility of
Externí odkaz:
http://arxiv.org/abs/1907.09212
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Robaldo, Livio, Batsakis, Sotiris, Calegari, Roberta, Calimeri, Francesco, Fujita, Megumi, Governatori, Guido, Morelli, Maria Concetta, Pacenza, Francesco, Pisano, Giuseppe, Satoh, Ken, Tachmazidis, Ilias, Zangari, Jessica
This paper analyses and compares some of the automated reasoners that have been used in recent research for compliance checking. Although the list of the considered reasoners is not exhaustive,we believe that our analysis is representative enough to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4094::e8d4e5b5753363ea773c363e71ebfd61
https://hdl.handle.net/11585/928318
https://hdl.handle.net/11585/928318
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mastria, Elena, Pacenza, Francesco, Zangari, Jessica, Calimeri, Francesco, Perri, Simona, Terracina, Giorgio
Publikováno v:
Big Data & Cognitive Computing; Sep2023, Vol. 7 Issue 3, p135, 18p
Autor:
Calimeri, Francesco, Leone, Nicola, Melissari, Giovanni, Pacenza, Francesco, Perri, Simona, Reale, Kristian, Ricca, Francesco, Zangari, Jessica
Publikováno v:
Algorithms; Mar2023, Vol. 16 Issue 3, p159, 14p