{"id":"https://openalex.org/W2946631696","doi":"https://doi.org/10.29007/8w4v","title":"Checking Unsatisfiability Proofs in Parallel","display_name":"Checking Unsatisfiability Proofs in Parallel","publication_year":2019,"publication_date":"2019-03-15","ids":{"openalex":"https://openalex.org/W2946631696","doi":"https://doi.org/10.29007/8w4v","mag":"2946631696"},"language":"en","primary_location":{"id":"doi:10.29007/8w4v","is_oa":false,"landing_page_url":"https://doi.org/10.29007/8w4v","pdf_url":null,"source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5025110435","display_name":"Norbert Manthey","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Norbert Manthey","raw_affiliation_strings":["Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090587947","display_name":"Tobias Philipp","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Philipp","raw_affiliation_strings":["Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Knowledge Representation and Reasoning Group Technische Universit\u00e4t Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025110435"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07685203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"59","issue":null,"first_page":"34","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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.9987999796867371,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9927999973297119,"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"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9914000034332275,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.949488639831543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7288838624954224},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.6487376093864441},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4738210439682007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41612663865089417},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4131402373313904},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24330800771713257},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09519729018211365}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.949488639831543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7288838624954224},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.6487376093864441},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4738210439682007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41612663865089417},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4131402373313904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24330800771713257},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09519729018211365},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/8w4v","is_oa":false,"landing_page_url":"https://doi.org/10.29007/8w4v","pdf_url":null,"source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W27762129","https://openalex.org/W46694604","https://openalex.org/W134175813","https://openalex.org/W134339645","https://openalex.org/W203799144","https://openalex.org/W1018878212","https://openalex.org/W1541238879","https://openalex.org/W1911923721","https://openalex.org/W1988882144","https://openalex.org/W1991066194","https://openalex.org/W2048051309","https://openalex.org/W2171790376","https://openalex.org/W2400663584","https://openalex.org/W4245385551","https://openalex.org/W4293542274"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W4289687320","https://openalex.org/W925418074","https://openalex.org/W2119610731"],"abstract_inverted_index":{"Contemporary":[0],"SAT":[1],"solvers":[2],"emit":[3],"unsatisfiability":[4,30],"proofs":[5,34,68],"in":[6,13],"the":[7,60],"DRAT":[8],"format":[9],"to":[10,27,47,90],"increase":[11],"confidence":[12],"their":[14],"answers.":[15],"The":[16],"state-of-the-art":[17],"proof":[18],"verifier":[19],"drat-trim":[20],"uses":[21],"backward-":[22,61],"checking":[23,62],"and":[24,43,82],"deletion":[25],"information":[26],"efficiently":[28],"check":[29],"results.":[31],"Checking":[32],"large":[33],"still":[35],"takes":[36],"as":[37,39],"long":[38],"solving":[40],"a":[41,49,79,83],"formula,":[42],"therefore":[44],"parallelization":[45,58,80],"seems":[46],"be":[48],"promising":[50],"approach.":[51],"However,":[52],"Heule":[53],"et":[54],"al.":[55],"stated":[56],"that":[57,86],"of":[59],"procedure":[63],"is":[64],"difficult":[65],"since":[66],"clausal":[67],"do":[69],"not":[70],"include":[71],"dependency":[72],"information.":[73],"In":[74],"this":[75],"paper,":[76],"we":[77],"present":[78],"approach":[81],"prototypical":[84],"implementation":[85],"scales":[87],"reasonably":[88],"compared":[89],"its":[91],"sequential":[92],"version.":[93]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}