English
Related papers

Related papers: Intuition, iteration, induction

200 papers

Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…

Artificial Intelligence · Computer Science 2017-04-05 David Billington

We discuss data representation which can be learned automatically from data, are invariant to transformations, and at the same time selective, in the sense that two points have the same representation only if they are one the transformation…

Machine Learning · Computer Science 2015-03-23 Fabio Anselmi , Lorenzo Rosasco , Tomaso Poggio

Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…

Logic · Mathematics 2025-11-11 Gilda Ferreira , Paulo Oliva , Clarence Lewis Protin

Human communication is based on a variety of inferences that we draw from sentences, often going beyond what is literally said. While there is wide agreement on the basic distinction between entailment, implicature, and presupposition, the…

Computation and Language · Computer Science 2024-05-10 Polina Tsvilodub , Paul Marty , Sonia Ramotowska , Jacopo Romoli , Michael Franke

In this paper we formulate the problem of inference under incomplete information in very general terms. This includes modelling the process responsible for the incompleteness, which we call the incompleteness process. We allow the process…

Artificial Intelligence · Computer Science 2014-01-16 Marco Zaffalon , Enrique Miranda

This paper examines some methods and ideas underlying the author's successful probabilistic learning systems(PLS), which have proven uniquely effective and efficient in generalization learning or induction. While the emerging principles are…

Artificial Intelligence · Computer Science 2013-04-15 Larry Rendell

The aim of this paper is i) to argue for the feasibility and fruitfulness of a balance between the phenomenological method seeking intuitive evidence and the axiomatic-deductive method and ii) that there should be a mutual understanding…

History and Overview · Mathematics 2024-10-29 Clarence Protin

The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…

General Literature · Computer Science 2016-02-26 Gary R. Prok

The world of mathematics is often considered abstract, with its symbols, concepts, and topics appearing unrelated to physical objects. However, it is important to recognize that the development of mathematics is fundamentally influenced by…

General Physics · Physics 2023-06-08 Biao Wu

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

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2009-09-30 Alwen Tiu , Alberto Momigliano

There is a common belief that humans and many animals follow transitive inference (choosing A over C on the basis of knowing that A is better than B and B is better than C). Transitivity seems to be the essence of rational choice. We…

Computer Science and Game Theory · Computer Science 2014-09-23 Marcin Makowski , Edward W. Piotrowski

Wittgenstein's paradoxical theses that unproved propositions are meaningless, proofs form new concepts and rules, and contradictions are of limited concern, led to a variety of interpretations, most of them centered on the rule-following…

History and Overview · Mathematics 2022-06-24 Sergiy Koshkin

A substantial school in the philosophy of science identifies Bayesian inference with inductive inference and even rationality as such, and seems to be strengthened by the rise and practical success of Bayesian statistics. We argue that the…

Statistics Theory · Mathematics 2013-02-21 Andrew Gelman , Cosma Rohilla Shalizi

There are many ways we can not know. Even in systems that we created ourselves, as, for example, systems in mathematical logic, Go\"edel and Tarski's theorems impose limits on what we can know. As we try to speak of the real world, things…

History and Philosophy of Physics · Physics 2020-06-04 André C. R. Martins

In this work, we argue that ignorance can be inherently understood as a hyperintensional notion. When faced with two logically or necessarily equivalent propositions, an agent may be ignorant of one while not of the other. To capture…

Logic · Mathematics 2026-03-11 Ekaterina Kubyshkina , Mattia Petrolo

What is information? Is it physical? We argue that in a Bayesian theory the notion of information must be defined in terms of its effects on the beliefs of rational agents. Information is whatever constrains rational beliefs and therefore…

Data Analysis, Statistics and Probability · Physics 2016-09-08 Ariel Caticha

Iterative imputation is a popular tool to accommodate missing data. While it is widely accepted that valid inferences can be obtained with this technique, these inferences all rely on algorithmic convergence. There is no consensus on how to…

Computation · Statistics 2021-10-25 Hanne Ida Oberman , Stef van Buuren , Gerko Vink

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

Formal Languages and Automata Theory · Computer Science 2025-10-22 Daniel G. Schwartz