English
Related papers

Related papers: Modal Functional (Dialectica) Interpretation

200 papers

Several tasks in artificial intelligence require to be able to find models about knowledge dynamics. They include belief revision, fusion and belief merging, and abduction. In this paper we exploit the algebraic framework of mathematical…

Artificial Intelligence · Computer Science 2018-02-15 Isabelle Bloch , Jérôme Lang , Ramón Pino Pérez , Carlos Uzcátegui

In this paper, we introduce a novel interpreting framework that learns an interpretable model based on an ontology-based sampling technique to explain agnostic prediction models. Different from existing approaches, our algorithm considers…

Machine Learning · Computer Science 2020-04-02 Phung Lai , NhatHai Phan , Han Hu , Anuja Badeti , David Newman , Dejing Dou

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive…

Logic in Computer Science · Computer Science 2023-07-12 Peter Hawke

In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a…

Logic · Mathematics 2024-05-14 Wesley H. Holliday

A converter from first-order modal logics to classical higher- order logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within first- order modal logics. The…

Logic in Computer Science · Computer Science 2012-07-31 Christoph Benzmueller , Thomas Raths

We consider the problem of modularizing control flow in a generic abstract interpretation framework. A generic abstract interpretation framework is not truly flexible if it does not allow interpreting with different path- and…

Programming Languages · Computer Science 2026-02-19 Cade Lueker , Andrew Fox , Bor-Yuh Evan Chang

This paper investigates the extension of lattice-based logics into modal languages. We observe that such extensions admit multiple approaches, as the interpretation of the necessity operator is not uniquely determined by the underlying…

Logic in Computer Science · Computer Science 2025-10-01 Alfredo R. Freire , Manuel A. Martins

We introduce the operation of possibility qualification and show how. this modal-like operator can be used to represent "typical" or default knowledge in a theory of nonmonotonic reasoning. We investigate the representational power of this…

Artificial Intelligence · Computer Science 2013-04-10 Ronald R. Yager

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…

Logic in Computer Science · Computer Science 2015-03-19 Nikolay Ivanov , Dimiter Vakarelov

We investigate algebraic and topological semantics of the modal logic S4CI and obtain strong completeness of the given system in the case of local semantic consequence relations. In addition, we consider an extension of the logic S4CI with…

Logic · Mathematics 2024-06-04 Daniyar Shamkanov

In this paper we study the category of graded modules for the current algebra associated to $\mathfrak{sl}_2$. The category enjoys many nice properties, including a tilting theory which was established in previous work of the authors. We…

Representation Theory · Mathematics 2015-04-02 Matthew Bennett , Vyjayanthi Chari

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

We show that the unification problem `is there a substitution instance of a given formula that is provable in a given logic?' is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the…

Logic in Computer Science · Computer Science 2007-05-23 Frank Wolter , Michael Zakharyaschev

We show canonicity and normalization for dependent type theory with a cumulative sequence of universes and a type of Boolean. The argument follows the usual notion of reducibility, going back to Godel's Dialectica interpretation and the…

Programming Languages · Computer Science 2018-10-23 Thierry Coquand

In this article we discuss the contextual character of quantum mechanics in the framework of modal interpretations. We investigate its historical origin and relate contemporary modal interpretations to those proposed by M. Born and W.…

Quantum Physics · Physics 2007-05-23 Graciela Domenech , Hector Freytes , Christian de Ronde

During many years since the birth of quantum mechanics, instrumentalist interpretations prevailed: the meaning of the theory was expressed in terms of measurements results. But in the last decades, several attempts to interpret it from a…

Quantum Physics · Physics 2016-03-15 Olimpia Lombardi , Sebastian Fortin , Cristian Lopez

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

It is well known that most constructive and predicative foundations aiming to develop Bishop's constructive analysis are incompatible with a classical predicative development of analysis as put forward by Weyl in his $\textit{Das…

Logic · Mathematics 2025-12-05 Michele Contente , Maria Emilia Maietti

There are two main lines of research on visual question answering (VQA): compositional model with explicit multi-hop reasoning, and monolithic network with implicit reasoning in the latent feature space. The former excels in…

Computer Vision and Pattern Recognition · Computer Science 2020-10-13 Ruixue Tang , Chao Ma
‹ Prev 1 8 9 10 Next ›