{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:47:14Z","timestamp":1725896834670},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317170"},{"type":"electronic","value":"9783642317187"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31718-7_49","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:45:13Z","timestamp":1342831513000},"page":"470-480","source":"Crossref","is-referenced-by-count":1,"title":["Inference Using Compiled Product-Based Possibilistic Networks"],"prefix":"10.1007","author":[{"given":"Raouia","family":"Ayachi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nahla Ben","family":"Amor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salem","family":"Benferhat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-22152-1_59","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"R. Ayachi","year":"2011","unstructured":"Ayachi, R., Ben Amor, N., Benferhat, S.: Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach. In: Liu, W. (ed.) ECSQARU 2011. LNCS, vol.\u00a06717, pp. 700\u2013712. Springer, Heidelberg (2011)"},{"key":"49_CR2","unstructured":"Ayachi, R., Ben Amor, N., Benferhat, S., Haenni, R.: Compiling possibilistic networks: Alternative approaches to possibilistic inference. In: UAI, pp. 40\u201347 (2010)"},{"key":"49_CR3","unstructured":"Bhattacharjya, D., Shachter, R.: Evaluating influence diagrams with decision circuits. In: UAI"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Gebhardt, J., Kruse, R.: Possibilistic graphical models. In: ISSEK","DOI":"10.1007\/978-3-7091-2588-5_3"},{"issue":"3-4","key":"49_CR5","first-page":"137","volume":"10","author":"M. Cadoli","year":"1997","unstructured":"Cadoli, M., Donini, F.: A survey on knowledge compilation. AI Communications\u00a010(3-4), 137\u2013150 (1997)","journal-title":"AI Communications"},{"key":"49_CR6","unstructured":"Chan, H., Darwiche, A.: On the robustness of most probable explanations. In: UAI, pp. 63\u201371 (2006)"},{"key":"49_CR7","unstructured":"Chavira, M., Darwiche, A.: Compiling bayesian networks with local structure. In: IJCAI, pp. 1306\u20131312 (2005)"},{"issue":"4","key":"49_CR8","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1145\/502090.502091","volume":"48","author":"A. Darwiche","year":"2001","unstructured":"Darwiche, A.: Decomposable negation normal form. Journal of the ACM\u00a048(4), 608\u2013647 (2001)","journal-title":"Journal of the ACM"},{"key":"49_CR9","unstructured":"Darwiche, A.: A logical approach to factoring belief networks. In: KR, pp. 409\u2013420 (2002)"},{"key":"49_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research\u00a017, 229\u2013264 (2002)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Dubois, D., Prade, H.: Possibility theory:An approach to computerized, Processing of uncertainty. Plenium Press (1988)","DOI":"10.1007\/978-1-4684-5287-7"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Dubois, D., Prade, H.: Possibility theory. In: Encyclopedia of Complexity and Systems Science. Springer (2009)","DOI":"10.1007\/978-0-387-30440-3_413"},{"key":"49_CR13","unstructured":"Fargier, H., Marquis, P.: On valued negation normal form formulas. In: IJCAI, pp. 360\u2013365 (2007)"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Hisdal, E.: Conditional possibilities independence and non interaction. Fuzzy Sets and Systems\u00a01 (1978)","DOI":"10.1016\/0165-0114(78)90019-2"},{"key":"49_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-540-75256-1_48","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"M. Wachter","year":"2007","unstructured":"Wachter, M., Haenni, R.: Logical Compilation of Bayesian Networks with Discrete Variables. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol.\u00a04724, pp. 536\u2013547. Springer, Heidelberg (2007)"}],"container-title":["Communications in Computer and Information Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31718-7_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:08:49Z","timestamp":1606187329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31718-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317170","9783642317187"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31718-7_49","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}