{"id":"https://openalex.org/W2113995039","doi":"https://doi.org/10.1145/2071368.2071373","title":"The Complexity of Positive First-Order Logic without Equality","display_name":"The Complexity of Positive First-Order Logic without Equality","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2113995039","doi":"https://doi.org/10.1145/2071368.2071373","mag":"2113995039"},"language":"en","primary_location":{"id":"doi:10.1145/2071368.2071373","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2071368.2071373","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5044720498","display_name":"Florent Madelaine","orcid":"https://orcid.org/0000-0002-8528-7105"},"institutions":[{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Florent Madelaine","raw_affiliation_strings":["Clermont Univ\u00e9rsit, Univ\u00e9rsit d\u2019Auvergne"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clermont Univ\u00e9rsit, Univ\u00e9rsit d\u2019Auvergne","institution_ids":["https://openalex.org/I198244214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Barnaby Martin","raw_affiliation_strings":["Durham University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Durham University","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.34,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6405013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959999918937683,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/galois-connection","display_name":"Galois connection","score":0.8825892210006714},{"id":"https://openalex.org/keywords/surjective-function","display_name":"Surjective function","score":0.8525884747505188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8253447413444519},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7009211778640747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5319561958312988},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49938130378723145},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.4852032959461212},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4360229969024658},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.43568557500839233},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.425056517124176},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41346442699432373},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4099588096141815},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3751782774925232},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19069206714630127}],"concepts":[{"id":"https://openalex.org/C2777573902","wikidata":"https://www.wikidata.org/wiki/Q1491747","display_name":"Galois connection","level":2,"score":0.8825892210006714},{"id":"https://openalex.org/C119238805","wikidata":"https://www.wikidata.org/wiki/Q229102","display_name":"Surjective function","level":2,"score":0.8525884747505188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8253447413444519},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7009211778640747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5319561958312988},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49938130378723145},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.4852032959461212},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4360229969024658},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.43568557500839233},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.425056517124176},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41346442699432373},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4099588096141815},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3751782774925232},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19069206714630127},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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.1145/2071368.2071373","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2071368.2071373","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7300000190734863}],"awards":[{"id":"https://openalex.org/G1486157478","display_name":null,"funder_award_id":"EP/G020604/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1669105868","display_name":"Quantified Constraints and Generalisations","funder_award_id":"EP/G020604/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W32283539","https://openalex.org/W1510423293","https://openalex.org/W1571873445","https://openalex.org/W1580855424","https://openalex.org/W1648163531","https://openalex.org/W1668550623","https://openalex.org/W1830641757","https://openalex.org/W1968948791","https://openalex.org/W1995502606","https://openalex.org/W1997649256","https://openalex.org/W2025319967","https://openalex.org/W2052936500","https://openalex.org/W2077575555","https://openalex.org/W2105505307","https://openalex.org/W2116407296","https://openalex.org/W2124132452","https://openalex.org/W2150339067","https://openalex.org/W2154135898","https://openalex.org/W2561675875","https://openalex.org/W2565288900","https://openalex.org/W2915010338"],"related_works":["https://openalex.org/W4299845606","https://openalex.org/W2953260080","https://openalex.org/W2154135898","https://openalex.org/W1495098865","https://openalex.org/W2113995039","https://openalex.org/W1515598460","https://openalex.org/W1510423293","https://openalex.org/W1568528320","https://openalex.org/W3103522412","https://openalex.org/W2295040078"],"abstract_inverted_index":{"We":[0,38],"study":[1],"the":[2,29],"complexity":[3,65],"of":[4,9,28,75],"evaluating":[5],"positive":[6,54],"equality-free":[7,55],"sentences":[8],"first-order":[10],"(FO)":[11],"logic":[12],"over":[13,73],"a":[14,25,47,63],"fixed,":[15],"finite":[16],"structure":[17],"B":[18,36,71],".":[19],"This":[20],"may":[21],"be":[22],"seen":[23],"as":[24,70],"natural":[26],"generalisation":[27],"nonuniform":[30],"quantified":[31],"constraint":[32],"satisfaction":[33],"problem":[34,82],"QCSP(":[35],").":[37],"introduce":[39],"surjective":[40],"hyper-endomorphisms":[41],"and":[42],"use":[43],"them":[44],"in":[45,53,85],"proving":[46],"Galois":[48],"connection":[49],"that":[50],"characterizes":[51],"definability":[52],"FO.":[56],"Through":[57],"an":[58],"algebraic":[59],"method,":[60],"we":[61],"derive":[62],"complete":[64],"classification":[66],"for":[67],"our":[68],"problems":[69],"ranges":[72],"structures":[74],"size":[76],"at":[77],"most":[78],"three.":[79],"Specifically,":[80],"each":[81],"either":[83],"is":[84,87,89,92],"L,":[86],"NP-complete,":[88],"co-NP-complete,":[90],"or":[91],"Pspace-complete.":[93]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}