{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T15:46:57Z","timestamp":1750780017049},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T00:00:00Z","timestamp":1251936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10817-009-9150-9","type":"journal-article","created":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T11:02:32Z","timestamp":1251889352000},"page":"39-59","source":"Crossref","is-referenced-by-count":3,"title":["A New Default Theories Compilation for MSP-Entailment"],"prefix":"10.1007","volume":"45","author":[{"given":"Salem","family":"Benferhat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Safa","family":"Yahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,3]]},"reference":[{"key":"9150_CR1","unstructured":"AbouElKalam, A., Benferhat, S., Mi\u00e8ge, A., ElBaida, R., Cuppens, F., Saurel, C., Balbiani, P., Deswarte, Y., Trouessin, G.: Organization based access control. In: Policies for Distributed Systems and Networks (POLICY\u201903), pp. 120\u2013128 (2003)"},{"key":"9150_CR2","unstructured":"Benferhat, S., Bonnefon, J.-F., Neves, R.D.S.: An experimental analysis of possibilistic default reasoning. In: 9th International Conference on the Principles of Knowledge Representation and Reasoning (KR\u201904), pp. 130\u2013140 (2004)"},{"key":"9150_CR3","unstructured":"Benferhat, S., Dubois, D., Cayrol, C., Lang, J., Prade, H.: Inconsistency management and prioritized syntaxbased entailment. In: 13th International Joint Conference on Artificial Intelligence (IJCAI\u201993), pp. 640\u2013645 (1993)"},{"issue":"2","key":"9150_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1008259801924","volume":"9","author":"S Benferhat","year":"1998","unstructured":"Benferhat, S., Dubois, D., Prade, H.: Practical Handling of Exception-tainted rules and independence information in possibilistic logic. J. Appl. Intell. 9(2), 101\u2013127 (1998)","journal-title":"J. Appl. Intell."},{"key":"9150_CR5","unstructured":"Benferhat, S., Yahi, S., Drias, H.: On the compilation of stratified belief bases under linear and possibilistic logic policies. In: 20th International Joint Conference on Artificial Intelligence (IJCAI\u2019 07), pp. 2428\u20132430 (2007)"},{"key":"9150_CR6","first-page":"613","volume-title":"21st International Florida Artificial Intelligence Research Society Conference (Flairs\u201908)","author":"S Benferhat","year":"2008","unstructured":"Benferhat, S., Yahi, S., Drias, H.: On the compilation of possibilistic default theories. In: 21st International Florida Artificial Intelligence Research Society Conference (Flairs\u201908), pp. 613\u2013618. AAAI, Menlo Park (2008)"},{"key":"9150_CR7","unstructured":"Boufkhad, Y., Gr\u00e9goire, \u00c9., Marquis, P., Mazure, B., Sais, L.: Tractable Cover Compilations. In: IJCAI (1), pp. 122\u2013127 (1997)"},{"key":"9150_CR8","doi-asserted-by":"crossref","unstructured":"Bouquet, F., J\u00e9gou, P.: Using OBDDs to handle dynamic constraints. In: Information Processing Letters, pp. 111\u2013120 (1997)","DOI":"10.1016\/S0020-0190(97)00058-6"},{"key":"9150_CR9","first-page":"137","volume":"10","author":"M Cadoli","year":"1997","unstructured":"Cadoli, M., Donini, F.M.: A survey on knowledge compilation. Artif. Intell. Commun. 10, 137\u2013150 (1997)","journal-title":"Artif. Intell. Commun."},{"issue":"4","key":"9150_CR10","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/502090.502091","volume":"48","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: Decomposable negation normal form. J. ACM 48(4), 608\u2013647 (2001)","journal-title":"J. ACM"},{"key":"9150_CR11","first-page":"627","volume-title":"Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI)","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A.: A compiler for deterministic, decomposable negation normal form. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), pp. 627\u2013634. AAAI, Menlo Park (2002)"},{"key":"9150_CR12","unstructured":"Darwiche, A.: New advances in compiling CNF to decomposable negational normal form. In: Proceedings of European Conference on Artificial Intelligence (2004)"},{"key":"9150_CR13","series-title":"Lecture Notes in AI, 2143","first-page":"180","volume-title":"Trends in Artificial Intelligence","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A., Hopkins, M.: Using recursive decomposition to construct elimination orders, jointrees and dtrees. In: Trends in Artificial Intelligence. Lecture Notes in AI, 2143, pp. 180\u2013191. Springer, New York (2001)"},{"key":"9150_CR14","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. J. Artif. Intell. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"9150_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(86)90082-2","volume":"28","author":"J Kleer de","year":"1986","unstructured":"de\u00a0Kleer, J.: Problem solving with the ATMS. Artif. Intell. 28, 197\u2013224 (1986)","journal-title":"Artif. Intell."},{"key":"9150_CR16","first-page":"439","volume":"3","author":"D Dubois","year":"1994","unstructured":"Dubois, D., Lang, J., Prade, H.: Possibilistic logic. Handb Log. Art. Intell. Log. Program. 3, 439\u2013513 (1994)","journal-title":"Handb Log. Art. Intell. Log. Program."},{"key":"9150_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-5287-7","volume-title":"Possibility Theory: An Approach to Computerized Processing of Uncertainty","author":"D Dubois","year":"1988","unstructured":"Dubois, D., Prade, H.: Possibility Theory: An Approach to Computerized Processing of Uncertainty. Plenum, New York (1988)"},{"key":"9150_CR18","unstructured":"Goldszmidt, M., Pearl, J.: System-Z+: a formalism for reasoning with variable-strength defaults. In: 9th National conference in Artificial Intelligence (AAAI\u201991), pp. 399\u2013404 (1991)"},{"issue":"1\u20132","key":"9150_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S Kraus","year":"1990","unstructured":"Kraus, S., Lehmann, D.J., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1\u20132), 167\u2013207 (1990)","journal-title":"Artif. Intell."},{"key":"9150_CR20","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-94-017-1737-3_5","volume":"5","author":"J Lang","year":"2000","unstructured":"Lang, J.: Possibilistic logic: complexity and algorithms. Handb. Defeasible Reason. Uncertain. Manag. Sys. 5, 179\u2013220 (2000)","journal-title":"Handb. Defeasible Reason. Uncertain. Manag. Sys."},{"issue":"1","key":"9150_CR21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01535841","volume":"15","author":"DJ Lehmann","year":"1995","unstructured":"Lehmann, D.J.: Another perspective on default reasoning. Ann. Math. Artif. Intell. 15(1), 61\u201382 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"9150_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(92)90041-U","volume":"55","author":"DJ Lehmann","year":"1992","unstructured":"Lehmann, D.J., Magidor, M.: What does a Conditional Knowledge Base Entail?. Artif. Intell. 55(1), 1\u201360 (1992)","journal-title":"Artif. Intell."},{"key":"9150_CR23","doi-asserted-by":"crossref","unstructured":"Linke, T., Schaub, T.: An approach to query-answering in Reiter\u2019s default logic and the underlying existence of extensions problem. In: 6th Logics in Artificial Intelligence (JELIA\u201998), pp. 233\u2013247 (1998)","DOI":"10.1007\/3-540-49545-2_16"},{"issue":"1","key":"9150_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(00)00060-6","volume":"124","author":"T Linke","year":"2000","unstructured":"Linke, T., Schaub, T.: Alternative foundations for Reiter\u2019s default logic. Artif. Intell. 124(1), 31\u201386 (2000)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"9150_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription\u2014a form of non-monotonic reasoning. Artif. Intell. 13(1\u20132), 27\u201339 (1980)","journal-title":"Artif. Intell."},{"key":"9150_CR26","doi-asserted-by":"crossref","unstructured":"Mengin, J.: A theorem prover for default logic based on prioritized conflict resolution and an extended resolution principle. In: 3th Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU\u201995), pp. 301\u2013310 (1995)","DOI":"10.1007\/3-540-60112-0_35"},{"key":"9150_CR27","unstructured":"Morgenstern, L.: Inheritance comes of age: applying nonmonotonic techniques to problems in industry. In: 15 th International Joint Conference on Artificial Intelligence (IJCAI\u201997), pp. 1613\u20131613 (1997)"},{"key":"9150_CR28","doi-asserted-by":"crossref","unstructured":"Nebel, B.: How hard is it to revise a belief base?. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, pp. 77\u2013145 (1998)","DOI":"10.1007\/978-94-011-5054-5_3"},{"key":"9150_CR29","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)"},{"key":"9150_CR30","unstructured":"Pearl, J.: System Z: a natural ordering of defaults with tractable applications to default reasoning. In: 6th Theoretical Aspects of Rationality and Knowledge (TARK\u201990), pp. 121\u2013135 (1990)"},{"issue":"1\u20132","key":"9150_CR31","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artif. Intell. 13(1\u20132), 81\u2013132 (1980)","journal-title":"Artif. Intell."},{"issue":"2","key":"9150_CR32","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.485845","volume":"29","author":"RS Sandhu","year":"1996","unstructured":"Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. IEEE Comput. 29(2), 38\u201347 (1996)","journal-title":"IEEE Comput."},{"issue":"1\u20132","key":"9150_CR33","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0004-3702(95)00053-4","volume":"81","author":"R Schrag","year":"1996","unstructured":"Schrag, R., Crawford, J.M.: Implicates and prime implicates in random 3-SAT. Artif. Intell. 81(1\u20132), 199\u2013222 (1996)","journal-title":"Artif. Intell."},{"key":"9150_CR34","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0165-0114(92)90226-T","volume":"50","author":"RR Yager","year":"1992","unstructured":"Yager, R.R.: On the specificity of a possibility distribution. Fuzzy Sets Syst. 50, 279\u2013292 (1992)","journal-title":"Fuzzy Sets Syst."},{"key":"9150_CR35","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0165-0114(78)90029-5","volume":"1","author":"LA Zadeh","year":"1978","unstructured":"Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst. 1, 3\u201328 (1978)","journal-title":"Fuzzy Sets Syst."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-009-9150-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-009-9150-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-009-9150-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:21:49Z","timestamp":1559265709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-009-9150-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,3]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9150"],"URL":"https:\/\/doi.org\/10.1007\/s10817-009-9150-9","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,3]]}}}