{"id":"https://openalex.org/W2145199041","doi":null,"title":"Verification of Proofs of Unsatisfiability for CNF Formulas","display_name":"Verification of Proofs of Unsatisfiability for CNF Formulas","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2145199041","mag":"2145199041"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.9339","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.9339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eigold.tripod.com/papers/proof_verif.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110233881","display_name":"Evguenii I. Goldberg","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Evgueni Goldberg","raw_affiliation_strings":["Cadence Berkeley Lab., USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cadence Berkeley Lab., USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022222469","display_name":"Yakov Novikov","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Yakov Novikov","raw_affiliation_strings":["National Academy of Sciences, Belarus\u201d"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Academy of Sciences, Belarus\u201d","institution_ids":["https://openalex.org/I151823869"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.1107,"has_fulltext":false,"cited_by_count":143,"citation_normalized_percentile":{"value":0.99152308,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9688000082969666,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9688000082969666,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.012799999676644802,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.008799999952316284,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unsatisfiability-proofs","display_name":"unsatisfiability proofs","score":0.8289999961853027},{"id":"https://openalex.org/keywords/cnf-formulas","display_name":"CNF formulas","score":0.8809999823570251},{"id":"https://openalex.org/keywords/proof-verification","display_name":"proof verification","score":0.8399999737739563},{"id":"https://openalex.org/keywords/sat-solvers","display_name":"SAT solvers","score":0.8600000143051147},{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.7170000076293945}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8655556440353394},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6959932446479797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6916061639785767},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6357007026672363},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5682120323181152},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5417332053184509},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5397174954414368},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5260236859321594},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5019919872283936},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4976330101490021},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4770776033401489},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42825955152511597},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.42245250940322876},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40478476881980896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3749672770500183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23501098155975342},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.9339","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.9339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eigold.tripod.com/papers/proof_verif.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.272","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sigda.org/Archives/ProceedingArchives/Date/papers/2003/date03/htmfiles/sun_sgi/frames/../../../pdffiles/09d_2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1511155470","https://openalex.org/W1556434751","https://openalex.org/W1593151295","https://openalex.org/W2024148935","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2075959177","https://openalex.org/W2096307462","https://openalex.org/W2105761964","https://openalex.org/W2108637261","https://openalex.org/W2117783862","https://openalex.org/W2139171217","https://openalex.org/W2142785340","https://openalex.org/W2160444875","https://openalex.org/W2408006898","https://openalex.org/W3045969830"],"related_works":["https://openalex.org/W3005406813","https://openalex.org/W1821069006","https://openalex.org/W7097274699","https://openalex.org/W7100881530","https://openalex.org/W1593288312","https://openalex.org/W1911923721","https://openalex.org/W1593151295","https://openalex.org/W2734612968","https://openalex.org/W7095621713","https://openalex.org/W7096818952"],"abstract_inverted_index":{"As":[0,87],"SAT-algorithms":[1],"become":[2],"more":[3,5],"and":[4,50],"complex,":[6],"there":[7],"is":[8,16,22,44,48],"little":[9],"chance":[10],"of":[11,18,23,62,72,84,97,104,114],"writing":[12],"a":[13,35,88,111],"SAT-solver":[14],"that":[15],"free":[17],"bugs.":[19],"So":[20],"it":[21],"great":[24],"importance":[25],"to":[26,29,41,67],"be":[27,42,52],"able":[28],"verify":[30],"the":[31,38,56,60,64,70,73,82,90,98,105,120],"information":[32],"returned":[33],"by":[34,55],"SAT-solver.":[36,74],"If":[37],"CNF":[39,100,117],"formula":[40],"tested":[43,109],"satisfiable,":[45],"solution":[46],"verification":[47,122],"trivial":[49],"can":[51],"easily":[53],"done":[54],"user.":[57],"However,":[58],"in":[59],"case":[61],"unsatisfiability,":[63],"user":[65],"has":[66],"rely":[68],"on":[69,110],"reputation":[71],"We":[75],"describe":[76],"an":[77,94],"efficient":[78],"procedure":[79,92,107],"for":[80],"checking":[81],"correctness":[83],"unsatisfiability":[85],"proofs.":[86],"by-product,":[89],"proposed":[91,106],"finds":[93],"unsatisfiable":[95],"core":[96],"initial":[99],"formula.":[101],"The":[102],"efficiency":[103],"was":[108],"representative":[112],"set":[113],"large":[115],"\"real-life\"":[116],"formulas":[118],"from":[119],"formal":[121],"domain.":[123]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}