English
Related papers

Related papers: On the Herbrand Functional Interpretation

200 papers

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…

Logic · Mathematics 2020-08-19 Eveline Lehmann , Thomas Studer

We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…

Logic · Mathematics 2021-12-02 Philipp G. Haselwarter , Andrej Bauer

We discuss the Dempster-Shafer theory of evidence. We introduce a concept of monotonicity which is related to the diminution of the range between belief and plausibility. We show that the accumulation of knowledge in this framework exhibits…

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

Interpretability is an elusive but highly sought-after characteristic of modern machine learning methods. Recent work has focused on interpretability via $\textit{explanations}$, which justify individual model predictions. In this work, we…

Machine Learning · Computer Science 2019-10-31 David Alvarez-Melis , Hal Daumé , Jennifer Wortman Vaughan , Hanna Wallach

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

Category Theory · Mathematics 2015-07-22 Martin Hyland

Concept-based interpretability methods aim to explain deep neural network model predictions using a predefined set of semantic concepts. These methods evaluate a trained model on a new, "probe" dataset and correlate model predictions with…

Computer Vision and Pattern Recognition · Computer Science 2023-05-15 Vikram V. Ramaswamy , Sunnie S. Y. Kim , Ruth Fong , Olga Russakovsky

Natural language contexts display logical regularities with respect to substitutions of related concepts: these are captured in a functional order-theoretic property called monotonicity. For a certain class of NLI problems where the…

Computation and Language · Computer Science 2021-05-18 Julia Rozanova , Deborah Ferreira , Mokanarangan Thayaparan , Marco Valentino , André Freitas

The interpretative principle proposed by Bub in 1211.3062v1 [quant-ph] is justified only for all practical purposes (Bell's "FAPP trap"). An alternative interpretative principle is proposed. It brings to light those features of the quantum…

Quantum Physics · Physics 2012-12-18 Ulrich Mohrhoff

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Machine Learning · Computer Science 2020-01-16 Lior Wolf , Tomer Galanti , Tamir Hazan

The paper discusses the role of interpretations, understood as multifunctions that preserve and reflect logical consequence, as refinement witnesses in the general setting of pi-institutions. This leads to a smooth generalization of the…

Logic in Computer Science · Computer Science 2019-08-15 César Rodrigues , Manuel A. Martins , Alexandre Madeira , Luis S. Barbosa

The paper presents a constraint based semantic formalism for HPSG. The advantages of the formlism are shown with respect to a grammar for a fragment of German that deals with (i) quantifier scope ambiguities triggered by scrambling and/or…

cmp-lg · Computer Science 2008-02-03 A. Frank , U. Reyle

How interpretable are the features of leading vision models? The question is increasingly pressing as these models move from research benchmarks into high-stakes deployments, yet existing methods cannot answer it reliably. We close this gap…

Computer Vision and Pattern Recognition · Computer Science 2026-05-21 Julien Colin , Lore Goetschalckx , Nuria Oliver , Thomas Serre

The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…

Artificial Intelligence · Computer Science 2013-02-08 Henry E. Kyburg

Time series interpretation aims to provide an explanation of what is observed in terms of its underlying processes. The present work is based on the assumption that the common classification-based approaches to time series interpretation…

Artificial Intelligence · Computer Science 2021-12-09 Tomás Teijeiro , Paulo Félix

We present a bounded modified realisability and a bounded functional interpretation of intuitionistic nonstandard arithmetic with nonstandard principles. The functional interpretation is the intuitionistic counterpart of Ferreira and…

Logic · Mathematics 2017-12-14 Bruno Dinis , Jaime Gaspar

We present a universal framework to model contextualized sentence representations with visual awareness that is motivated to overcome the shortcomings of the multimodal parallel data with manual annotations. For each sentence, we first…

Computation and Language · Computer Science 2019-11-12 Zhuosheng Zhang , Rui Wang , Kehai Chen , Masao Utiyama , Eiichiro Sumita , Hai Zhao

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

In contrast to the robust mutual interpretability phenomenon in set theory, Ali Enayat proved that bi-interpretation is absent: distinct theories extending ZF are never bi-interpretable and models of ZF are bi-interpretable only when they…

Logic · Mathematics 2020-08-05 Alfredo Roque Freire , Joel David Hamkins

Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…

Artificial Intelligence · Computer Science 2013-04-11 Yizong Cheng , Rangasami L. Kashyap

We survey the different properties of an intuitive notion of redundancy, as a function of the precise semantics given to the notion of partial implication. The final version of this survey will appear in the Proceedings of the Int. Conf.…

Logic in Computer Science · Computer Science 2015-04-15 José L. Balcázar