Zobrazeno 1 - 10
of 233
pro vyhledávání: '"Luca Pulina"'
Publikováno v:
Information, Vol 14, Iss 7, p 397 (2023)
Interest in machine learning and neural networks has increased significantly in recent years. However, their applications are limited in safety-critical domains due to the lack of formal guarantees on their reliability and behavior. This paper shows
Externí odkaz:
https://doaj.org/article/74c45f2ce2d9472fae8d8ab8d17ad8d7
Publikováno v:
IEEE Access, Vol 9, Pp 83718-83726 (2021)
Cyber-Physical Systems (CPSs) are engineered systems that are built from, and depend upon, the seamless integration of computational algorithms and physical components. CPSs are widely used in many safety-critical domains, making it crucial to ensure
Externí odkaz:
https://doaj.org/article/c5e04de964af4ca2b318868916607f85
Autor:
Laura Pandolfo, Luca Pulina
Publikováno v:
International Journal on Semantic Web and Information Systems. 17:1-21
Using semantic web technologies is becoming an efficient way to overcome metadata storage and data integration problems in digital archives, thus enhancing the accuracy of the search process and leading to the retrieval of more relevant results. In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::884e94f1ee669a10348e792b75435934
https://doi.org/10.4018/ijswis.2021100101
https://doi.org/10.4018/ijswis.2021100101
Publikováno v:
IEEE Access, Vol 9, Pp 83718-83726 (2021)
IEEE Access
IEEE Access
Cyber-Physical Systems (CPSs) are engineered systems that are built from, and depend upon, the seamless integration of computational algorithms and physical components. CPSs are widely used in many safety-critical domains, making it crucial to ensure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9b015f945012cbd4d7a33532da4ce62
https://doi.org/10.1109/access.2021.3085911
https://doi.org/10.1109/access.2021.3085911
Publikováno v:
International Journal of Technology and Human Interaction. 16:24-38
Nowadays, there is an increasing interest in using adaptive technologies in cultural heritage sites to personalize and enhance the user's visit experience. However, personalizing the cultural experiences is still a challenging task that requires a de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38f3d92d492e938b83017b1fdd915b4e
https://doi.org/10.4018/ijthi.2020070102
https://doi.org/10.4018/ijthi.2020070102
Autor:
Luca Pulina, Martina Seidl
Publikováno v:
Artificial Intelligence. 274:224-248
After a break of about five years, in 2016 the classical QBFEVAL has been revived. QBFEVAL is a competitive evaluation of solvers for quantified Boolean formulas (QBF), the extension of propositional formulas with existential and universal quantifier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99658ffc6c96bc7b24563d893681c339
https://doi.org/10.1016/j.artint.2019.04.002
https://doi.org/10.1016/j.artint.2019.04.002
Autor:
Laura Pandolfo, Luca Pulina
Publikováno v:
WEBIST
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::910ce18d24cbbba0e2d2a0612a207e56
https://doi.org/10.5220/0010677000003058
https://doi.org/10.5220/0010677000003058
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2021 ISBN: 9783030802226
SAT
SAT
We present QBFFam, a tool for the generation of formula families originating from the field of proof complexity. Such formula families are used to investigate the strength of proof systems and to show how they relate to each other in terms of simulat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1511cb0faa8fe94bdcd1143fc3632593
https://doi.org/10.1007/978-3-030-80223-3_3
https://doi.org/10.1007/978-3-030-80223-3_3
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783030888848
ATVA
ATVA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9a5644394715273ab60a8aab20dffc9
https://doi.org/10.1007/978-3-030-88885-5_23
https://doi.org/10.1007/978-3-030-88885-5_23
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030557539
NFM
Lecture Notes in Computer Science
Lecture Notes in Computer Science-NASA Formal Methods
NASA Formal Methods-12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11–15, 2020, Proceedings
NFM
Lecture Notes in Computer Science
Lecture Notes in Computer Science-NASA Formal Methods
NASA Formal Methods-12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11–15, 2020, Proceedings
We present a new approach to conformance testing of black-box reactive systems. We consider system specifications written as linear temporal logic formulas to generate tests as sequences of input/output pairs: inputs are extracted from the Buchi auto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17da86d47927a75677f6ccefb6b9a323
https://doi.org/10.1007/978-3-030-55754-6_9
https://doi.org/10.1007/978-3-030-55754-6_9