{"id":"https://openalex.org/W2276652507","doi":"https://doi.org/10.1145/2933575.2934532","title":"Deciding First-Order Satisfiability when Universal and Existential Variables are Separated","display_name":"Deciding First-Order Satisfiability when Universal and Existential Variables are Separated","publication_year":2016,"publication_date":"2016-07-05","ids":{"openalex":"https://openalex.org/W2276652507","doi":"https://doi.org/10.1145/2933575.2934532","mag":"2276652507"},"language":"en","primary_location":{"id":"doi:10.1145/2933575.2934532","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2934532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1511.08999","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Thomas Sturm","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["DE","FR"],"is_corresponding":true,"raw_author_name":"Thomas Sturm","raw_affiliation_strings":["CNRS, LORIA, Inria, and University of Lorraine, Nancy, France, and Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, LORIA, Inria, and University of Lorraine, Nancy, France, and Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I1294671590","https://openalex.org/I4210109712","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Marco Voigt","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marco Voigt","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany, and Graduate School of Computer Science, Saarland University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany, and Graduate School of Computer Science, Saarland University","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":null,"display_name":"Christoph Weidenbach","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Weidenbach","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210109712","https://openalex.org/I4210121838","https://openalex.org/I90183372"],"apc_list":null,"apc_paid":null,"fwci":1.3253,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86545987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"86","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9993000030517578,"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.9986000061035156,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.998199999332428,"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/arity","display_name":"Arity","score":0.8406000137329102},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7960000038146973},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6978999972343445},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6739000082015991},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.6665999889373779},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6212999820709229},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5625},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5005999803543091},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.40290001034736633}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.8406000137329102},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7960000038146973},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6978999972343445},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6739000082015991},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.6665999889373779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6334999799728394},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6212999820709229},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5625},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5005999803543091},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49549999833106995},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.40290001034736633},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.37299999594688416},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.34060001373291016},{"id":"https://openalex.org/C203264685","wikidata":"https://www.wikidata.org/wiki/Q2328174","display_name":"Atomic formula","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32499998807907104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3149999976158142},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.31139999628067017},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.29840001463890076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29750001430511475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.251800000667572},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2933575.2934532","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2934532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1511.08999","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.08999","pdf_url":"https://arxiv.org/pdf/1511.08999","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01389744v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01389744","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2016, Jul 2016, New York, United States. pp.86 - 95, ⟨10.1145/2933575.2934532⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1511.08999","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.08999","pdf_url":"https://arxiv.org/pdf/1511.08999","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W114225339","https://openalex.org/W1517830222","https://openalex.org/W1524356214","https://openalex.org/W1536511644","https://openalex.org/W1549008998","https://openalex.org/W1554551469","https://openalex.org/W1571999050","https://openalex.org/W1897269102","https://openalex.org/W1927589922","https://openalex.org/W1999468161","https://openalex.org/W2018189786","https://openalex.org/W2023472261","https://openalex.org/W2077264791","https://openalex.org/W2079943511","https://openalex.org/W2080220005","https://openalex.org/W2087567316","https://openalex.org/W2095689360","https://openalex.org/W2118601609","https://openalex.org/W2276652507","https://openalex.org/W4233684349","https://openalex.org/W4237721941"],"related_works":[],"abstract_inverted_index":{"We":[0,74],"introduce":[1],"a":[2,87],"new":[3,78,101],"decidable":[4],"fragment":[5,79],"of":[6,32,43,66,106,134],"first-order":[7],"logic":[8],"with":[9,109],"equality,":[10],"which":[11],"strictly":[12],"generalizes":[13],"two":[14],"already":[15],"well-known":[16],"ones---the":[17],"Bernays--Sch\u00f6nfinkel--Ramsey":[18],"(BSR)":[19],"Fragment":[20],"and":[21,85],"the":[22,29,41,57,64,71,77,81,92,100,104,110,114],"Monadic":[23],"Fragment.":[24],"The":[25],"defining":[26],"principle":[27],"is":[28,117],"syntactic":[30],"separation":[31],"universally":[33],"quantified":[34,38],"variables":[35],"from":[36],"existentially":[37],"ones":[39],"at":[40],"level":[42],"atoms.":[44],"Thus,":[45],"our":[46,135],"classification":[47],"neither":[48],"rests":[49],"on":[50,52,61,63,91],"restrictions":[51,62],"quantifier":[53,111],"prefixes":[54],"(as":[55,69],"in":[56,70,99],"BSR":[58],"case)":[59],"nor":[60],"arity":[65],"predicate":[67],"symbols":[68],"monadic":[72],"case).":[73],"demonstrate":[75],"that":[76],"exhibits":[80],"finite":[82],"model":[83],"property":[84],"derive":[86],"non-elementary":[88],"upper":[89],"bound":[90],"computing":[93],"time":[94],"required":[95],"for":[96,122],"deciding":[97],"satisfiability":[98,115],"fragment.":[102],"For":[103],"subfragment":[105],"prenex":[107],"sentences":[108],"prefix":[112],"\u2203*\u2200*\u2203*":[113],"problem":[116],"shown":[118],"to":[119],"be":[120],"complete":[121],"NEXPTIME.":[123],"Finally,":[124],"we":[125],"discuss":[126],"how":[127],"automated":[128],"reasoning":[129],"procedures":[130],"can":[131],"take":[132],"advantage":[133],"results.":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2016-06-24T00:00:00"}