This paper identifies classes of problems that lend themselves to easy solutions, and develops algorithms that solve these problems optimally based on both the sparseness found in the constraint network and the simplicity of tree-structured CSPs.Expand

This paper describes a probabilistic approach to nonmonotonic reasoning which combines the principle of infinitesimal probabilities with that of maximum entropy, and which sanctions inferences similar to those produced by a defeasible knowledge base.Expand

The trade-offs between the required storage space and the validity of answers produced by probabilistic question-answering (PQA) systems are studies.Expand

The infrared investigation on Voyager uses two interferometers covering the spectral ranges 60–600 cm−1 (17–170 μm) and 1000–7000 cm−1 (1.4–10 μm), and a radiometer covering the range 8000–25 000… Expand

The Logic of Counterfactuals in Causal Inference (Discussion of `Causal Inference without Counterfactuals' by A.P. Dawid ) Cognitive Systems Laboratory Departments of Computer Science and Statistics… Expand

Many students, especially in econometrics, express frustration with the way a problem known as “bad control” is evaded, if not mishandled, in the traditional literature. The problem arises when the… Expand

This paper examines the nature of minimax distortion, quantifies its magnitude, determines the conditions when its damage is curtailed and explains why search-depth pathology is rarely observed in common games.Expand

An interactive computer program has been designed and implemented that elicits a decision tree from a decisionmaker in an English-like conversational mode.Expand