DE eng

Search in the Catalogues and Directories

Hits 1 – 9 of 9

1
Unsupervised Morphological Segmentation and Part-of-Speech Tagging for Low-Resource Scenarios
Eskander, Ramy. - 2021
BASE
Show details
2
Salience Estimation and Faithful Generation: Modeling Methods for Text Summarization and Generation
BASE
Show details
3
Multiplicative Linear Logic from Logic Programs and Tilings
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
Abstract: We present a non-deterministic model of computation related to Robinson’s first-order resolution. This model formalises and extends ideas sketched by Girard in his Transcendental Syntax programme. After establishing formal defini- tions and basic properties, we show its Turing-completeness by exhibiting how it naturally models logic programs as well as non-deterministic tiling constructions such as those defining the abstract tile assembly model, recently used in DNA computing. In a second part, we explain how this model of computation yields, using realisability techniques, a dynamic semantics of proofs in the multiplicative fragment of linear logic (MLL), for which we obtain full-completeness results for both MLL and MLL extended with the so-called MIX rule.
Keyword: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]; ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory; Geometry of Interaction; Linear Logic; Models of Computation; Semantics
URL: https://hal.archives-ouvertes.fr/hal-02895111
https://hal.archives-ouvertes.fr/hal-02895111v3/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02895111v3/document
BASE
Hide details
4
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
5
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
6
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
7
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
8
A Many Small Programs (MSP) Approach in a CS1 Course
Allen, Joe Michael. - : eScholarship, University of California, 2021
BASE
Show details
9
Unsupervised Morphological Segmentation and Part-of-Speech Tagging for Low-Resource Scenarios ...
Eskander, Ramy. - : Columbia University, 2021
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
9
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern