{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:24Z","timestamp":1725483864456},"publisher-location":"Berlin, Heidelberg","reference-count":2,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_71","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"775-776","source":"Crossref","is-referenced-by-count":0,"title":["A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design"],"prefix":"10.1007","author":[{"given":"Linda","family":"van Norden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"71_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1013847510365","volume":"6","author":"H. Maaren Van","year":"2002","unstructured":"Van Maaren, H., Dang, C., Simplicial pivoting algorithms for a tractable class of integer programs. Journal of Combinatorial Optimization, 6. 2002, 133\u2013142","journal-title":"Journal of Combinatorial Optimization"},{"key":"71_CR2","series-title":"DIM ACS Series Discrete Math. Theoret. Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1090\/dimacs\/035\/04","volume-title":"Relative size of certain polynomial time solvable subclasses of satisfiability","author":"J. Franco","year":"1997","unstructured":"Franco, J., Relative size of certain polynomial time solvable subclasses of satisfiability. DIM ACS Series Discrete Math. Theoret. Computer Science, volume 35. Amer.Math.Soc., Piscataway, NJ, 1997, 211\u2013233"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:20:17Z","timestamp":1550323217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}