{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:41:12Z","timestamp":1742985672062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"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_2","type":"book-chapter","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T10:26:21Z","timestamp":1533896781000},"page":"12-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Community-Division Based Algorithm for Finding Relations Among Linear Constraints"],"prefix":"10.1007","author":[{"given":"Minghao","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,11]]},"reference":[{"issue":"10","key":"2_CR1","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech.: Theory Exp."},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-85958-1_22","volume-title":"Principles and Practice of Constraint Programming","author":"H Collavizza","year":"2008","unstructured":"Collavizza, H., Rueher, M., Van Hentenryck, P.: CPBPV: a constraint-programming framework for bounded program verification. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 327\u2013341. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_22"},{"key":"2_CR3","volume-title":"Linear Programming and Extensions","author":"G Dantzig","year":"2016","unstructured":"Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (2016)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Estiningsih, Y., Farikhin, Tjahjana, R.: A comparison of heuristic method and Llewellyn\u2019s rules for identification of redundant constraints. J. Phys. Conf. Ser. 983, 012083 (2018). IOP Publishing","DOI":"10.1088\/1742-6596\/983\/1\/012083"},{"key":"2_CR5","unstructured":"Ge, C., Ma, F., Zhang, P., Zhang, J.: Computing and estimating the volume of the solution space of SMT (LA) constraints. Theor. Comput. Sci. (2016, in press)"},{"issue":"12","key":"2_CR6","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1017\/S0269888912000252","volume":"27","author":"A Gotlieb","year":"2012","unstructured":"Gotlieb, A.: TCAS software verification using constraint programming. Knowl. Eng. Rev. 27(3), 343\u2013360 (2012)","journal-title":"Knowl. Eng. Rev."},{"key":"2_CR8","unstructured":"Huang, Z., Zhang, H., Zhang, J.: Improving first-order model searching by propositional reasoning and lemma learning. In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10\u201313 May 2004, Vancouver, BC, Canada, Online Proceedings (2004)"},{"issue":"9","key":"2_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1995376.1995394","volume":"54","author":"LM de Moura","year":"2011","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9), 69\u201377 (2011)","journal-title":"Commun. ACM"},{"issue":"6","key":"2_CR10","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":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981)","journal-title":"J. ACM"},{"issue":"8&9","key":"2_CR12","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/00207160601014148","volume":"83","author":"S Paulraj","year":"2006","unstructured":"Paulraj, S., Chellappan, C., Natesan, T.R.: A heuristic approach for identification of redundant constraints in linear programming models. Int. J. Comput. Math. 83(8&9), 675\u2013683 (2006)","journal-title":"Int. J. Comput. Math."},{"key":"2_CR13","volume-title":"Optimization in Operations Research","author":"RL Rardin","year":"2016","unstructured":"Rardin, R.L.: Optimization in Operations Research. Prentice Hall, Upper Saddle River (2016)"},{"volume-title":"Handbook of Constraint Programming, Foundations of Artificial Intelligence","year":"2006","key":"2_CR14","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2. Elsevier, New York City (2006)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-14295-6_7","volume-title":"Computer Aided Verification","author":"A Rybalchenko","year":"2010","unstructured":"Rybalchenko, A.: Constraint solving for program verification: theory and practice by example. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 57\u201371. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_7"},{"key":"2_CR16","unstructured":"Silva, J.P.M., Sakallah, K.A.: Conflict analysis in search algorithms for satisfiability. In: Eigth International Conference on Tools with Artificial Intelligence, ICTAI 1996, Toulouse, France, 16\u201319 November 1996, pp. 467\u2013469. IEEE Computer Society (1996)"},{"issue":"80","key":"2_CR17","first-page":"3963","volume":"7","author":"P Sumathi","year":"2013","unstructured":"Sumathi, P., Paulraj, S.: Identification of redundant constraints in large scale linear programming problems with minimal computational effort. Appl. Math. Sci. 7(80), 3963\u20133974 (2013)","journal-title":"Appl. Math. Sci."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, X., Ma, Y., Wang, J.: Hierarchical combination design method of test cases based on conditional constraints. In: 2017 IEEE International Conference on Software Quality, Reliability and Security Companion, QRS-C 2017, Prague, Czech Republic, 25\u201329 July 2017, pp. 636\u2013637. IEEE (2017)","DOI":"10.1109\/QRS-C.2017.129"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11856290_20","volume-title":"Artificial Intelligence and Symbolic Computation","author":"J Yan","year":"2006","unstructured":"Yan, J., Zhang, J., Xu, Z.: Finding relations among linear constraints. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol. 4120, pp. 226\u2013240. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11856290_20"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11814948_17","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Y Yu","year":"2006","unstructured":"Yu, Y., Malik, S.: Lemma learning in SMT on linear constraints. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 142\u2013155. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_17"},{"key":"2_CR21","unstructured":"Zhang, J.: Specification analysis and test data generation by solving boolean combinations of numeric constraints. In: 1st Asia-Pacific Conference on Quality Software (APAQS 2000), 30\u201331 October 2000, Hong Kong, China, Proceedings, pp. 267\u2013274. IEEE Computer Society (2000)"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1142\/S0218194001000487","volume":"11","author":"J Zhang","year":"2001","unstructured":"Zhang, J., Wang, X.: A constraint solver and its application to path feasibility analysis. Int. J. Softw. Eng. Knowl. Eng. 11(2), 139\u2013156 (2001)","journal-title":"Int. J. Softw. Eng. Knowl. Eng."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45657-0_2","volume-title":"Computer Aided Verification","author":"L Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: The quest for efficient boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 17\u201336. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_2"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:34:19Z","timestamp":1710232459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99247-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992464","9783319992471"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99247-1_2","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)"}}]}}