{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:55:42Z","timestamp":1726059342912},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030351656"},{"type":"electronic","value":"9783030351663"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-35166-3_16","type":"book-chapter","created":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T10:01:27Z","timestamp":1573898487000},"page":"223-234","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graphical Analysis of Integer Infeasibility in UTVPI Constraints"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,12]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10703-009-0073-1","volume":"35","author":"R Bagnara","year":"2009","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness. Form. Methods Syst. Des. 35(3), 279\u2013323 (2009)","journal-title":"Form. Methods Syst. Des."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S0036144594295502","volume":"39","author":"A Dax","year":"1997","unstructured":"Dax, A.: Classroom note: an elementary proof of Farkas\u2019 lemma. SIAM Rev. 39(3), 503\u2013507 (1997)","journal-title":"SIAM Rev."},{"issue":"124","key":"16_CR4","first-page":"1","volume":"124","author":"G Farkas","year":"1902","unstructured":"Farkas, G.: \u00dcber die Theorie der Einfachen Ungleichungen. J. f\u00fcr die Reine und Angewandte Mathematik 124(124), 1\u201327 (1902)","journal-title":"J. f\u00fcr die Reine und Angewandte Mathematik"},{"key":"16_CR5","volume-title":"The Theory of Linear Economic Models","author":"D Gale","year":"1960","unstructured":"Gale, D.: The Theory of Linear Economic Models. McGraw-Hill, New York (1960)"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/12.372041","volume":"44","author":"R Gerber","year":"1995","unstructured":"Gerber, R., Pugh, W., Saksena, M.: Parametric dispatching of hard real-time tasks. IEEE Trans. Comput. 44(3), 471\u2013479 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01442864","volume":"6","author":"P Gordan","year":"1873","unstructured":"Gordan, P.: Ueber die aufl\u00f6sung linearer gleichungen mit reellen coefficienten. Math. Ann. 6(1), 23\u201328 (1873)","journal-title":"Math. Ann."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/0024-3795(89)90479-5","volume":"114\u2013115","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J.: On the existence of an integral potential in a weighted bidirected graph. Linear Algebr. Appl. 114\u2013115, 541\u2013553 (1989). Special Issue Dedicated to Alan J. Hoffman","journal-title":"Linear Algebr. Appl."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11559306_9","volume-title":"Frontiers of Combining Systems","author":"SK Lahiri","year":"2005","unstructured":"Lahiri, S.K., Musuvathi, M.: An efficient decision procedure for UTVPI constraints. In: Gramlich, B. (ed.) FroCoS 2005. LNCS (LNAI), vol. 3717, pp. 168\u2013183. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11559306_9"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(03)00098-1","volume":"32","author":"JB Lasserre","year":"2004","unstructured":"Lasserre, J.B.: Integer programming, Barvinok\u2019s counting algorithm and Gomory relaxations. Oper. Res. Lett. 32(2), 133\u2013137 (2004)","journal-title":"Oper. Res. Lett."},{"key":"16_CR11","volume-title":"Mathematics for Operations Research","author":"WH Marlow","year":"1978","unstructured":"Marlow, W.H.: Mathematics for Operations Research. Wiley, Hoboken (1978)"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. High.-Order Symb. Comput. 19(1), 31\u2013100 (2006)","journal-title":"High.-Order Symb. Comput."},{"key":"16_CR13","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"key":"16_CR14","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1987)"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0095-8956(91)90009-9","volume":"51","author":"A Schrijver","year":"1991","unstructured":"Schrijver, A.: Disjoint circuits of prescribed homotopies in a graph on a compact surface. J. Comb. Theory, Ser. B 51(1), 127\u2013159 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1287\/ijoc.1090.0369","volume":"22","author":"A Schutt","year":"2010","unstructured":"Schutt, A., Stuckey, P.J.: Incremental satisfiability and implication for UTVPI constraints. INFORMS J. Comput. 22(4), 514\u2013527 (2010)","journal-title":"INFORMS J. Comput."},{"key":"16_CR17","unstructured":"Sitzmann, I., Stuckey, P.J.: O-trees: a constraint-based index structure. In: Australasian Database Conference, pp. 127\u2013134 (2000)"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BF01458147","volume":"76","author":"E Stiemke","year":"1915","unstructured":"Stiemke, E.: \u00dcber positive l\u00f6sungen homogener linearer gleichungen. Math. Ann. 76(2), 340\u2013342 (1915)","journal-title":"Math. Ann."},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1002\/malq.200310099","volume":"50","author":"K Subramani","year":"2004","unstructured":"Subramani, K.: On deciding the non-emptiness of 2SAT polytopes with respect to first order queries. Math. Log. Q. 50(3), 281\u2013292 (2004)","journal-title":"Math. Log. Q."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s00453-016-0131-1","volume":"78","author":"K Subramani","year":"2017","unstructured":"Subramani, K., Wojciechowski, P.J.: A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. Algorithmica 78(1), 166\u2013208 (2017)","journal-title":"Algorithmica"},{"key":"16_CR21","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-0-387-39934-8_11","volume-title":"Perspectives in Operations Research","author":"RV Vohra","year":"2006","unstructured":"Vohra, R.V.: The ubiquitous Farkas\u2019 lemma. In: Alt, F.B., Fu, M.C., Golden, B.L. (eds.) Perspectives in Operations Research. ORCS, vol. 36, pp. 199\u2013210. Springer, New York (2006). \nhttps:\/\/doi.org\/10.1007\/978-0-387-39934-8_11"},{"key":"16_CR22","volume-title":"Model Building in Mathematical Programming","author":"HP Williams","year":"1999","unstructured":"Williams, H.P.: Model Building in Mathematical Programming, 4th edn. Wiley, Hoboken (1999)","edition":"4"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2019 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35166-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T10:03:25Z","timestamp":1573898605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35166-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030351656","9783030351663"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35166-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aiia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}