{"id":"https://openalex.org/W2741154258","doi":"https://doi.org/10.29007/7jgq","title":"Towards a Semantics of Unsatisfiability Proofs with Inprocessing","display_name":"Towards a Semantics of Unsatisfiability Proofs with Inprocessing","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2741154258","doi":"https://doi.org/10.29007/7jgq","mag":"2741154258"},"language":"en","primary_location":{"id":"doi:10.29007/7jgq","is_oa":true,"landing_page_url":"https://doi.org/10.29007/7jgq","pdf_url":"https://easychair.org/publications/open/V8G","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":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/V8G","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090587947","display_name":"Tobias Philipp","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108298","display_name":"Dresden International University","ror":"https://ror.org/01t4pxy10","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210108298"]},{"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":"Tobias Philipp","raw_affiliation_strings":["International Center for Computational Logic Technische Universitt Dresden, 01062 Dresden, Germany","International Center for Computational Logic Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"International Center for Computational Logic Technische Universitt Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965","https://openalex.org/I4210108298"]},{"raw_affiliation_string":"International Center for Computational Logic Technische Universit\u00e4t Dresden, 01062 Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065502548","display_name":"Adri\u00e1n Rebola-Pardo","orcid":"https://orcid.org/0000-0001-9234-4377"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Adri\u00e1n Rebola-Pardo","raw_affiliation_strings":["TU Wien (Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien (Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090587947"],"corresponding_institution_ids":["https://openalex.org/I4210108298","https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":2.0193,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87849612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"46","issue":null,"first_page":"65","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9965000152587891,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9919999837875366,"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.8016337156295776},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5910754203796387},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5616231560707092},{"id":"https://openalex.org/keywords/tautology","display_name":"Tautology (logic)","score":0.5564678311347961},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.523317813873291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48140525817871094},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4274541437625885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4173865020275116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3927878141403198},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33209505677223206},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23121580481529236},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.08536621928215027}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8016337156295776},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5910754203796387},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5616231560707092},{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.5564678311347961},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.523317813873291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48140525817871094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4274541437625885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4173865020275116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3927878141403198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33209505677223206},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23121580481529236},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.08536621928215027},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"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/7jgq","is_oa":true,"landing_page_url":"https://doi.org/10.29007/7jgq","pdf_url":"https://easychair.org/publications/open/V8G","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":{"id":"doi:10.29007/7jgq","is_oa":true,"landing_page_url":"https://doi.org/10.29007/7jgq","pdf_url":"https://easychair.org/publications/open/V8G","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"},"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320321613","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30"},{"id":"https://openalex.org/F4320324720","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12"},{"id":"https://openalex.org/F4320337320","display_name":"Graduiertenakademie, Technische Universit\u00e4t Dresden","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2741154258.pdf","grobid_xml":"https://content.openalex.org/works/W2741154258.grobid-xml"},"referenced_works_count":54,"referenced_works":["https://openalex.org/W27762129","https://openalex.org/W66855977","https://openalex.org/W67346912","https://openalex.org/W78552530","https://openalex.org/W94961302","https://openalex.org/W134175813","https://openalex.org/W134339645","https://openalex.org/W189838518","https://openalex.org/W197442852","https://openalex.org/W1018878212","https://openalex.org/W1527970434","https://openalex.org/W1564470442","https://openalex.org/W1567586152","https://openalex.org/W1593151295","https://openalex.org/W1605798759","https://openalex.org/W1607926272","https://openalex.org/W1656268799","https://openalex.org/W1950282396","https://openalex.org/W1988882144","https://openalex.org/W1999997889","https://openalex.org/W2021870295","https://openalex.org/W2044560939","https://openalex.org/W2059644853","https://openalex.org/W2065793351","https://openalex.org/W2069767473","https://openalex.org/W2098022011","https://openalex.org/W2098508444","https://openalex.org/W2145199041","https://openalex.org/W2171790376","https://openalex.org/W2212515300","https://openalex.org/W2225800216","https://openalex.org/W2236514805","https://openalex.org/W2293411300","https://openalex.org/W2345876752","https://openalex.org/W2396056618","https://openalex.org/W2487961158","https://openalex.org/W2543800696","https://openalex.org/W2545814918","https://openalex.org/W2564212270","https://openalex.org/W2600082075","https://openalex.org/W2724300927","https://openalex.org/W2902287343","https://openalex.org/W2946631696","https://openalex.org/W4236614855","https://openalex.org/W4245385551","https://openalex.org/W4248733413","https://openalex.org/W4294345017","https://openalex.org/W6602667348","https://openalex.org/W6603822830","https://openalex.org/W6607712880","https://openalex.org/W6633967823","https://openalex.org/W6636213630","https://openalex.org/W6688484142","https://openalex.org/W6689868164"],"related_works":["https://openalex.org/W2373681119","https://openalex.org/W2389674975","https://openalex.org/W2360208354","https://openalex.org/W2019604532","https://openalex.org/W1601745317","https://openalex.org/W1605125458","https://openalex.org/W2083975113","https://openalex.org/W1993517298","https://openalex.org/W3097893064","https://openalex.org/W170300041"],"abstract_inverted_index":{"Delete":[0],"Resolution":[1],"Asymmetric":[2],"Tautology":[3],"(DRAT)":[4],"proofs":[5],"have":[6],"become":[7],"a":[8,94,113],"de":[9],"facto":[10],"standard":[11],"to":[12,79],"certify":[13],"unsatisfiability":[14],"results":[15],"from":[16,27],"SAT":[17],"solvers":[18],"with":[19,124],"inprocessing.":[20],"However,":[21],"DRAT":[22,31,128],"shows":[23],"behaviors":[24],"notably":[25],"different":[26],"other":[28],"proof":[29],"systems:":[30],"inferences":[32],"are":[33,39],"non-":[34],"monotonic,":[35],"and":[36,64,68],"clauses":[37,63],"that":[38,93],"not":[40],"consequences":[41],"of":[42,58,73,84,88],"the":[43,56,71],"premises":[44],"can":[45,99],"be":[46,100],"derived.":[47],"In":[48],"this":[49],"paper,":[50],"we":[51],"clarify":[52],"some":[53],"discrepancies":[54],"on":[55,106],"notions":[57],"reverse":[59],"unit":[60],"propagation":[61],"(RUP)":[62],"asymmetric":[65],"tautologies":[66],"(AT),":[67],"furthermore":[69,120],"develop":[70],"concept":[72],"resolution":[74],"consequences.":[75],"This":[76],"allows":[77],"us":[78],"present":[80],"an":[81],"intuitive":[82],"explanation":[83],"RAT":[85,117],"in":[86],"terms":[87],"permissive":[89],"definitions.":[90],"We":[91,119],"prove":[92],"formula":[95],"derived":[96],"using":[97],"RATs":[98],"stratified":[101],"into":[102],"clause":[103,125],"sets":[104],"depending":[105],"which":[107,111],"definitions":[108],"they":[109],"require,":[110],"give":[112],"strong":[114],"invariant":[115],"along":[116],"proofs.":[118],"study":[121],"its":[122],"interaction":[123],"deletion,":[126],"characterizing":[127],"derivability":[129],"as":[130],"satisfiability-preservation.":[131]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}