UCLA Cognitive Systems Laboratory, Technical Report (R-321), June 2005. In Proceedings of International Joint Conference on Artificial Intelligen ce, Edinburgh, Scotland, August 2005.
Department of Computer Science, University of California, Los Angeles, Los Angeles, CA 90095, USA judea{at}cs.ucla.edu' + u + '@' + d + ''//--> We propose a new definition of actual causes, using structural equations to model counterfactuals. We show that the definition yields a plausible and elegant account of causation that handles well examples which have caused problems for other definitions and resolves major difficulties in the traditional account. Introduction Causal models: a review 2.1 Causal models 2.2 Syntax and semantics (...) The definition of cause Examples A more refined definition Discussion AAppendix: Some Technical Issues A.1 The active causal process A.2 A closer look at AC2(b) A.3 Causality with infinitely many variables A.4 Causality in nonrecursive models. (shrink)
Causality offers the first comprehensive coverage of causal analysis in many sciences, including recent advances using graphical methods. Pearl presents a unified account of the probabilistic, manipulative, counterfactual and structural approaches to causation, and devises simple mathematical tools for analyzing the relationships between causal connections, statistical associations, actions and observations. The book will open the way for including causal analysis in the standard curriculum of statistics, artificial intelligence, business, epidemiology, social science and economics.
According to common judicial standard, judgment in favor ofplaintiff should be made if and only if it is more probable than not thatthe defendant''s action was the cause for the plaintiff''s damage (or death). This paper provides formal semantics, based on structural models ofcounterfactuals, for the probability that event x was a necessary orsufficient cause (or both) of another event y. The paper then explicates conditions under which the probability of necessary (or sufficient)causation can be learned from statistical data, and (...) shows how data fromboth experimental and nonexperimental studies can be combined to yieldinformation that neither study alone can provide. Finally, we show thatnecessity and sufficiency are two independent aspects of causation, andthat both should be invoked in the construction of causal explanations for specific scenarios. (shrink)
This paper studies the causal interpretation of counterfactual sentences using a modifiable structural equation model. It is shown that two properties of counterfactuals, namely, composition and effectiveness, are sound and complete relative to this interpretation, when recursive (i.e., feedback-less) models are considered. Composition and effectiveness also hold in Lewis's closest-world semantics, which implies that for recursive models the causal interpretation imposes no restrictions beyond those embodied in Lewis's framework. A third property, called reversibility, holds in nonrecursive causal models but not (...) in Lewis's closest-world semantics, which implies that Lewis's axioms do not capture some properties of systems with feedback. Causal inferences based on counterfactual analysis are exemplified and compared to those based on graphical models. (shrink)
We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...) belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)
This paper presents a formalism that combines useful properties of both logic and probabilities. Like logic, the formalism admits qualitative sentences and provides symbolic machinery for deriving deductively closed beliefs and, like probability, it permits us to express if-then rules with different levels of firmness and to retract beliefs in response to changing observations. Rules are interpreted as order-of-magnitude approximations of conditional probabilities which impose constraints over the rankings of worlds. Inferences are supported by a unique priority ordering on rules (...) which is syntactically derived from the knowledge base. This ordering accounts for rule interactions, respects specificity considerations and facilitates the construction of coherent states of beliefs. Practical algorithms are developed and analyzed for testing consistency, computing rule ordering, and answering queries. Imprecise observations are incorporated using qualitative versions of Jeffrey's rule and Bayesian updating, with the result that coherent belief revision is embodied naturally and tractably. Finally, causal rules are interpreted as imposing Markovian conditions that further constrain world rankings to reflect the modularity of causal organizations. These constraints are shown to facilitate reasoning about causal projections, explanations, actions and change. (shrink)