{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:20:03Z","timestamp":1781076003548,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642042430","type":"print"},{"value":"9783642042447","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04244-7_41","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:17:24Z","timestamp":1252937844000},"page":"509-523","source":"Crossref","is-referenced-by-count":24,"title":["Conflict Resolution"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Korovin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nestan","family":"Tsiskaridze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-73368-3_34","volume-title":"Computer Aided Verification","author":"C. Barrett","year":"2007","unstructured":"Barrett, C., Cesare Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 298\u2013302. Springer, Heidelberg (2007)"},{"key":"41_CR2","unstructured":"Barrett, C., Ranise, S., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library, SMT-LIB (2008), \n                    \n                      http:\/\/www.SMT-LIB.org"},{"issue":"5","key":"41_CR3","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1093\/comjnl\/36.5.463","volume":"36","author":"V. Chandru","year":"1993","unstructured":"Chandru, V.: Variable elimination in linear constraints. Comput. J.\u00a036(5), 463\u2013472 (1993)","journal-title":"Comput. J."},{"key":"41_CR4","unstructured":"Chernikov, S.N.: Linejnye Neravenstva. Nauka, Moscow (1968) (in Russian)"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BFb0121242","volume":"1","author":"R.J. Duffin","year":"1974","unstructured":"Duffin, R.J.: On Fourier\u2019s analyse of linear inequality systems. Mathematical Programming Study\u00a01, 71\u201395 (1974)","journal-title":"Mathematical Programming Study"},{"key":"41_CR6","unstructured":"Imbert, J., Van Hentenryck, P.: A note on redundant linear constraints. Technical Report CS-92-11, CS Department, Brown University (1992)"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Maher, M.J., Roland, P.S., Yap, R.H.C.: Projecting CLP(\n                    \n                      \n                    \n                    $\\mathcal{R}$\n                  ) constraints. New Generation Computing\u00a011 (1993)","DOI":"10.1007\/BF03037187"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Kohler, D.A.: Projection of Convex Polyhedral Sets. PhD thesis, University of California, Barkaley (1967)","DOI":"10.21236\/AD0659301"},{"key":"41_CR9","unstructured":"Korovin, K., Voronkov, A.: Hard Reality Tool (submitted, 2009), \n                    \n                      http:\/\/www.cs.man.ac.uk\/~korovink\/hr"},{"key":"41_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11591191_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Nieuwenhuis","year":"2005","unstructured":"Nieuwenhuis, R., Oliveras, A.: Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools (Invited Paper). In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 23\u201346. Springer, Heidelberg (2005)"},{"key":"41_CR11","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04244-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:34:09Z","timestamp":1558269249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04244-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042430","9783642042447"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04244-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}