{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:06:28Z","timestamp":1747177588027,"version":"3.40.5"},"reference-count":24,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[2020,9,2]]},"DOI":"10.1080\/0952813x.2019.1672798","type":"journal-article","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:24:25Z","timestamp":1570166665000},"page":"751-768","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["An extensible circuit-based SAT solver"],"prefix":"10.1080","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0677-8185","authenticated-orcid":false,"given":"Sajjad","family":"Siddiqi","sequence":"first","affiliation":[{"name":"Faculty of Computing, Riphah International University, Islamabad, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"key":"cit0001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_18"},{"key":"cit0002","first-page":"399","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI)","author":"Audemard G.","year":"2009"},{"volume-title":"Proceedings of the Workshop on Pragmatics of SAT (Workshop of SAT\u201912), Trento, Italy","year":"2012","author":"Audemard G.","key":"cit0003"},{"key":"cit0004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33558-7_11"},{"key":"cit0005","doi-asserted-by":"crossref","unstructured":"Barrett, C., Roberto Sebastiani, S. A. S. & Tinelli, C. (2009). Satisfiability modulo theories. In Clarke, E. M., Henzinger, T. A., Veith, H. & Bloem, R. (Eds.), Handbook of Model Checking (pp. 305\u2013343). Springer International Publishing, Cham.","DOI":"10.1007\/978-3-319-10575-8_11"},{"key":"cit0006","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"cit0007","doi-asserted-by":"crossref","unstructured":"Beanie, P., Kautz, H. & Sabharwal, A. (2003a). Using problem structure for efficient clause learning. In Giunchiglia, E. & Tacchella, A. (Eds.), Theory and Applications of Satisfiability Testing (pp. 242\u2013256), Berlin, Heidelberg. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-24605-3_19"},{"key":"cit0008","first-page":"1194","volume-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI)","author":"Beanie P.","year":"2003"},{"key":"cit0009","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"cit0010","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N. & S\u00f6rensson, N. (2003). An extensible SAT-solver. In Giunchiglia, E. & Tacchella, A. (Eds.), Theory and Applications of Satisfiability Testing (SAT) (pp. 502\u2013518), Berlin, Heidelberg. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"cit0011","first-page":"150","volume-title":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 14\u201316 November 2005","author":"Manquinho V. M.","year":"2005"},{"volume-title":"Proceedings of SAT competition 2018: Solver and benchmark descriptions","year":"2018","author":"Marijn J. H.","key":"cit0012"},{"key":"cit0013","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2008.4605925"},{"key":"cit0014","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4503"},{"key":"cit0015","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"cit0016","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72788-0_28"},{"key":"cit0017","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90062-2"},{"key":"cit0018","first-page":"581","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI)","author":"Siddiqi S.","year":"2007"},{"key":"cit0019","first-page":"1087","volume-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI)","author":"Siddiqi S. A.","year":"2011"},{"key":"cit0020","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30201-8_48"},{"volume-title":"Proceedings of SAT competition 2017: Solver and benchmark descriptions","year":"2017","author":"Tom Balyo M. J. H. H.","key":"cit0021"},{"key":"cit0022","volume-title":"Automation of reasoning: Classical papers in computational logic 1967\u20131970","volume":"2","author":"Tseitin G. S.","year":"1970"},{"key":"cit0023","first-page":"1313","volume-title":"DATE","author":"Wu C. A.","year":"2007"},{"key":"cit0024","first-page":"279","volume-title":"Proceedings of the 2001 IEEE\/ACM international conference on Computer-aided design (ICCAD)","author":"Zhang L.","year":"2001"}],"container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/0952813X.2019.1672798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,23]],"date-time":"2021-05-23T19:33:41Z","timestamp":1621798421000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/0952813X.2019.1672798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,3]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9,2]]}},"alternative-id":["10.1080\/0952813X.2019.1672798"],"URL":"https:\/\/doi.org\/10.1080\/0952813x.2019.1672798","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"type":"print","value":"0952-813X"},{"type":"electronic","value":"1362-3079"}],"subject":[],"published":{"date-parts":[[2019,10,3]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=teta20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=teta20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-02-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}