Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Margherita, Zorzi"'
Publikováno v:
Bulletin of the Section of Logic, Vol 52, Iss 4, Pp 459-495 (2023)
We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum. We design the sy
Externí odkaz:
https://doaj.org/article/b1e1dee47c9c4f58b207a9f0b231cab9
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 292, Iss Proc. Linearity-TLLA 2018, Pp 133-147 (2019)
We present IQu, namely a quantum programming language that extends Reynold's Idealized Algol, the paradigmatic core of Algol-like languages. IQu combines imperative programming with high-order features, mediated by a simple type theory. IQu mildly me
Externí odkaz:
https://doaj.org/article/ad162643f9954d44af5857502ea3934b
Publikováno v:
Journal of Computing and Information Technology, Vol 27, Iss 1, Pp 43-57 (2019)
Diagnostic tests are used to determine anomalies in complex systems such as organisms or built structures. Once a set of tests is performed, the experts interpret their results and make decisions based on them. This process is named diagnostic reason
Externí odkaz:
https://doaj.org/article/54c5f0cf506f493d8f50ea294a929ad8
Autor:
Ugo Dal Lago, Margherita Zorzi
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 176, Iss Proc. LINEARITY 2014, Pp 64-78 (2015)
Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those of a simple
Externí odkaz:
https://doaj.org/article/80f8550b045e4b30a97bb42a9e6664da
Autor:
Andrea Masini, Margherita Zorzi
Publikováno v:
Axioms, Vol 8, Iss 1, p 25 (2019)
We know that quantum logics are the most prominent logical systems associated to the lattices of closed Hilbert subspaces. However, what happen if, following a quantum computing perspective, we want to associate a logic to the process of quantum regi
Externí odkaz:
https://doaj.org/article/d47c6a1f930746b79d8dfa7e9ba1f852
Autor:
Federico Aschieri, Margherita Zorzi
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 97, Iss Proc. CL&C 2012, Pp 1-18 (2012)
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result – which shows that the Excluded Middle principle can be used to eliminate Sko
Externí odkaz:
https://doaj.org/article/89246ce3d974452597dc511fe52a1d16
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 23, Iss Proc. DICE 2010, Pp 47-62 (2010)
Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivant's result, however, is originally stated and proved only for word alg
Externí odkaz:
https://doaj.org/article/c0e509b56eba4c29947585e7443381e7
Publikováno v:
Journal of Automated Reasoning. 63:941-966
qPCF is a paradigmatic quantum programming language that extends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be duplicated and manipulated in flexible ways by means of a dependent type
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (3), pp.1-29. ⟨10.1145/3461661⟩
ACM Transactions on Computational Logic, 2021, 22 (3), pp.1-29. ⟨10.1145/3461661⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (3), pp.1-29. ⟨10.1145/3461661⟩
ACM Transactions on Computational Logic, 2021, 22 (3), pp.1-29. ⟨10.1145/3461661⟩
International audience; We extend to natural deduction the approach of Linear Nested Sequents and of 2-Sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deductio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3995d73bf5d1dcb16b6961d8f2eeaf4a
https://hal.inria.fr/hal-03342394
https://hal.inria.fr/hal-03342394
Publikováno v:
IEEE Journal of Biomedical and Health Informatics. 23:95-102
Text normalization into medical dictionaries is useful to support clinical tasks. A typical setting is pharmacovigilance (PV). The manual detection of suspected adverse drug reactions (ADRs) in narrative reports is time consuming and natural language