Cite
HARVARD Citation
SATO, T. et al. (2014). Infinite probability computation by cyclic explanation graphs. Theory and practice of logic programming. 14 (6), pp. 909-937. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
SATO, T. et al. (2014). Infinite probability computation by cyclic explanation graphs. Theory and practice of logic programming. 14 (6), pp. 909-937. [Online].