{"id":"https://openalex.org/W2307339663","doi":"https://doi.org/10.1093/logcom/exv059","title":"Boolean unification with predicates","display_name":"Boolean unification with predicates","publication_year":2015,"publication_date":"2015-09-08","ids":{"openalex":"https://openalex.org/W2307339663","doi":"https://doi.org/10.1093/logcom/exv059","mag":"2307339663"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exv059","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exv059","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-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/A5036624769","display_name":"Sebastian Eberhard","orcid":null},"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":"Sebastian Eberhard","raw_affiliation_strings":["Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, AT-1040 Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, AT-1040 Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058192101","display_name":"Stefan Hetzl","orcid":"https://orcid.org/0000-0002-6461-5982"},"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":true,"raw_author_name":"Stefan Hetzl","raw_affiliation_strings":["Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, AT-1040 Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, AT-1040 Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006764308","display_name":"Daniel S. Weller","orcid":"https://orcid.org/0000-0001-9818-7325"},"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":"Daniel Weller","raw_affiliation_strings":["Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, AT-1040 Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstrasse 8-10, AT-1040 Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058192101"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.4452,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78957555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":"1","first_page":"109","last_page":"128"},"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.9995999932289124,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9973000288009644,"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/unification","display_name":"Unification","score":0.7927688360214233},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.759386420249939},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.6993598937988281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6278603076934814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5574514865875244},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.5471611618995667},{"id":"https://openalex.org/keywords/complete-boolean-algebra","display_name":"Complete Boolean algebra","score":0.511072039604187},{"id":"https://openalex.org/keywords/predicate-logic","display_name":"Predicate logic","score":0.5045446157455444},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4738907217979431},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.42481765151023865},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.42314907908439636},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41380608081817627},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4112702012062073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.367264986038208},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.3480876684188843},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.2677743434906006},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23580196499824524},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1403239369392395},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.13905936479568481},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13453179597854614},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1136140525341034},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06773737072944641}],"concepts":[{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.7927688360214233},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.759386420249939},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.6993598937988281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6278603076934814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5574514865875244},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.5471611618995667},{"id":"https://openalex.org/C81518389","wikidata":"https://www.wikidata.org/wiki/Q5156447","display_name":"Complete Boolean algebra","level":5,"score":0.511072039604187},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.5045446157455444},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4738907217979431},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.42481765151023865},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.42314907908439636},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41380608081817627},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4112702012062073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.367264986038208},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3480876684188843},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2677743434906006},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23580196499824524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1403239369392395},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.13905936479568481},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13453179597854614},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1136140525341034},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06773737072944641},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/logcom/exv059","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exv059","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:open-archive.highwire.org:logcom:27/1/109","is_oa":false,"landing_page_url":"http://logcom.oxfordjournals.org/cgi/content/short/27/1/109","pdf_url":null,"source":{"id":"https://openalex.org/S4406923041","display_name":"HighWire Press Open Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"TEXT"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W14789509","https://openalex.org/W1536469384","https://openalex.org/W1583295953","https://openalex.org/W1659517711","https://openalex.org/W1981232804","https://openalex.org/W1986473353","https://openalex.org/W1986585422","https://openalex.org/W1988935908","https://openalex.org/W1994584977","https://openalex.org/W1999259832","https://openalex.org/W2006510146","https://openalex.org/W2012424011","https://openalex.org/W2033770248","https://openalex.org/W2040183410","https://openalex.org/W2052429743","https://openalex.org/W2057503265","https://openalex.org/W2059054133","https://openalex.org/W2065197261","https://openalex.org/W2100738443","https://openalex.org/W2569226415","https://openalex.org/W2612797815","https://openalex.org/W3022449549","https://openalex.org/W4230919050"],"related_works":["https://openalex.org/W4387318785","https://openalex.org/W4388397425","https://openalex.org/W117698297","https://openalex.org/W2479875366","https://openalex.org/W4147469","https://openalex.org/W2134288141","https://openalex.org/W2574949295","https://openalex.org/W1509357264","https://openalex.org/W84907364","https://openalex.org/W4302007441"],"abstract_inverted_index":{"In":[0,64],"this":[1],"article,":[2],"we":[3,10,108],"deal":[4],"with":[5,14,24,48,57,92,105,113,134],"the":[6,40,52,102,124,139,152],"following":[7,53],"problem":[8],"which":[9,71],"call":[11],"Boolean":[12,55,111,132],"unification":[13,56,112,133],"predicates:":[15],"For":[16,99],"a":[17,34,81,96],"given":[18,77],"formula":[19,36,41,75,82,97],"F[X]":[20],"in":[21,45,89,138],"first-order":[22,46,90],"logic":[23,47,91],"equality":[25],"containing":[26],"an":[27,68,73],"n-ary":[28],"predicate":[29],"variable":[30],"X\u2060,":[31],"is":[32,43,62,115],"there":[33,66],"quantifier-free":[35,60],"G[x1,\u2026,xn]":[37],"such":[38,84,95],"that":[39,85,110],"F[G]":[42,86],"valid":[44,88],"equality?":[49],"We":[50],"obtain":[51],"results.":[54],"predicates":[58,114,135],"for":[59,72,121,127,149,155],"F":[61,100,122],"\u03a02P-complete.":[63],"addition,":[65],"exists":[67],"EXPTIME":[69],"algorithm":[70],"input":[74],"F[X]\u2060,":[76],"as":[78],"above,":[79],"constructs":[80],"G":[83],"being":[87],"equality,":[93],"if":[94],"exists.":[98],"of":[101,123,131,141],"form":[103,125],"\u2200y\u00afF\u2032[X,y\u00af]":[104],"F\u2032":[106,128],"quantifier-free,":[107],"prove":[109],"already":[116],"undecidable.":[117],"The":[118],"same":[119],"holds":[120],"\u2203y\u00afF\u2032[X,y\u00af]":[126],"quantifier-free.":[129],"Instances":[130],"naturally":[136],"occur":[137],"context":[140],"automated":[142,153],"theorem":[143],"proving.":[144],"Our":[145],"results":[146],"are":[147],"relevant":[148],"cut-introduction":[150],"and":[151],"search":[154],"induction":[156],"invariants.":[157]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}
