English
Related papers

Related papers: Some recent advances in reasoning based on analogi…

200 papers

Reciprocal transformations mix the role of the dependent and independent variables to achieve simpler versions or even linearized versions of nonlinear PDEs. These transformations help in the identification of a plethora of PDEs available…

Mathematical Physics · Physics 2016-04-08 C. Sardon

The present work investigates whether different quantification mechanisms (set comparison, vague quantification, and proportional estimation) can be jointly learned from visual scenes by a multi-task computational model. The motivation is…

Computer Vision and Pattern Recognition · Computer Science 2018-04-16 Sandro Pezzelle , Ionut-Teodor Sorodoc , Raffaella Bernardi

The purpose of this article is to motivate the study of invariant, and especially conformally invariant, differential pairings. Since a general theory is lacking, this work merely presents some interesting examples of these pairings,…

Differential Geometry · Mathematics 2008-04-25 Michael G. Eastwood

This paper develops a {\em qualitative} and logic-based notion of similarity from the ground up using only elementary concepts of first-order logic centered around the fundamental model-theoretic notion of type.

Logic in Computer Science · Computer Science 2023-05-02 Christian Antić

This paper synthesizes recent advances in the econometrics of difference-in-differences (DiD) and provides concrete recommendations for practitioners. We begin by articulating a simple set of ``canonical'' assumptions under which the…

Econometrics · Economics 2023-01-11 Jonathan Roth , Pedro H. C. Sant'Anna , Alyssa Bilinski , John Poe

A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…

Number Theory · Mathematics 2009-08-28 Michel Waldschmidt

This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of $n$ objects can be identified by standard sorting methods using $n log_2 n$ pairwise…

Machine Learning · Computer Science 2011-12-13 Kevin G. Jamieson , Robert D. Nowak

In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our…

Formal Languages and Automata Theory · Computer Science 2016-02-11 Michel Rigo

A key challenge in causal inference from observational studies is the identification and estimation of causal effects in the presence of unmeasured confounding. In this paper, we introduce a novel approach for causal inference that…

Methodology · Statistics 2022-10-17 Ying Zhou , Dingke Tang , Dehan Kong , Linbo Wang

The paper adresses the problem of reasoning with ambiguities. Semantic representations are presented that leave scope relations between quantifiers and/or other operators unspecified. Truth conditions are provided for these representations…

cmp-lg · Computer Science 2008-02-03 Uwe Reyle

It is time-consuming to find the best product among many similar alternatives. Comparative sentences can help to contrast one item from others in a way that highlights important features of an item that stand out. Given reviews of one or…

Computation and Language · Computer Science 2023-07-25 Jessica Echterhoff , An Yan , Julian McAuley

This paper is devoted to heuristic aspects of the so-called idempotent calculus. There is a correspondence between important, useful and interesting constructions and results over the field of real (or complex) numbers and similar…

General Mathematics · Mathematics 2007-05-23 Grigori Litvinov , Victor Maslov

The propositional logic is generalized on the real numbers field. the logical function with all properties of the classical probability function is obtained. The logical analog of the Bernoulli independent tests scheme is constructed. The…

General Mathematics · Mathematics 2007-05-23 G. A. Quznetsov

Alignment algorithms usually rely on simplified models of gaps for computational efficiency. Based on an isomorphism between alignments and physical helix-coil models, we show in statistical mechanics that alignments with realistic laws for…

Genomics · Quantitative Biology 2015-06-26 E. Yeramian , E. Debonneuil

When proving theorems from large sets of logical assertions, it can be helpful to restrict the search for a proof to those assertions that are relevant, that is, closely related to the theorem in some sense. For example, in the Watson…

Logic in Computer Science · Computer Science 2019-05-23 David A. Plaisted

We consider one problem that was largely left open by Rudolf Carnap in his work on inductive logic, the problem of analogical inference. After discussing some previous attempts to solve this problem, we propose a new solution that is based…

Logic in Computer Science · Computer Science 2016-06-27 Simon M. Huttegger

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

In this paper, we provide an approach to clustering relational matrices whose entries correspond to either similarities or dissimilarities between objects. Our approach is based on the value of information, a parameterized,…

Artificial Intelligence · Computer Science 2017-10-31 Isaac J. Sledge , Jose C. Principe

We show some applications of the formulas-as-polynomials correspondence: 1) a method for (dis)proving formula isomorphism and equivalence based on showing (in)equality; 2) a constructive analogue of the arithmetical hierarchy, based on the…

Logic · Mathematics 2019-05-21 Danko Ilik

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara