Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Inférence profonde"'
Autor:
Strassburger, Lutz
Publikováno v:
[Research Report] RR-9071, Inria Saclay Ile de France. 2017, pp.38
In this paper we introduce the notion of expansion tree for linear logic. As in Miller's original work, we have a shallow reading of an expansion tree that corresponds to the conclusion of the proof, and a deep reading which is a formula that can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::96516f6ef61514a541fe542d2e416464
https://hal.inria.fr/hal-01526831/file/RR-9071.pdf
https://hal.inria.fr/hal-01526831/file/RR-9071.pdf
Autor:
Straßburger, Lutz
Publikováno v:
[Research Report] RR-9071, Inria Saclay Ile de France. 2017, pp.38
In this paper we introduce the notion of expansion tree for linear logic. As in Miller's original work, we have a shallow reading of an expansion tree that corresponds to the conclusion of the proof, and a deep reading which is a formula that can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::96516f6ef61514a541fe542d2e416464
https://hal.inria.fr/hal-01526831/file/RR-9071.pdf
https://hal.inria.fr/hal-01526831/file/RR-9071.pdf
Autor:
Guenot, Nicolas
Cette thèse s'intéresse à l'usage des formalismes d'inférence profonde comme fondement des interprétations calculatoires des systèmes de preuve, en suivant les deux approches principales: celle des preuves comme programmes et celle de la recher
Externí odkaz:
http://pastel.archives-ouvertes.fr/pastel-00929908
http://pastel.archives-ouvertes.fr/docs/00/92/99/08/PDF/thesis.pdf
http://pastel.archives-ouvertes.fr/docs/00/92/99/08/PDF/thesis.pdf
Autor:
Guenot, Nicolas
Publikováno v:
Logic in Computer Science [cs.LO]. Ecole Polytechnique X, 2013. English
This thesis investigates the use of deep inference formalisms as basis for a computational interpretation of proof systems, following the two main approaches: proofs-as-programs and proof-search-as-computation. The first contribution is the developme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::b838a33177aee85f2a3f31783cc61c7c
https://pastel.archives-ouvertes.fr/pastel-00929908/document
https://pastel.archives-ouvertes.fr/pastel-00929908/document
Autor:
Pawlowski, Filip Igor
Publikováno v:
Distributed, Parallel, and Cluster Computing [cs.DC]. Université de Lyon, 2020. English. ⟨NNT : 2020LYSEN081⟩
In this thesis, we develop high performance algorithms for certain computations involving dense tensors and sparse matrices. We address kernel operations that are useful for machine learning tasks, such as inference with deep neural networks (DNNs).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::47f1fb6e4be52c00c187ad60d87f9bf5
https://tel.archives-ouvertes.fr/tel-03116812
https://tel.archives-ouvertes.fr/tel-03116812
Autor:
Straßburger, Lutz
Publikováno v:
[Research Report] RR-9048, Inria Saclay. 2017
This paper introduces the notion of combinatorial flows as a generalization of combinatorial proofs that also includes cut and substitution as methods of proof compression. We show a normalization procedure for combinatorial flows, and how syntactic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::972d255b13aba2a0b0aea9fbfc026168
https://hal.inria.fr/hal-01498468/document
https://hal.inria.fr/hal-01498468/document
Autor:
Strassburger, Lutz
Publikováno v:
[Research Report] RR-9048, Inria Saclay. 2017
This paper introduces the notion of combinatorial flows as a generalization of combinatorial proofs that also includes cut and substitution as methods of proof compression. We show a normalization procedure for combinatorial flows, and how syntactic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::972d255b13aba2a0b0aea9fbfc026168
https://hal.inria.fr/hal-01498468/document
https://hal.inria.fr/hal-01498468/document