{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:21:49Z","timestamp":1755220909185,"version":"3.43.0"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Studia Logica"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1023\/a:1004923723916","type":"journal-article","created":{"date-parts":[[2002,12,21]],"date-time":"2002-12-21T15:24:14Z","timestamp":1040484254000},"page":"261-272","source":"Crossref","is-referenced-by-count":0,"title":["Consequence Operations Based on Hypergraph Satisfiability"],"prefix":"10.1007","volume":"58","author":[{"given":"Adam","family":"Kolany","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"132587_CR1","first-page":"113","volume":"24","author":"R. H. Cowen","year":"1991","unstructured":"COWEN, R. H., 1991, \u201cHypergraph satisfiability\u201d, Reports on Mathematical Logic\n24, 113-118.","journal-title":"Reports on Mathematical Logic"},{"key":"132587_CR2","first-page":"29","volume":"27","author":"R. H. Cowen","year":"1993","unstructured":"COWEN, R. H., 1993, \u201cCombinatorial Analytic Tableaux\u201d, Reports on Mathematical Logic\n27, 29-39.","journal-title":"Reports on Mathematical Logic"},{"key":"132587_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF01057654","volume":"52","author":"A. Kolany","year":"1993","unstructured":"KOLANY, A., 1993, \u201cSatisfiability on hypergraphs\u201d, Studia Logica\n52, 393-404.","journal-title":"Studia Logica"},{"key":"132587_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(85)90227-0","volume":"38","author":"N. Linial","year":"1985","unstructured":"LINIAL, N., M. TARSI, 1985, \u201cDeciding hypergraph 2-colorability by H-resolution\u201d, Theoretical Computer Science\n38, 343-347.","journal-title":"Theoretical Computer Science"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1004923723916.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1004923723916\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1004923723916.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:23:54Z","timestamp":1754630634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1004923723916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["132587"],"URL":"https:\/\/doi.org\/10.1023\/a:1004923723916","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}