Axiomatizing Causal Reasoning
| dc.creator | Halpern, Joseph Y. | |
| dc.date | 2000-05-30 | |
| dc.date.accessioned | 2026-07-07T03:16:15Z | |
| dc.date.available | 2026-07-07T03:16:15Z | |
| dc.description | Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of causal models: (1) the class of recursive theories (those without feedback), (2) the class of theories where the solutions to the equations are unique, (3) arbitrary theories (where the equations may not have solutions and, if they do, they are not necessarily unique). It is shown that to reason about causality in the most general third class, we must extend the language used by Galles and Pearl. In addition, the complexity of the decision procedures is characterized for all the languages and classes of models considered. | |
| dc.description | An earlier version of this paper appeared in UAI '98 | |
| dc.identifier | https://arxiv.org/abs/cs/0005030 | |
| dc.identifier | http://arxiv.org/abs/cs/0005030 | |
| dc.identifier | Journal of AI Research, Vol. 12, 2000, pp. 317--337 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30278 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | I.2.4; F.4.1 | |
| dc.title | Axiomatizing Causal Reasoning | |
| dc.type | text |