{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:27:50Z","timestamp":1725499670504},"publisher-location":"London","reference-count":6,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852339074"},{"type":"electronic","value":"9781846281020"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-84628-102-4_24","type":"book-chapter","created":{"date-parts":[[2007,12,23]],"date-time":"2007-12-23T10:10:19Z","timestamp":1198404619000},"page":"327-340","source":"Crossref","is-referenced-by-count":0,"title":["On Disjunctive Representations of Distributions and Randomization"],"prefix":"10.1007","author":[{"given":"T. K.","family":"Satish Kumar","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Darwiche A. (2001). On the Tractable Counting of Theory Models and its Applications to Belief Revision and Truth Maintenance. Journal of Applied Non-Classical Logics. 2001.","DOI":"10.3166\/jancl.11.11-34"},{"key":"24_CR2","unstructured":"Darwiche A. (2002). A Logical Approach to Factoring Belief Networks. Proceedings of KR\u2019 2002."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Jensen F. V. and Jensen F. (1994). Optimal Junction Trees. Tenth Annual Conference on Uncertainty in Artificial Intelligence (UAI\u20191994).","DOI":"10.1016\/B978-1-55860-332-5.50050-X"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Karp R., Luby M. and Madras N. (1989). Monte-Carlo Approximation Algorithms for Enumeration Problems. Journal of Algorithms. 1989.","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"24_CR5","unstructured":"Kumar T. K. S. (2002). SAT-Based Algorithms for Bayesian Network Inference. Proceedings of the 22nd SGAI International Conference on Knowledge-Based Systems and Applied Artificial Intelligence (ES\u20192002)."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Tarjan R. E. and Yannakakis M. (1984). Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM Journal of Computing. 1984.","DOI":"10.1137\/0213035"}],"container-title":["Research and Development in Intelligent Systems XXI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-84628-102-4_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:47:16Z","timestamp":1619542036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-84628-102-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781852339074","9781846281020"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/1-84628-102-4_24","relation":{},"subject":[]}}