iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/3-540-45349-0_37
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:11Z","timestamp":1725486071438},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410539"},{"type":"electronic","value":"9783540453499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45349-0_37","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T20:54:55Z","timestamp":1181163295000},"page":"495-499","source":"Crossref","is-referenced-by-count":2,"title":["Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances"],"prefix":"10.1007","author":[{"given":"Renato","family":"Bruni","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF00881805","volume":"15","author":"J. N. Hooker","year":"1995","unstructured":"J. N. Hooker and V. Vinay. Branching Rules for Satisfiability. Journal of Automated Reasoning, 15:359\u2013383, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"D. S. Johnson and M. A. Trick, editors. Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026"},{"key":"37_CR3","unstructured":"O. Kullmann. An application of matroid theory to the SAT Problem. ECCC TR00-018, Feb. 2000."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45349-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:40:22Z","timestamp":1556466022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}