{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T17:12:49Z","timestamp":1712423569465},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Logic Journal of IGPL"],"published-print":{"date-parts":[[1999,7,1]]},"DOI":"10.1093\/jigpal\/7.4.547","type":"journal-article","created":{"date-parts":[[2004,11,11]],"date-time":"2004-11-11T20:29:39Z","timestamp":1100204979000},"page":"547-554","source":"Crossref","is-referenced-by-count":8,"title":["A finite relation algebra with undecidable network satisfaction problem"],"prefix":"10.1093","volume":"7","author":[{"given":"R","family":"Hirsch","sequence":"first","affiliation":[]}],"member":"286","container-title":["Logic Journal of IGPL"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/jigpal\/article-pdf\/7\/4\/547\/2582036\/070547.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T12:18:02Z","timestamp":1503490682000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article-lookup\/doi\/10.1093\/jigpal\/7.4.547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/7.4.547","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,7,1]]}}}