8 papers
A dataset of rated conceptual arguments
Emery Cooper, Caspar Oesterheld, Linh Chi Nguyen +2
Large language models have improved rapidly on tasks with verifiable answers, such as mathematics and programming. Much less is known about their ability to reason about what we ca…
Inducing Causal World Models in LLMs for Zero-Shot Physical Reasoning
Aditya Sharma, Ananya Gupta, Chengyu Wang +2
Large Language Models (LLMs), despite their advanced linguistic capabilities, fundamentally lack an intuitive understanding of physical dynamics, which limits their effectiveness i…
A dataset of questions on decision-theoretic reasoning in Newcomb-like problems
Caspar Oesterheld, Emery Cooper, Miles Kodama +2
We introduce a dataset of natural-language questions in the decision theory of so-called Newcomb-like problems. Newcomb-like problems include, for instance, decision problems in wh…
Provable Methods for Searching with an Imperfect Sensor
Nilanjan Chakraborty, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell +2
Assume that a target is known to be present at an unknown point among a finite set of locations in the plane. We search for it using a mobile robot that has imperfect sensing capab…
Approximation Algorithms for Anchored Multiwatchman Routes
Joseph S. B. Mitchell, Linh Nguyen
We study some variants of the -\textsc{Watchman Routes} problem, the cooperative version of the classic \textsc{Watchman Routes} problem in a simple polygon. The watchmen may be…
Coverage Path Planning For Minimizing Expected Time to Search For an Object With Continuous Sensing
Linh Nguyen
In this paper, we present several results of both theoretical as well as practical interests. First, we propose the quota lawn mowing problem, an extension of the classic lawn mowi…
Multirobot Watchman Routes in a Simple Polygon
Joseph S. B. Mitchell, Linh Nguyen
The well-known \textsc{Watchman Route} problem seeks a shortest route in a polygonal domain from which every point of the domain can be seen. In this paper, we study the cooperativ…
Optimizing Visibility-based Search in Polygonal Domains
Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen +1
Given a geometric domain , visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within in order to be able to see a portion (or al…