English
Related papers

Related papers: An Intuitionistic Linear Logical Semantics of SAND…

200 papers

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an asynchronous and a…

Logic in Computer Science · Computer Science 2018-06-26 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

Time series classification is a task of paramount importance, as this kind of data often arises in safety-critical applications. However, it is typically tackled with black-box deep learning methods, making it hard for humans to understand…

Machine Learning · Computer Science 2025-11-07 Irene Ferfoglia , Simone Silvetti , Gaia Saveri , Laura Nenzi , Luca Bortolussi

The present study is aimed at analysing the benefits of an ontological approach in Functional Structural Plant Modelling. The ontological approach has been used at two levels, to refine the conceptual modelling approach, and to define the…

Applied Physics · Physics 2022-08-17 Giuliano Vitali

A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…

Logic in Computer Science · Computer Science 2010-08-19 Robin Adams , Zhaohui Luo

It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type…

Computation and Language · Computer Science 2024-02-14 Sergey Slavnov

Recursive neural networks (RvNN) have been shown useful for learning sentence representations and helped achieve competitive performance on several natural language inference tasks. However, recent RvNN-based models fail to learn simple…

Computation and Language · Computer Science 2021-04-13 Atul Sahay , Ayush Maheshwari , Ritesh Kumar , Ganesh Ramakrishnan , Manjesh Kumar Hanawal , Kavi Arya

The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…

Logic in Computer Science · Computer Science 2023-06-22 Joseph Boudou , Martín Diéguez , David Fernández-Duque , Philip Kremer

Syntactic language models (SLMs) enhance Transformers by incorporating syntactic biases through the modeling of linearized syntactic parse trees alongside surface sentences. This paper focuses on compositional SLMs that are based on…

Computation and Language · Computer Science 2025-07-01 Yida Zhao , Hao Xve , Xiang Hu , Kewei Tu

Although self-attention networks (SANs) have advanced the state-of-the-art on various NLP tasks, one criticism of SANs is their ability of encoding positions of input words (Shaw et al., 2018). In this work, we propose to augment SANs with…

Computation and Language · Computer Science 2019-09-04 Xing Wang , Zhaopeng Tu , Longyue Wang , Shuming Shi

Latent tree learning models represent sentences by composing their words according to an induced parse tree, all based on a downstream task. These models often outperform baselines which use (externally provided) syntax trees to drive the…

Computation and Language · Computer Science 2020-01-16 Jean Maillard , Stephen Clark

We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly…

Logic in Computer Science · Computer Science 2019-03-14 Harley Eades , Aaron Stump , Ryan McCleeary

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…

Logic in Computer Science · Computer Science 2010-06-02 Everardo Barcenas , Pierre Geneves , Nabil Layaida , Alan Schmitt

Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these…

Logic in Computer Science · Computer Science 2016-09-15 Gaëlle Fontaine , Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Loredana Sorrentino

Dynamic Topological Logic ($\mathcal{DTL}$) is a combination of $\mathcal{S}${\em 4}, under its topological interpretation, and the temporal logic $\mathcal{LTL}$ interpreted over the natural numbers. $\mathcal{DTL}$ is used to reason about…

Logic · Mathematics 2016-11-22 David Fernández-Duque

Characterisations theorems serve as important tools in model theory and can be used to assess and compare the expressive power of temporal languages used for the specification and verification of properties in formal methods. While complete…

Logic in Computer Science · Computer Science 2024-04-30 Massimo Benerecetti , Laura Bozzelli , Fabio Mogavero , Adriano Peron

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

Temporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity. LTL is equivalent in…

Logic in Computer Science · Computer Science 2025-07-16 Kevin W. Smith , Moshe Y. Vardi

An answer set is a plain set of literals which has no further structure that would explain why certain literals are part of it and why others are not. We show how argumentation theory can help to explain why a literal is or is not contained…

Artificial Intelligence · Computer Science 2020-02-19 Claudia Schulz , Francesca Toni

The approach taken by Gheorghiu, Gu and Pym in their paper on giving a Base-extension Semantics for Intuitionistic Multiplicative Linear Logic is an interesting adaptation of the work of Sandqvist for IPL to the substructural setting. What…

Logic in Computer Science · Computer Science 2025-10-16 Yll Buzoku