相关论文: On the Tweety Penguin Triangle Problem

BPS, the Bayesian Problem Solver, applies probabilistic inference and decision-theoretic control to flexible, resource-constrained problem-solving. This paper focuses on the Bayesian inference mechanism in BPS, and contrasts it with those…

The POPLMARK Challenge comprises a set of problems intended to measure the strength of reasoning systems in the realm of mechanizing programming language meta-theory at the time the challenge was enunciated. Included in the collection is…

Given a semisimple Lie algebra $\mathfrak{g}$, we can represent invariants of tensor products of fundamental representations of the quantum enveloping algebra $U_q(\mathfrak{g})$ using particular directed graphs called webs. In particular…

A Turmit is a Turing machine that works over a two-dimensional grid, that is, an agent that moves, reads and writes symbols over the cells of the grid. Its state is an arrow and, depending on the symbol that it reads, it turns to the left…

We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relation to the famous 4/3 conjecture for metric TSP, which says…

We extend the flyping theorem to alternating links in thickened surfaces and alternating virtual links. The proof of the former result uses work of Boden--Karimi to adapt the author's geometric proof of Tait's 1898 flyping conjecture (first…

We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…

In this paper we study geometric versions of Burnside's Problem and the von Neumann Conjecture. This is done by considering the notion of a translation-like action. Translation-like actions were introduced by Kevin Whyte as a geometric…

We revisit the traveling salesman problem with neighborhoods (TSPN) and propose several new approximation algorithms. These constitute either first approximations (for hyperplanes, lines, and balls in $\mathbb{R}^d$, for $d\geq 3$) or…

We treat random rank-$D$ tensor models as $D$-dimensional quantum field theories---tensor field theories (TFT)---and review some of their non-perturbative methods. We classify the correlation functions of complex tensor field theories by…

We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable previous attention: Given a set $P$ of $n$ points in the…

This paper studies the computational complexity of disambiguation under probabilistic tree-grammars and context-free grammars. It presents a proof that the following problems are NP-hard: computing the Most Probable Parse (MPP) from a…

The orbital boundary value problem, also known as Lambert Problem, is revisited. Building upon Lancaster and Blanchard approach, new relations are revealed and a new variable representing all problem classes, under L-similarity, is used to…

This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning the growth rate of an associated function. In our view,…

A mechanism explaining a strong enhancement of nonleptonic weak decays was suggested in 1975, later to be dubbed the penguin. This mechanism extends Wilson's ideas about the operator product expansion at short distances and reveals an…

In this paper, we first formalize the problem to be solved, i.e., the Scatter Problem (SP). We then show that SP cannot be deterministically solved. Next, we propose a randomized algorithm for this problem. The proposed solution is…

Dempster-Shafer Theory (DST) generalizes Bayesian probability theory, offering useful additional information, but suffers from a high computational burden. A lot of work has been done to reduce the complexity of computations used in…

We propose an inequality paradigm for probabilistic reasoning based on a logic of upper and lower bounds on conditional probabilities. We investigate a family of probabilistic logics, generalizing the work of Nilsson [14]. We develop a…

We prove Tur\'an-type theorems for two related Ramsey problems raised by Bollob\'as and by Fox and Sudakov. First, for $t \ge 3$, we show that any two-colouring of the complete graph on $n$ vertices that is $\delta$-far from being…

Triggered by a recent interesting New Scientist article on the too frequent incorrect use of probabilistic evidence in courts, I introduce the basic concepts of probabilistic inference with a toy model, and discuss several important issues…