English
Related papers

Related papers: Interactive Realizability, Monads and Witness Extr…

200 papers

The goal of learning from demonstrations is to learn a policy for an agent (imitator) by mimicking the behavior in the demonstrations. Prior works on learning from demonstrations assume that the demonstrations are collected by a…

Robotics · Computer Science 2021-10-29 Zhangjie Cao , Yilun Hao , Mengxi Li , Dorsa Sadigh

In this study we explore the spontaneous apparition of visible intelligible reasoning in simple artificial networks, and we connect this experimental observation with a notion of semantic information. We start with the reproduction of a DNN…

Artificial Intelligence · Computer Science 2021-08-11 Jean-Claude Belfiore , Daniel Bennequin , Xavier Giraud

Linear logic programming uses provability as the basis for computation. In the operational semantics based on provability, executing the additive-conjunctive goal $G_1 \& G_2$ from a program $P$ simply terminates with a success if both…

Logic in Computer Science · Computer Science 2015-07-02 Keehang Kwon , Mi-Young Park

The enormous amount of discourse taking place online poses challenges to the functioning of a civil and informed public sphere. Efforts to standardize online discourse data, such as ClaimReview, are making available a wealth of new data…

Social and Information Networks · Computer Science 2026-05-19 Matthew Sumpter , Giovanni Luca Ciampaglia

Imitation learning enables agents to reuse and adapt the hard-won expertise of others, offering a solution to several key challenges in learning behavior. Although it is easy to observe behavior in the real-world, the underlying actions may…

Machine Learning · Computer Science 2021-07-09 Andrew Jaegle , Yury Sulsky , Arun Ahuja , Jake Bruce , Rob Fergus , Greg Wayne

Latent reasoning models (LRMs) have attracted significant research interest due to their low inference cost (relative to explicit reasoning models) and theoretical ability to explore multiple reasoning paths in parallel. However, these…

Machine Learning · Computer Science 2026-04-07 Connor Dilgren , Sarah Wiegreffe

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

Abductive reasoning seeks the likeliest possible explanation for partial observations. Although abduction is frequently employed in human daily reasoning, it is rarely explored in computer vision literature. In this paper, we propose a new…

Computer Vision and Pattern Recognition · Computer Science 2022-03-29 Chen Liang , Wenguan Wang , Tianfei Zhou , Yi Yang

Image-text matching (ITM) is a fundamental problem in computer vision. The key issue lies in jointly learning the visual and textual representation to estimate their similarity accurately. Most existing methods focus on feature enhancement…

Computer Vision and Pattern Recognition · Computer Science 2024-06-28 Xuri Ge , Fuhai Chen , Songpei Xu , Fuxiang Tao , Jie Wang , Joemon M. Jose

Interpretability benefits the theoretical understanding of representations. Existing word embeddings are generally dense representations. Hence, the meaning of latent dimensions is difficult to interpret. This makes word embeddings like a…

Computation and Language · Computer Science 2023-06-27 Minxue Xia , Hao Zhu

In human-centric settings like education or healthcare, model accuracy and model explainability are key factors for user adoption. Towards these two goals, intrinsically interpretable deep learning models have gained popularity, focusing on…

Machine Learning · Computer Science 2025-05-29 Vinitra Swamy , Syrielle Montariol , Julian Blackwell , Jibril Frej , Martin Jaggi , Tanja Käser

In this paper we propose a new approach to realizability interpretations for nonstandard arithmetic. We deal with nonstandard analysis in the context of (semi)intuitionistic realizability, focusing on the Lightstone-Robinson construction of…

Logic in Computer Science · Computer Science 2024-02-14 Bruno Dinis , Étienne Miquey

We present a sequent calculus for abstract focussing, equipped with proof-terms: in the tradition of Zeilberger's work, logical connectives and their introduction rules are left as a parameter of the system, which collapses the synchronous…

Logic in Computer Science · Computer Science 2015-11-16 Stéphane Graham-Lengrand

Large language models (LLMs) can generate long-form and coherent text, yet they often hallucinate facts, which undermines their reliability. To mitigate this issue, inference-time methods steer LLM representations toward the "truthful…

Computation and Language · Computer Science 2024-06-10 Farima Fatahi Bayat , Xin Liu , H. V. Jagadish , Lu Wang

We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…

Logic in Computer Science · Computer Science 2013-07-16 Alexis Bernadet , Stéphane Graham-Lengrand

Outside-knowledge visual question answering is a challenging task that requires both the acquisition and the use of open-ended real-world knowledge. Some existing solutions draw external knowledge into the cross-modality space which…

Computer Vision and Pattern Recognition · Computer Science 2023-05-12 Qingyi Si , Yuchen Mo , Zheng Lin , Huishan Ji , Weiping Wang

Neurosymbolic AI combines the interpretability, parsimony, and explicit reasoning of classical symbolic approaches with the statistical learning of data-driven neural approaches. Models and policies that are simultaneously differentiable…

Artificial Intelligence · Computer Science 2024-02-09 Peter Graf , Patrick Emami

We show how the language of Krivine's classical realizability may be used to specify various forms of nondeterminism and relate them with properties of realizability models. More specifically, we introduce an abstract notion of…

Logic in Computer Science · Computer Science 2018-06-22 Guillaume Geoffroy

Applying imitation learning (IL) is challenging to nonprehensile manipulation tasks of invisible objects with partial observations, such as excavating buried rocks. The demonstrator must make such complex action decisions as exploring to…

Robotics · Computer Science 2025-03-24 Hirotaka Tahara , Takamitsu Matsubara

In recent years the effectiveness of interactive theorem provers has increased to an extent that the bottleneck in the interactive process shifted to efficiency: while in principle large and complex theorems are provable (effectiveness), it…

Logic in Computer Science · Computer Science 2014-10-31 Bernhard Beckert , Sarah Grebing , Florian Böhl