{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:38:49Z","timestamp":1648867129867},"reference-count":0,"publisher":"IOS Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.3233\/aic-2010-0488","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T17:31:04Z","timestamp":1575048664000},"page":"101-103","source":"Crossref","is-referenced-by-count":2,"title":["Max-SAT formalisms with hard and soft constraints"],"prefix":"10.3233","volume":"24","author":[{"given":"Josep","family":"Argelich","sequence":"first","affiliation":[]}],"member":"7437","container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-2010-0488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T17:31:05Z","timestamp":1575048665000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/AIC-2010-0488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011]]}},"URL":"http:\/\/dx.doi.org\/10.3233\/aic-2010-0488","relation":{},"ISSN":["0921-7126"],"issn-type":[{"value":"0921-7126","type":"print"}],"subject":[],"published":{"date-parts":[[2011]]}}}
