{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T02:45:02Z","timestamp":1768790702348,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101267"],"award-info":[{"award-number":["12101267"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"scientific research startup of Jiangsu University","award":["19JDG035"],"award-info":[{"award-number":["19JDG035"]}]},{"name":"NSERC of Canada","award":["CGSD3-535362-2019"],"award-info":[{"award-number":["CGSD3-535362-2019"]}]},{"name":"MITACS of Canada","award":["IT36974)"],"award-info":[{"award-number":["IT36974)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669708","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"351-360","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient detection of redundancies in systems of linear inequalities\u2731"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6932-8862","authenticated-orcid":false,"given":"Rui-Juan","family":"Jing","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Jinagsu University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3011-0756","authenticated-orcid":false,"given":"Marc","family":"Moreno Maza","sequence":"additional","affiliation":[{"name":"Computer Science, University of Western Ontario, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4894-4268","authenticated-orcid":false,"given":"Yan-Feng","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3349-533X","authenticated-orcid":false,"given":"Chun-Ming","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, China"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Handbook of satisfiability. Vol.\u00a0185","author":"van Maaren H.","unstructured":"M.\u00a0Heule A.\u00a0Biere and H. van Maaren. 2009. Handbook of satisfiability. Vol.\u00a0185. IOS press."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018368920203"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"C. Barrett and C. Tinelli. 2018. Satisfiability modulo theories. In Handbook of model checking. Springer 305\u2013343.","DOI":"10.1007\/978-3-319-10575-8_11"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2004.1342537"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(65)90045-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924720"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365723"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90004-6"},{"key":"e_1_3_2_1_9_1","volume-title":"The yices smt solver. Tool paper at http:\/\/yices. csl. sri. com\/tool-paper. pdf 2, 2","author":"Dutertre B.","year":"2006","unstructured":"B. Dutertre and L.\u00a0De Moura. 2006. The yices smt solver. Tool paper at http:\/\/yices. csl. sri. com\/tool-paper. pdf 2, 2 (2006), 1\u20132."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407931"},{"key":"e_1_3_2_1_11_1","volume-title":"The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications","author":"Feautrier P.","unstructured":"P. Feautrier. 1996. Automatic Parallelization in the Polytope Model. In The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications. Springer-Verlag, 79\u2013103."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2222863"},{"key":"e_1_3_2_1_13_1","unstructured":"K. Fukuda. [n. d.]. The CDD and CDDplus Homepage. https:\/\/www.inf.ethz.ch\/personal\/fukudak\/cdd_home\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"K. Fukuda and A. Prodon. 1996. Double description method revisited. In Combinatorics and computer science. Springer 91\u2013111.","DOI":"10.1007\/3-540-61576-8_77"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(199607)8:6<445::AID-CPE253>3.0.CO;2-G"},{"key":"e_1_3_2_1_16_1","volume-title":"Fourier-Motzkin elimination software for information theoretic inequalities. arXiv preprint 1610.03990","author":"Gattegno I.B.","year":"2016","unstructured":"I.B. Gattegno, Z. Goldfeld, and H.\u00a0H. Permuter. 2016. Fourier-Motzkin elimination software for information theoretic inequalities. arXiv preprint 1610.03990 (2016)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02284624"},{"key":"e_1_3_2_1_18_1","volume-title":"First International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911)","author":"Grosser T.","unstructured":"T. Grosser, H. Zheng, R. Aloor, A. Simb\u00fcrger, A. Gr\u00f6\u00dflinger, and L. Pouchet. 2011. Polly - Polyhedral optimization in LLVM. In First International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911). Chamonix, France."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.09.012"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3263178"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01535523"},{"key":"e_1_3_2_1_22_1","volume-title":"Fourier\u2019s Elimination: Which to Choose?. In Principles and Practice of Constraint Programming, PPCP. 117\u2013129.","author":"Imbert L.","year":"1993","unstructured":"J.\u00a0L. Imbert. 1993. Fourier\u2019s Elimination: Which to Choose?. In Principles and Practice of Constraint Programming, PPCP. 117\u2013129."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of CASC. 225\u2013241","author":"Jing J.","unstructured":"R.\u00a0J. Jing and M. Moreno Maza. 2017. Computing the Integer Points of a Polyhedron, I: Algorithm. In Proceedings of CASC. 225\u2013241."},{"key":"e_1_3_2_1_24_1","volume-title":"II: complexity estimates","author":"Jing J.","unstructured":"R.\u00a0J. Jing and M. Moreno Maza. 2017. Computing the integer points of a polyhedron, II: complexity estimates. In Proceedings of CASC. Springer, 242\u2013256."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of CASC. Springer, 282\u2013306","author":"Jing J.","unstructured":"R.\u00a0J. Jing, M. Moreno-Maza, and D. Talaashrafi. 2020. Complexity estimates for Fourier-Motzkin elimination. In Proceedings of CASC. Springer, 282\u2013306."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2385-z"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0_187"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the Fifth International Workshop on Compilers for Parallel Computers. 200\u2013211","author":"Knijnenburg M.","year":"1995","unstructured":"P.\u00a0M. Knijnenburg and A.\u00a0J. Bik. 1995. On reducing overhead in loops. In Proceedings of the Fifth International Workshop on Compilers for Parallel Computers. 200\u2013211."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"D.\u00a0A. Kohler. 1967. Projections of convex polyhedral sets. Technical Report. California Univ. at Berkeley Operations Research Center.","DOI":"10.21236\/AD0659301"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52531-9_136"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00245296"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2018.06.002"},{"key":"e_1_3_2_1_33_1","unstructured":"V. Loechner. 1999. PolyLib: A library for manipulating parameterized polyhedra."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"e_1_3_2_1_35_1","volume-title":"Static Analysis: 24th International Symposium, SAS 2017, New York, NY, USA, August 30\u2013September 1, 2017, Proceedings 24","author":"Mar\u00e9chal A.","unstructured":"A. Mar\u00e9chal, D. Monniaux, and M. P\u00e9rin. 2017. Scalable minimizing-operators on polyhedra via parametric linear programming. In Static Analysis: 24th International Symposium, SAS 2017, New York, NY, USA, August 30\u2013September 1, 2017, Proceedings 24. Springer, 212\u2013231."},{"key":"e_1_3_2_1_36_1","volume-title":"International Conference on Verification, Model Checking, and Abstract Interpretation. Springer, 367\u2013385","author":"Mar\u00e9chal A.","unstructured":"A. Mar\u00e9chal and M. P\u00e9rin. 2017. Efficient elimination of redundancies in polyhedra by raytracing. In International Conference on Verification, Model Checking, and Abstract Interpretation. Springer, 367\u2013385."},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of TACAS. Springer, 337\u2013340","author":"L.","unstructured":"L.\u00a0De Moura and N. Bj\u00f8rner. 2008. Z3: An efficient SMT solver. In Proceedings of TACAS. Springer, 337\u2013340."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007554627716"},{"key":"e_1_3_2_1_39_1","volume-title":"Theory of linear and integer programming","author":"Schrijver A.","unstructured":"A. Schrijver. 1986. Theory of linear and integer programming. John Wiley & Sons, Inc., New York, NY, USA."},{"key":"e_1_3_2_1_40_1","volume-title":"IEEE\/ACM International Conference on Computer Aided Design","author":"Stehr G.","year":"2004","unstructured":"G. Stehr, H. Graeb, and K. Antreich. 2004. Analog performance space exploration by Fourier-Motzkin elimination with application to hierarchical sizing. In IEEE\/ACM International Conference on Computer Aided Design, 2004. 847\u2013854."},{"key":"e_1_3_2_1_41_1","unstructured":"A. Storjohann. 2000. Algorithms for matrix canonical forms. Ph.\u00a0D. Dissertation. ETH Zurich."},{"key":"e_1_3_2_1_42_1","volume-title":"Barvinok: User guide. Version 0.23), Electronically","year":"2007","unstructured":"S.Verdoolaege. 2007. Barvinok: User guide. Version 0.23), Electronically available at http:\/\/www. kotnet. org\/skimo\/barvinok (2007)."},{"key":"e_1_3_2_1_43_1","volume-title":"ISL: An integer set library for the polyhedral model","author":"Verdoolaege S.","year":"2010","unstructured":"S. Verdoolaege. 2010. ISL: An integer set library for the polyhedral model. In Proceedings of ICMS. Springer, 299\u2013302."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400713"},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of ICMS 2010(LNCS, Vol.\u00a06327)","author":"S\u00f6ger C.","unstructured":"B.\u00a0Ichim W.\u00a0Bruns and C. S\u00f6ger. 2010. Introduction to Normaliz 2.5. In Proceedings of ICMS 2010(LNCS, Vol.\u00a06327), Komei Fukuda, Joris van\u00a0der Hoeven, Michael Joswig, and Nobuki Takayama (Eds.). Springer, 209\u2013212."},{"key":"e_1_3_2_1_46_1","volume-title":"Proceedings Supercomputing \u201991","author":"William P.","year":"1991","unstructured":"P. William. 1991. The Omega test: a fast and practical integer programming algorithm for dependence analysis. In Proceedings Supercomputing \u201991. 4\u201313."}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","location":"Raleigh NC USA","acronym":"ISSAC '24","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:51:25Z","timestamp":1758588685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":46,"alternative-id":["10.1145\/3666000.3669708","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669708","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}