When you lose a game of chess to a computer then don't pretend that you didn't think at the game.

Bayesian inference nets 190 algorithms, structure-moving task 209-17 Kononenko's treatment 201-2 ALG(SIG, E) 50

In this paper we will be concerned with such reasoning in its most general form, that is, in inferences that are defeasible: given more information, we may retract them. The purpose of this paper is to introduce a form of non-monotonic inference based on the notion of a partial model of the world. We take partial models to reflect our partial knowledge of the true state of affairs. We then define non-monotonic inference as the process of filling in unknown parts of the model with conjectures: statements that could turn out to be false, given more complete knowledge. To take a standard example from default reasoning: since most birds can fly, if Tweety is a bird it is reasonable to assume that she can fly, at least in the absence of any information to the contrary. We thus have some justification for filling in our partial picture of the world with this conjecture. If our knowledge includes the fact that Tweety is an ostrich, then no such justification exists, and the conjecture must be retracted.

This paper describes some work on automatically generating finite counterexamples in topology, and the use of counterexamples to speed up proof discovery in intermediate analysis, and gives some examples theorems where human provers are aided in proof discovery by the use of examples.

K.A.PATON 411 24 Centromere finding: some shape descriptors for small chromosome outlines.

General problems in analyzing information in a probabilistic database are considered.

Arguments are presented in favor of the answer "yes". The intuitive appeal (or lack thereof) of probabilities is considered briefly. The theoretical adequacies of probabilistic methods are investigated by considering them in light of McCarthy's "typology of uses of non-monotonic reasoning." A quantitative approach which overcomes the usual need for a priori probabilities is presented. Some of the practical advantages of using probabilities in a production system are described.

Although informal models of evidential reasoning have been successfully app'ied in automated reasoning systems, it is generally difficult to define the range of their applicability In addition, they hay., not provided a basis for coherent management of evidence bearing on hypotheses that are related hierarchically. The Dempster-Shafer (D-S) theory of evidence is appealing because it does suggest a coherent approach for dealing with such relationships However, the theory's complexity and potential for computational inefficiency have tended to discourage its use in reasoning systems In this paper we describe the central elements of the D-S theory, basing our exposition on simple examples drawn from the field of medicine. We then demonstrate the relevance of the 0-S theory to a familiar expert system domain, namely the bacterial organism identification problem that lies at the heart of the MYCIN system. Finally, we present a new adaptation of the D-S approach that achieves computational efficiency while permitting the management of evidential reasoning.within

The ideas themselves have been implemented on Stanford's SAIL system.

These paradigms include 1) clinical algorithms, 2) statistical analysis of collections of patient data, 3) mathematical models of physical processes, 4) decision analysis.