{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:29:10Z","timestamp":1648603750015},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0020-0190(93)90178-c","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T15:38:56Z","timestamp":1034005136000},"page":"61-66","source":"Crossref","is-referenced-by-count":7,"title":["A linear time algorithm for unique Horn satisfiability"],"prefix":"10.1016","volume":"48","author":[{"given":"Daniele","family":"Pretolani","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90178-C_BIB1","series-title":"CS-TR-92-5","article-title":"Unique satisfiability for Horn sets can be solved in nearly linear time","author":"Berman","year":"1992"},{"key":"10.1016\/0020-0190(93)90178-C_BIB2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"55","author":"Blass","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(93)90178-C_BIB3","article-title":"Polynomial-time inference of all valid implications for Horn and related formulas","volume":"1","author":"Boros","year":"1990","journal-title":"Ann. of Math. and AI"},{"key":"10.1016\/0020-0190(93)90178-C_BIB4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"1","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/0020-0190(93)90178-C_BIB5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/116873.116878","article-title":"Data structures and algorithms for disjoint set union problems","volume":"23","author":"Galil","year":"1991","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0190(93)90178-C_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"issue":"2\u20133","key":"10.1016\/0020-0190(93)90178-C_BIB7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","article-title":"Directed hypergraphs and applications","volume":"42","author":"Gallo","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(93)90178-C_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(85)90068-X","article-title":"Uniquely solvable quadratic boolean equations","volume":"12","author":"Hansen","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(93)90178-C_BIB9","article-title":"The Unique Horn-satisfiability problem and quadratic Boolean equations","author":"Minoux","year":"1988","journal-title":"Ann. of Math. and AI"},{"key":"10.1016\/0020-0190(93)90178-C_BIB10","series-title":"Ph.D. Thesis","article-title":"Satisfiability and hypergraphs","author":"Pretolani","year":"1992"},{"issue":"1","key":"10.1016\/0020-0190(93)90178-C_BIB11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"2","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390178C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390178C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:52:57Z","timestamp":1554760377000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390178C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["002001909390178C"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90178-c","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}