{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T10:07:30Z","timestamp":1722938850079},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1145\/74540.74584","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T12:11:45Z","timestamp":1069762305000},"page":"373-381","source":"Crossref","is-referenced-by-count":3,"title":["Employing path dissolution to shorten tableaux proofs"],"prefix":"10.1145","author":[{"given":"N. V.","family":"Murray","sequence":"first","affiliation":[]},{"given":"E.","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"320","event":{"number":"1989","sponsor":["SIGSAM, ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"acronym":"ISSAC '89","name":"the ACM-SIGSAM 1989 international symposium","start":{"date-parts":[[1989,7,17]]},"location":"Portland, Oregon, United States","end":{"date-parts":[[1989,7,19]]}},"container-title":["Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation - ISSAC '89"],"original-title":[],"link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=74584&ftid=8832&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,15]],"date-time":"2016-12-15T15:51:41Z","timestamp":1481817101000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=74540.74584"}},"subtitle":[],"proceedings-subject":"Symbolic and algebraic computation","short-title":[],"issued":{"date-parts":[[1989]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/74540.74584","relation":{},"subject":[],"published":{"date-parts":[[1989]]}}}