{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T02:09:42Z","timestamp":1771898982552,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8567,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/s0747-7171(08)80029-6","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T17:39:00Z","timestamp":1211996340000},"page":"185-206","source":"Crossref","is-referenced-by-count":78,"title":["An incremental method for generating prime implicants\/implicates"],"prefix":"10.1016","volume":"9","author":[{"given":"Alex","family":"Kean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Tsiknis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80029-6_bib1","author":"Biswas","year":"1975"},{"key":"10.1016\/S0747-7171(08)80029-6_bib2","author":"Bartee","year":"1962"},{"key":"10.1016\/S0747-7171(08)80029-6_bib3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(78)90168-1","article-title":"On the Number of Prime Implicants","volume":"24","author":"Chandra","year":"1978","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0747-7171(08)80029-6_bib4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A Computing Procedure for Quantification Theory","volume":"Vol. 7","author":"Davis","year":"1960","journal-title":"J. of the ACM"},{"key":"10.1016\/S0747-7171(08)80029-6_bib5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","article-title":"An Assumption-based TMS","volume":"28","author":"de Kleer","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0747-7171(08)80029-6_bib6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(87)90063-4","article-title":"Diagnosing Multiple Faults","volume":"32","author":"de Kleer","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0747-7171(08)80029-6_bib7","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/T-C.1974.224003","article-title":"A Method for Generating Prime Implicants of a Boolean Expression","volume":"June","author":"Hwa","year":"1974","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/S0747-7171(08)80029-6_bib8","series-title":"Proc. IEEE Southeastcon'85","first-page":"299","article-title":"A New Technique for the Minimization of Switching Functions","author":"Hwang","year":"1985"},{"key":"10.1016\/S0747-7171(08)80029-6_bib9","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(08)80029-6","article-title":"An Incremental Method for Generating Prime Implicants\/Implicates","author":"Kean","year":"1988"},{"key":"10.1016\/S0747-7171(08)80029-6_bib10","author":"Kohavi","year":"1978"},{"key":"10.1016\/S0747-7171(08)80029-6_bib11","article-title":"The Correctness of Tison's Method for Generating Prime Implicants","author":"Loui","year":"1982"},{"key":"10.1016\/S0747-7171(08)80029-6_bib12","series-title":"Proc. of AAAI-87","first-page":"183","article-title":"Foundations of Assumption-Based Truth Maintenance Systems: Preliminary Report","author":"Reiter","year":"1987"},{"key":"10.1016\/S0747-7171(08)80029-6_bib13","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TC.1977.1674913","article-title":"A New Technique for the Fast Minimization of Switching Functions","volume":"Vol. C-26\/8","author":"Rhyne","year":"1977","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/S0747-7171(08)80029-6_bib14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A Machine-Oriented Logic Based on the Resolution Principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. of ACM"},{"key":"10.1016\/S0747-7171(08)80029-6_bib15","series-title":"Proc. of IJCAI-69","first-page":"281","article-title":"Completeness Theorems for Semantics Resolution in Consequence Finding","author":"Slagle","year":"1969"},{"key":"10.1016\/S0747-7171(08)80029-6_bib16","article-title":"A new Algorithm for Generating Prime Implicants","volume":"Vol. C-19\/4","author":"Slagle","year":"1970","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/S0747-7171(08)80029-6_bib17","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/PGEC.1967.264648","article-title":"Generalized Consensus Theory and Application to the Minimization of Boolean Functions","volume":"EC-16\/4","author":"Tison","year":"1967","journal-title":"IEEE Trans. on Electronic Computers"},{"key":"10.1016\/S0747-7171(08)80029-6_bib18","article-title":"Clause Management Systems (CMS)","author":"Tsiknis","year":"1988"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800296?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800296?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T07:57:10Z","timestamp":1545983830000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108800296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["S0747717108800296"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80029-6","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}