{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:05:46Z","timestamp":1743055546055,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221514"},{"type":"electronic","value":"9783642221521"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22152-1_59","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T19:22:00Z","timestamp":1309029720000},"page":"700-712","source":"Crossref","is-referenced-by-count":3,"title":["Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach"],"prefix":"10.1007","author":[{"given":"Raouia","family":"Ayachi","sequence":"first","affiliation":[]},{"given":"Nahla","family":"Ben Amor","sequence":"additional","affiliation":[]},{"given":"Salem","family":"Benferhat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","unstructured":"Ayachi, R., Ben Amor, N., Benferhat, S., Haenni, R.: Compiling possibilistic networks: Alternative approaches to possibilistic inference. In: Proceedings of 26th Conference on UAI, pp. 40\u201347. AUAI Press (2010)"},{"key":"59_CR2","doi-asserted-by":"crossref","unstructured":"Ben Amor, N., Benferhat, S., Mellouli, K.: Anytime propagation algorithm for minbased possibilistic graphs. Soft. Comput.\u00a08(2), 150\u2013161 (2003)","DOI":"10.1007\/s00500-002-0255-x"},{"issue":"2","key":"59_CR3","first-page":"135","volume":"29","author":"S. Benferhat","year":"2002","unstructured":"Benferhat, S., Dubois, D., Garcia, L., Prade, H.: On the transformation between possibilistic logic bases and possibilistic causal networks. IJAR\u00a029(2), 135\u2013173 (2002)","journal-title":"IJAR"},{"key":"59_CR4","unstructured":"Benferhat, S., Smaoui, S.: Possibilistic causal networks for handling interventions: A new propagation algorithm. In: AAAI, pp. 373\u2013378 (2007)"},{"key":"59_CR5","unstructured":"Benferhat, S., Yahi, S., Drias, H.: On the compilation of stratified belief bases under linear and possibilistic logic policies. IJAR, 2425\u20132430 (2007)"},{"issue":"3-4","key":"59_CR6","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"},{"issue":"4","key":"59_CR7","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":"59_CR8","unstructured":"Darwiche, A.: A logical approach to factoring belief networks. In: Proceedings of KR, pp. 409\u2013420 (2002)"},{"key":"59_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811357","volume-title":"Modeling and Reasoning with Bayesian Networks","author":"A. Darwiche","year":"2009","unstructured":"Darwiche, A.: Modeling and Reasoning with Bayesian Networks, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"key":"59_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":"59_CR11","doi-asserted-by":"publisher","first-page":"6927","DOI":"10.1007\/978-0-387-30440-3_413","volume-title":"Encyclopedia of Complexity and Systems Science","author":"D. Dubois","year":"2009","unstructured":"Dubois, D., Prade, H.: Possibility theory. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 6927\u20136939. Springer, Heidelberg (2009)"},{"key":"59_CR12","unstructured":"Fargier, H., Marquis, P.: On valued negation normal form formulas. In: Proceedings of the 20th IJCAI, San Francisco, CA, USA, pp. 360\u2013365 (2007)"},{"key":"59_CR13","unstructured":"Goldszmidt, M., Pearl, J.: Rank-based systems: A simple approach to belief revision, belief update, and reasoning about evidence and actions. In: KR, pp. 661\u2013672 (1992)"},{"key":"59_CR14","doi-asserted-by":"crossref","unstructured":"Lang, J.: Possibilistic logic: complexity and algorithms. In: Handbook on Defeasible Reasoning and Uncertainty Management Systems, vol.\u00a05, pp. 179\u2013220 (2001)","DOI":"10.1007\/978-94-017-1737-3_5"},{"key":"59_CR15","volume-title":"Causality:models, reasoning, and inference","author":"J. Pearl","year":"2000","unstructured":"Pearl, J.: Causality:models, reasoning, and inference. Cambridge Univ. Press, Cambridge (2000)"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22152-1_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T06:13:30Z","timestamp":1560320010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22152-1_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221514","9783642221521"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22152-1_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}