| 1 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Unsupervised Morphological Segmentation and Part-of-Speech Tagging for Low-Resource Scenarios
|
|
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Salience Estimation and Faithful Generation: Modeling Methods for Text Summarization and Generation
|
|
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Multiplicative Linear Logic from Logic Programs and Tilings
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
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
|
|
|
| 6 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
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
|
|
|
| 8 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Unsupervised Morphological Segmentation and Part-of-Speech Tagging for Low-Resource Scenarios ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 11 |
History of Logo
|
|
|
|
In: Proceedings of the ACM on Programming Languages, vol 4, iss HOPL (2020)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Preventing Summer Reading Slide: Examining the Effects of Two Computer-Assisted Reading Programs
|
|
|
|
In: ETSU Faculty Works (2020)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
A call for cautious interpretation of meta-analytic reviews
|
|
|
|
In: Education Publications (2020)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Mechanized metatheory revisited
|
|
|
|
In: ISSN: 0168-7433 ; EISSN: 1573-0670 ; Journal of Automated Reasoning ; https://hal.inria.fr/hal-01884210 ; Journal of Automated Reasoning, Springer Verlag, 2019, 63 (3), pp.625-665. ⟨10.1007/s10817-018-9483-3⟩ (2019)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Decidable XPath Fragments in the Real World
|
|
|
|
In: 38th ACM Symposium on Principles of Database Systems (PODS'19) ; https://hal.inria.fr/hal-01852475 ; 38th ACM Symposium on Principles of Database Systems (PODS'19), 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩ (2019)
|
|
Abstract:
International audience ; XPath is arguably the most popular query language for selecting elements in XML documents. Besides query evaluation, query satisfiability and containment are the main computational problems for XPath; they are useful, for instance, to detect dead code or validate query optimisations. These problems are undecidable in general, but several fragments have been identified over time for which satisfiability (or query containment) is decidable: CoreXPath 1.0 and 2.0 without so-called data joins, fragments with data joins but limited navigation, etc. However, these fragments are often given in a simplified syntax, and sometimes wrt. a simplified XPath semantics. Moreover, they have been studied mostly with theoretical motivations, with little consideration for the practically relevant features of XPath.To investigate the practical impact of these theoretical fragments, we design a benchmark compiling thousands of real-world XPath queries extracted from open-source projects. These queries are then matched against syntactic fragments from the literature. We investigate how to extend these fragments with seldom-considered features such as free variables, data tests, data joins, and the last() and id() functions, for which we provide both undecidability and decidability results. We analyse the coverage of the original and extended fragments, and further provide a glimpse at which other practically-motivated features might be worth investigating in the future.
|
|
Keyword:
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]; [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.5: Modal logic; ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages/H.2.3.3: Query languages; Satisfiability; XPath
|
|
URL: https://hal.inria.fr/hal-01852475
https://hal.inria.fr/hal-01852475/file/main.pdf
https://doi.org/10.1145/3294052.3319685
https://hal.inria.fr/hal-01852475/document
|
|
BASE
|
|
Hide details
|
|
|
| 16 |
Primärprozess in der Katathym Imaginativen Psychotherapie unter dem Einfluss psychotroper Substanzen ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 17 |
The Manifesto Corpus: a new resource for research on political parties and quantitative text analysis
|
|
|
|
In: Research and Politics ; 3 ; 2 ; 1-8 (2019)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
A sequent calculus with dependent types for classical arithmetic
|
|
|
|
In: LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.inria.fr/hal-01703526 ; LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.720-729, ⟨10.1145/3209108.3209199⟩ (2018)
|
|
BASE
|
|
Show details
|
|
|
| 19 |
NgramPOS: A Bigram-based Linguistic and Statistical Feature Process Model for Unstructured Text Classification
|
|
|
|
BASE
|
|
Show details
|
|
|
| 20 |
ПРОФЕССИОНАЛЬНО-ОРИЕНТИРОВАННОЕ ОБУЧЕНИЕ ИНОСТРАННОМУ ЯЗЫКУ МАГИСТРАНТОВ ТЕХНИЧЕСКИХ СПЕЦИАЛЬНОСТЕЙ
|
|
|
|
BASE
|
|
Show details
|
|
|
|
|
