{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:53Z","timestamp":1720640753013},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s1571-0653(04)00320-8","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"162-173","source":"Crossref","is-referenced-by-count":23,"special_numbering":"C","title":["Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae"],"prefix":"10.1016","volume":"9","author":[{"given":"R.","family":"Bruni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00320-8_BIB1","first-page":"45","article-title":"Some structural and algorithmic properties of the maximum feasible subsystem problem","volume":"1610","author":"Amaldi","year":"1999"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB2","first-page":"77","article-title":"Approximate Algorithms and Heuristics for MAX-SAT","volume":"1","author":"Battiti","year":"1998"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB3","series-title":"A Complete Adaptive Algorithm for Prepositional Satisfiability. Technical Report 19-00","author":"Bruni","year":"2000"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB4","series-title":"Optimization Techniques for an Error Free Data Collecting. Technical Report 01-01","author":"Bruni","year":"2001"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB5","series-title":"Optimization Methods for Logical Inference","author":"Chandru","year":"1999"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","article-title":"Locating Minimal Infeasible Constraint Sets in Linear Programs","volume":"3","author":"Chinneck","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB7","first-page":"394","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Comm. Assoc. for Corn-put. Mach."},{"key":"10.1016\/S1571-0653(04)00320-8_BIB8","volume":"Volume 24","year":"2000"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB9","article-title":"Algorithms for the Satisfiability (SAT) Problem: A Survey","author":"Gu","year":"1999","journal-title":"DIM ACS Series in Discrete Mathematics, American Mathematical Society"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00881805","article-title":"Branching Rules for Satisfiability","volume":"15","author":"Hooker","year":"1995","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB11","series-title":"Cliques, Coloring, and Satisfiability, volume 26 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science","year":"1996"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB12","unstructured":"D.W. Loveland. Automated Theorem Proving: a Logical Basis. North Holland, 1978."},{"key":"10.1016\/S1571-0653(04)00320-8_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","article-title":"Solving satisfiability in less than 2n steps","volume":"10","author":"Monien","year":"1985","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1571-0653(04)00320-8_BIB14","series-title":"Effective Logic Computation","author":"Truemper","year":"1998"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003208?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:50:20Z","timestamp":1548597020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304003208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":14,"alternative-id":["S1571065304003208"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00320-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}