{"id":"https://openalex.org/W2787626091","doi":"https://doi.org/10.29007/vr7n","title":"The Potential of Interference-Based Proof Systems","display_name":"The Potential of Interference-Based Proof Systems","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2787626091","doi":"https://doi.org/10.29007/vr7n","mag":"2787626091"},"language":"en","primary_location":{"id":"doi:10.29007/vr7n","is_oa":true,"landing_page_url":"https://doi.org/10.29007/vr7n","pdf_url":"https://easychair.org/publications/open/TWVW","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/TWVW","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marijn Heule","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Austin"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065492303","display_name":"Benjamin Kiesl","orcid":"https://orcid.org/0000-0003-3522-3653"},"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":"Benjamin Kiesl","raw_affiliation_strings":["Institute of Information Systems, Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems, Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025921874"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.4887,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.71324367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"51","issue":null,"first_page":"51","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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.9976999759674072,"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/T10142","display_name":"Formal Methods in Verification","score":0.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7177887558937073},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6594662070274353},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6417964696884155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5758057832717896},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.5540611743927002},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.5313853621482849},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.515614926815033},{"id":"https://openalex.org/keywords/well-formed-formula","display_name":"Well-formed formula","score":0.5103356242179871},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.48721808195114136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4584465026855469},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4353460669517517},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.42553484439849854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35038256645202637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3339945673942566},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33111655712127686},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.2351706624031067},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.17561274766921997},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15973129868507385},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.12637203931808472}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7177887558937073},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6594662070274353},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6417964696884155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5758057832717896},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5540611743927002},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.5313853621482849},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.515614926815033},{"id":"https://openalex.org/C191222856","wikidata":"https://www.wikidata.org/wiki/Q655328","display_name":"Well-formed formula","level":5,"score":0.5103356242179871},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.48721808195114136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4584465026855469},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4353460669517517},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.42553484439849854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35038256645202637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3339945673942566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33111655712127686},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2351706624031067},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.17561274766921997},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15973129868507385},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.12637203931808472}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/vr7n","is_oa":true,"landing_page_url":"https://doi.org/10.29007/vr7n","pdf_url":"https://easychair.org/publications/open/TWVW","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/vr7n","is_oa":true,"landing_page_url":"https://doi.org/10.29007/vr7n","pdf_url":"https://easychair.org/publications/open/TWVW","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.5099999904632568,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2787626091.pdf","grobid_xml":"https://content.openalex.org/works/W2787626091.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W134339645","https://openalex.org/W1567586152","https://openalex.org/W2021870295","https://openalex.org/W2133527541","https://openalex.org/W2547601025","https://openalex.org/W2735859735","https://openalex.org/W4245630182"],"related_works":["https://openalex.org/W2081976468","https://openalex.org/W4251854500","https://openalex.org/W1986625420","https://openalex.org/W4287027977","https://openalex.org/W3202260027","https://openalex.org/W3173374788","https://openalex.org/W2354868948","https://openalex.org/W162456987","https://openalex.org/W1483549243","https://openalex.org/W2360211924"],"abstract_inverted_index":{"In":[0],"our":[1],"extended":[2],"abstract,":[3],"we":[4],"try":[5],"to":[6,9],"motivate":[7],"researchers":[8],"investigate":[10],"the":[11,51],"potential":[12],"of":[13,21,26,53,57],"proof":[14],"systems":[15],"that":[16,34],"modify":[17],"a":[18,24,32,54],"given":[19,55],"set":[20,25,56],"formulas":[22],"(e.g.,":[23],"clauses":[27],"in":[28,31],"propositional":[29],"logic)":[30],"way":[33],"preserves":[35],"satisfiability":[36],"but":[37],"not":[38],"necessarily":[39],"logical":[40],"equivalence.":[41],"We":[42],"call":[43],"such":[44],"modifications":[45],"interferences,":[46],"because":[47],"they":[48],"can":[49],"change":[50],"models":[52],"formulas.":[58]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}