{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:31:41Z","timestamp":1743150701405,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992464"},{"type":"electronic","value":"9783319992471"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99247-1_5","type":"book-chapter","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T10:26:21Z","timestamp":1533896781000},"page":"48-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Approach for Computing Conflict Sets Combining Failure Probability with SAT"],"prefix":"10.1007","author":[{"given":"Ya","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dantong","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K.: Configuration checking with aspiration in local search for SAT. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 22\u201326 July 2012, Toronto, Ontario, Canada, pp. 434\u2013440 (2012)","DOI":"10.1609\/aaai.v26i1.8133"},{"key":"5_CR2","unstructured":"Console, L., Dressler, O.: Model-based diagnosis in the real world: lessons learned and challenges remaining. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, Stockholm, Sweden, 31 July\u20136 August 1999, vols. 2, 1450 p., pp. 1393\u20131400 (1999)"},{"issue":"4","key":"5_CR3","first-page":"630","volume":"20","author":"S Dai","year":"2003","unstructured":"Dai, S., Sun, H.: Computing conflict sets for model-based diagnosis. Control Theory Appl. 20(4), 630\u2013632 (2003)","journal-title":"Control Theory Appl."},{"issue":"1","key":"5_CR4","first-page":"39","volume":"22","author":"M Fang","year":"1999","unstructured":"Fang, M.: A practical method to identify the minimal conflict sets. J. Hefei Univ. Technol. 22(1), 39\u201343 (1999)","journal-title":"J. Hefei Univ. Technol."},{"issue":"1\u20133","key":"5_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0004-3702(84)90043-2","volume":"24","author":"MR Genesereth","year":"1984","unstructured":"Genesereth, M.R.: The use of design descriptions in automated diagnosis. Artif. Intell. 24(1\u20133), 411\u2013436 (1984)","journal-title":"Artif. Intell."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0004-3702(89)90079-9","volume":"41","author":"R Greiner","year":"1989","unstructured":"Greiner, R., Smith, B.A., Wilkerson, R.W.: A correction to the algorithm in reiter\u2019s theory of diagnosis. Artif. Intell. 41(1), 79\u201388 (1989)","journal-title":"Artif. Intell."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-46019-5_9","volume-title":"Soft-Ware 2002: Computing in an Imperfect World","author":"R Haenni","year":"2002","unstructured":"Haenni, R.: A query-driven anytime algorithm for argumentative and abductive reasoning. In: Bustard, D., Liu, W., Sterritt, R. (eds.) Soft-Ware 2002. LNCS, vol. 2311, pp. 114\u2013127. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46019-5_9"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0004-3702(94)90019-1","volume":"65","author":"A Hou","year":"1994","unstructured":"Hou, A.: A theory of measurement in diagnosis from first principles. Artif. Intell. 65(2), 281\u2013328 (1994)","journal-title":"Artif. Intell."},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","volume":"28","author":"JD Kleer","year":"1986","unstructured":"Kleer, J.D.: An assumption-based TMS. Artif. Intell. 28(2), 127\u2013162 (1986)","journal-title":"Artif. Intell."},{"issue":"11","key":"5_CR10","doi-asserted-by":"publisher","first-page":"112101","DOI":"10.1007\/s11432-017-9273-5","volume":"61","author":"M Liu","year":"2018","unstructured":"Liu, M., Ouyang, D., Cai, S., Zhang, L.: Efficient zonal diagnosis with maximum satisfiability. Sci. China Inf. Sci. 61(11), 112101 (2018)","journal-title":"Sci. China Inf. Sci."},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s10409-017-0740-1","volume":"46","author":"M Liu","year":"2018","unstructured":"Liu, M., Ouyang, D., Liu, B.: Grouped diagnosis approach using the feature of problem. Acta Electron. Sin. 46(3), 589\u2013594 (2018)","journal-title":"Acta Electron. Sin."},{"key":"5_CR12","first-page":"178","volume":"365","author":"S Luan","year":"2005","unstructured":"Luan, S., Dai, G.: Approach to diagnosing a system with structure information. Chin. J. Comput. 365, 178\u2013189 (2005)","journal-title":"Chin. J. Comput."},{"issue":"6","key":"5_CR13","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract davis-putnam-logemann-loveland procedure to DPLL(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"issue":"5","key":"5_CR14","first-page":"1175","volume":"45","author":"D Ouyang","year":"2017","unstructured":"Ouyang, D., Liu, B., Zhou, J., Zhang, L.: A method of computing minimal conflict sets combining the structure property with the anti-depth SE-Tree. Acta Electron. Sin. 45(5), 1175\u20131181 (2017)","journal-title":"Acta Electron. Sin."},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57\u201395 (1987)","journal-title":"Artif. Intell."},{"key":"5_CR16","unstructured":"Wang, Y., Cai, S., Yin, M.: Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 12\u201317 February 2016, Phoenix, Arizona, USA, pp. 805\u2013811 (2016)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.5205","volume":"58","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Cai, S., Yin, M.: Local search for minimum weight dominating set with two-level configuration checking and frequency based scoring function. J. Artif. Intell. Res. 58, 267\u2013295 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.ins.2017.12.012","volume":"432","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Cai, S., Yin, M.: New heuristic approaches for maximum balanced biclique problem. Inf. Sci. 432, 362\u2013375 (2018)","journal-title":"Inf. Sci."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0020-0190(00)00166-6","volume":"79","author":"F Wotawa","year":"2001","unstructured":"Wotawa, F.: A variant of reiter\u2019s hitting-set algorithm. Inf. Process. Lett. 79(1), 45\u201351 (2001)","journal-title":"Inf. Process. Lett."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-31612-8_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"J Zhang","year":"2012","unstructured":"Zhang, J., Ma, F., Zhang, Z.: Faulty interaction identification via constraint solving and optimization. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 186\u2013199. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_15"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1080\/10020070612331343209","volume":"16","author":"X Zhao","year":"2006","unstructured":"Zhao, X., Ouyang, D.: A method of combining SE-tree to compute all minimal hitting sets. Progress Nat. Sci.: Mater. Int. 16(2), 169\u2013174 (2006)","journal-title":"Progress Nat. Sci.: Mater. Int."},{"issue":"4","key":"5_CR22","first-page":"804","volume":"37","author":"X Zhao","year":"2009","unstructured":"Zhao, X., Ouyang, D.: Deriving all minimal conflict sets using satisfiability algorithms. Acta Electron. Sin. 37(4), 804\u2013810 (2009)","journal-title":"Acta Electron. Sin."}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99247-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:34:39Z","timestamp":1710232479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99247-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992464","9783319992471"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99247-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changchun","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ksem2018.venue.link\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"262","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"We have 3 reviews for 235 submissions, 4 reviews for 25 submissions and 5 review for 2 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}