English
Related papers

Related papers: The hardest logic puzzle ever becomes even tougher

200 papers

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Computational Complexity · Computer Science 2010-09-13 Michael Thomas , Heribert Vollmer

Large language models (LLMs) have demonstrated potential in reasoning tasks, but their performance on linguistics puzzles remains consistently poor. These puzzles, often derived from Linguistics Olympiad (LO) contests, provide a minimal…

Finding the most probable explanation for observed variables in a Bayesian network is a notoriously intractable problem, particularly if there are hidden variables in the network. In this paper we examine the complexity of a related…

Computational Complexity · Computer Science 2018-12-12 Johan Kwisthout

What is the largest number accessible to the human imagination? The question is neither entirely mathematical nor entirely philosophical. Mathematical formulations of the problem fall into two classes: those that fail to fully capture the…

Logic · Mathematics 2022-11-10 David Simmons

The Monty Hall puzzle has been solved and dissected in many ways, but always using probabilistic arguments, so it is considered a probability puzzle. In this paper the puzzle is set up as an orthodox statistical problem involving an unknown…

Other Statistics · Statistics 2020-10-07 Yudi Pawitan

Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore 1985 for modeling an ideally rational agent's behavior and reasoning…

Logic in Computer Science · Computer Science 2010-06-02 Nadia Creignou , Arne Meier , Michael Thomas , Heribert Vollmer

A rigorous, modern version of Boole's algebra of logic is presented, based partly on the 1890s treatment of Ernst Schroder.

Logic · Mathematics 2014-04-04 Stanley Burris , H. P. Sankappanavar

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

The unification of logic and probability is a long-standing concern in AI, and more generally, in the philosophy of science. In essence, logic provides an easy way to specify properties that must hold in every possible world, and…

Artificial Intelligence · Computer Science 2020-06-18 Vaishak Belle

Teaching logic effectively requires an understanding of the factors which cause logic students to struggle. Formalization exercises, which require the student to produce a formula corresponding to the natural language sentence, are a good…

Logic in Computer Science · Computer Science 2022-04-27 Alexandra Mayn , Kees van Deemter

Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L, is the logic PL that is defined by adding non-nested probabilistic operators in the language of L. For example in PL we can express a…

Logic in Computer Science · Computer Science 2019-02-12 Ioannis Kokkinis

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…

Logic in Computer Science · Computer Science 2024-04-19 Ian Pratt-Hartmann

Classes of linguistic paradoxes and linguistic tautologies are introduced with examples and explanations. They are part of the author's work on the Paradoxist Philosophy based on mathematical logic. The general cases exposed below are…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

Boolos's proof of incompleteness is extended straightforwardly to yield simple ``diagonalization-free'' proofs of some classical limitative theorems of logic.

Logic · Mathematics 2007-05-23 Gyorgy Sereny

While previous researchers have performed an exhaustive search to determine an optimal Wordle strategy, that computation is very time consuming and produced a strategy using words that are unfamiliar to most people. With Wordle solutions…

Information Theory · Computer Science 2026-02-13 Ronald I. Greenberg

In this piece, we examine one variant of the infamous 15 Tile Puzzle and develop a mathematical backing behind why it is unsolvable. Using concepts of permutations, bijectivity, and cycle transpositions, we not only prove how to model this…

History and Overview · Mathematics 2022-01-04 Viren Khandal

Moores Paradox is a test case for any formal theory of belief. In Knowledge and Belief, Hintikka developed a multimodal logic for statements that express sentences containing the epistemic notions of knowledge and belief. His account…

Logic in Computer Science · Computer Science 2020-06-23 Andrés Páez

I'll discuss how Goedel's paradox "This statement is false/unprovable" yields his famous result on the limits of axiomatic reasoning. I'll contrast that with my work, which is based on the paradox of "The first uninteresting positive whole…

History and Overview · Mathematics 2007-05-23 G. J. Chaitin

In this essay I will consider a sequence of questions. The first questions concern the biological function of intelligence in general, and cognitive prostheses of human intelligence in particular. These will lead into questions concerning…

History and Philosophy of Physics · Physics 2024-03-19 David H. Wolpert

Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in…

Artificial Intelligence · Computer Science 2016-08-30 Van Hung Le