John Pollock

In concrete applications of probability, statistical investigation gives us knowledge of some probabilities, but we generally want to know many others that are not directly revealed by our data. For instance, we may know prob(P/Q) (the probability of P given Q) and prob(P/R), but what we really want is prob(P/Q& R), and we may not have the data required to assess that directly. The probability calculus is of no help here. Given prob(P/Q) and prob(P/R), it is consistent with the probability calculus for prob(P/Q& R) to have any value between 0 and 1. Is there any way to make a reasonable estimate of the value of prob(P/Q& R) 1 A related problem occurs when probability practitioners adopt undefended assumptions of statistical independence simply on the basis of not seeing any connection between two propositions. This is common practice, but its justification has eluded probability theorists, and researchers are typically apologetic about making such assumptions. Is there any way to defend the practice? This paper shows that on a certain conception of probability—nomic probability—there are principles of "probable probabilities" that license inferences of the above sort. These are principles telling us that although certain inferences from probabilities to probabilities are not deductively valid, nevertheless the second-order probability of their yielding correct results is 1. This makes it defeasibly reasonable to make the inferences. Thus I argue that it is defeasibly reasonable to assume statistical independence when we have no information to the contrary. And I show that there is a function Y(r, s, a) such that if prob(P/Q) = r, prob(P/R) = s, andprob(P/U) = a (where U is our background knowledge) then it is defeasibly reasonable to expect that prob(P/Q&R) = Y(r, s, a). Numerous other defeasible inferences are licensed by similar principles of probable probabilities. This has the potential to greatly enhance the usefulness of probabilities in practical application

In its present incarnation, OSCAR is a fully implemented programmable architecture for a rational agent. If we just focus upon the epistemic reasoning in OSCAR, we have a powerful general-purpose defeasible reasoner. The purpose of this paper is to describe that reasoner. OSCAR's defeasible reasoner is based upon seven fundamental ideas. These are (1) an argument-based account of defeasible reasoning, (2) an analysis of defeat-status given a set of interrelated arguments, (3) a general adequacy criterion for automated defeasible reasoners, called “d.e.-adequacy”, (4) the claim that a generalpurpose defeasible reasoner must have the kind of structure I have called “flag-based”, (5) an algorithm for computing defeat-status, (6) an interest-driven monotonic reasoner, and (7) an account of degrees of justification, degrees of interest, and their interactions. These will each be discussed in turn.

Practical reasoning aims at deciding what actions to perform in light of the goals a rational agent possesses. This has been a topic of interest in both philosophy and artificial intelligence, but these two disciplines have produced very different models of practical reasoning. The purpose of this paper is to examine each model in light of the other and produce a unified model adequate for the purposes of both disciplines and superior to the standard models employed by either.The philosophical (decision-theoretic) model directs activity by evaluating acts one at a time in terms of their expected utilities. It is argued that, except in certain special cases, this constitutes an inadequate theory of practical reasoning leading to intuitively incorrect action prescriptions. Acts must be viewed as parts of plans, and plans evaluated as coherent units rather than piecemenal in terms of the acts comprising them. Rationality dictates choosing acts by first choosing the plans prescribing them. Plans, in turn, are compared by looking at their expected values. However, because plans can be embedded in one another, we cannot select plans just by maximizing expected values. Instead, we must employ a more complex criterion here named coextendability.

This chapter reiterates the proposition that practical cognition should not aim at finding optimal solutions to practical problems. A rational cognizer should instead look for good solutions, and replace them with better solutions if any are found. Solutions come in the form of plans. In general, a change to the master plan may consist of deleting several local plans and adding several others. This theory is still fairly schematic. It leaves most details to the imagination of the reader, and in philosophy, that is often a recipe for disaster. When philosophical theories fail, it is not because they did not look good in the abstract—it is because it is impossible to make the details work. This chapter simply gives a preliminary sketch of how a resource bounded agent can actually perform locally global planning.

Counterexamples are constructed for classical decision theory, turning on the fact that actions must often be chosen in groups rather than individually, i.e., the objects of rational choice are plans. It is argued that there is no way to define optimality for plans that makes the finding of optimal plans the desideratum of rational decision-making. An alternative called “locally global planning” is proposed as a replacement for classical decision theory. Decision-making becomes a non-terminating process without a precise target rather than a terminating search for an optimal solution