Results 1 to 10 of about 2,494 (57)

A proof-theoretic approach to scope ambiguity in compositional vector space models

open access: yesJournal of Language Modelling, 2019
We investigate the extent to which compositional vector space models can be used to account for scope ambiguity in quantified sentences (of the form Every man loves some woman).
Gijs Wijnholds
doaj   +3 more sources

Relational Models for the Lambek Calculus with Intersection and Constants [PDF]

open access: yesLogical Methods in Computer Science, 2023
We consider relational semantics (R-models) for the Lambek calculus extended with intersection and explicit constants for zero and unit. For its variant without constants and a restriction which disallows empty antecedents, Andreka and Mikulas (1994 ...
Stepan L. Kuznetsov
doaj   +1 more source

Command injection attacks, continuations, and the Lambek calculus [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
This paper shows connections between command injection attacks, continuations, and the Lambek calculus: certain command injections, such as the tautology attack on SQL, are shown to be a form of control effect that can be typed using the Lambek calculus,
Hayo Thielecke
doaj   +1 more source

Residuated Basic Logic

open access: yesAxioms, 2023
Residuated basic logic (RBL) is the logic of residuated basic algebras, which constitutes a conservative extension of basic propositional logic (BPL). The basic implication is a residual of a non-associative binary operator in RBL.
Zhe Lin, Minghui Ma
doaj   +1 more source

On the Lambek Calculus with an Exchange Modality [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2019
In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule.
Jiaming Jiang   +2 more
doaj   +1 more source

One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity

open access: yesBulletin of the Section of Logic, 2021
Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj   +1 more source

Serial verb constructions and covert coordinations in Edo – an analysis in Type Logical Grammar

open access: yesJournal of Language Modelling, 2021
Based on both syntactic and semantic criteria, Stewart (2001) and, following him, Baker and Stewart (1999), distinguish two types of serial verb constructions (SVC) and one type of covert coordination (CC) in Edo.
Ralf Naumann, Thomas Gamerschlag
doaj   +1 more source

Multiplicative-Additive Focusing for Parsing as Deduction [PDF]

open access: yes, 2015
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing.
Morrill, Glyn, Valentín, Oriol
core   +7 more sources

Classical Copying versus Quantum Entanglement in Natural Language: The Case of VP-ellipsis [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
This paper compares classical copying and quantum entanglement in natural language by considering the case of verb phrase (VP) ellipsis. VP ellipsis is a non-linear linguistic phenomenon that requires the reuse of resources, making it the ideal test case
Gijs Wijnholds, Mehrnoosh Sadrzadeh
doaj   +1 more source

Combining logical and distributional methods in type-logical grammars

open access: yesJournal of Language Modelling, 2019
We propose a low-level way of combining distributional and logical ideas into a single formal system. This will be an instantiation of a more general system, adding weights to proof rules. These weights will not measure some sort of "confidence the proof
Richard Moot
doaj   +1 more source

Home - About - Disclaimer - Privacy