2000 character limit reached
Identifying Dynamic Sequential Plans
Published 13 Jun 2012 in cs.AI | (1206.3292v1)
Abstract: We address the problem of identifying dynamic sequential plans in the framework of causal Bayesian networks, and show that the problem is reduced to identifying causal effects, for which there are complete identi cation algorithms available in the literature.
Paper Prompts
Sign up for free to create and run prompts on this paper.