{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:24:08Z","timestamp":1769315048864,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642213106","type":"print"},{"value":"9783642213113","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_21","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"215-229","source":"Crossref","is-referenced-by-count":3,"title":["A New Algorithm for Linear and Integer Feasibility in Horn Constraints"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worthington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1007\/978-3-642-10631-6_112","volume-title":"Algorithms and Computation","author":"R. Chandrasekaran","year":"2009","unstructured":"Chandrasekaran, R., Subramani, K.: A combinatorial algorithm for horn programs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1114\u20131123. Springer, Heidelberg (2009)"},{"key":"21_CR2","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, New York (1999)"},{"key":"21_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"21_CR4","first-page":"73","volume":"13","author":"J. Lever","year":"1995","unstructured":"Lever, J., Wallace, M., Richards, B.: Constraint logic programming for scheduling and planning. British Telecom Technology Journal\u00a013, 73\u201380 (1995)","journal-title":"British Telecom Technology Journal"},{"key":"21_CR5","unstructured":"Truemper, K.: Personal communication (2003)"},{"key":"21_CR6","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. Higher-Order and Symbolic Computation\u00a019, 31\u2013100 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"21_CR7","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"},{"key":"21_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3544-4","volume-title":"Computability and Complexity Theory","author":"S. Homer","year":"2001","unstructured":"Homer, S., Selman, A.L.: Computability and Complexity Theory. Springer, Heidelberg (2001)"},{"key":"21_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-25984-8_14","volume-title":"Automated Reasoning","author":"L. de Moura","year":"2004","unstructured":"de Moura, L., Owre, S., Rue\u00df, H., Rushby, J., Shankar, N.: The ICS decision procedures for embedded deduction. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 218\u2013222. Springer, Heidelberg (2004)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Ford, J., Shankar, N.: Formal verification of a combination decision procedure. In: CADE, pp. 347\u2013362 (2002)","DOI":"10.1007\/3-540-45620-1_29"},{"key":"21_CR11","unstructured":"Duterre, B., de Moura, L.: The yices smt solver. Technical report, SRI International (2006)"},{"key":"21_CR12","unstructured":"Harvey, W., Stuckey, P.J.: A unit two variable per inequality integer constraint solver for constraint logic programming. In: Proceedings of the 20th Australasian Computer Science Conference, pp. 102\u2013111 (1997)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","volume":"19","author":"H.R. Lewis","year":"1982","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Symmetric space-bounded computation. Theor. Comput. Sci.\u00a019, 161\u2013187 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR14","first-page":"84","volume-title":"Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL 1978","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL 1978, pp. 84\u201396. ACM, New York (1978)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"P.G. Jeavons","year":"1995","unstructured":"Jeavons, P.G., Cooper, M.C.: Tractable constraints on ordered domains. Artif. Intell.\u00a079, 327\u2013339 (1995)","journal-title":"Artif. Intell."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1013847510365","volume":"6","author":"H. van Maaren","year":"2002","unstructured":"van Maaren, H., Dang, C.: Simplicial pivoting algorithms for a tractable class of integer programs. J. Comb. Optim.\u00a06, 133\u2013142 (2002)","journal-title":"J. Comb. Optim."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res.\u00a034, 250\u2013256 (1986)","journal-title":"Oper. Res."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing\u00a024, 494\u2013504 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ipl.2008.09.028","volume":"109","author":"E. Liberty","year":"2009","unstructured":"Liberty, E., Zucker, S.W.: The mailman algorithm: A note on matrix\u2013vector multiplication. Inf. Process. Lett.\u00a0109, 179\u2013182 (2009)","journal-title":"Inf. Process. Lett."},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.3233\/SAT190030","volume":"3","author":"S.A. Seshia","year":"2007","unstructured":"Seshia, S.A., Subramani, K., Bryant, R.E.: On solving boolean combinations of UTVPI constraints. Journal on Satisfiability, Boolean Modeling and Computation\u00a03, 67\u201390 (2007)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:04:41Z","timestamp":1609203881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}