{"id":"https://openalex.org/W2088467794","doi":"https://doi.org/10.1080/00207160412331296625","title":"Proving completeness by logic","display_name":"Proving completeness by logic","publication_year":2004,"publication_date":"2004-12-22","ids":{"openalex":"https://openalex.org/W2088467794","doi":"https://doi.org/10.1080/00207160412331296625","mag":"2088467794"},"language":"en","primary_location":{"id":"doi:10.1080/00207160412331296625","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331296625","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5107073511","display_name":"Bruno Escoffier","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bruno Escoffier","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5111473903"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.689,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72666667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"82","issue":"2","first_page":"151","last_page":"161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9937000274658203,"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/T10142","display_name":"Formal Methods in Verification","score":0.9883999824523926,"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/completeness","display_name":"Completeness (order theory)","score":0.7655670046806335},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.7169458866119385},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6552606225013733},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6260882616043091},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.562629222869873},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4633972942829132},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.42209678888320923},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4210042655467987},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4136473834514618},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3538203835487366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2736522853374481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25956347584724426},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09496763348579407},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07280758023262024}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7655670046806335},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.7169458866119385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6552606225013733},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6260882616043091},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.562629222869873},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4633972942829132},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.42209678888320923},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4210042655467987},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4136473834514618},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3538203835487366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2736522853374481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25956347584724426},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09496763348579407},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07280758023262024},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160412331296625","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331296625","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W3127113455"],"related_works":["https://openalex.org/W2730960895","https://openalex.org/W2062731608","https://openalex.org/W587801111","https://openalex.org/W1589381382","https://openalex.org/W4312809402","https://openalex.org/W2606468876","https://openalex.org/W1547393828","https://openalex.org/W1828234149","https://openalex.org/W2384822215","https://openalex.org/W2082247452"],"abstract_inverted_index":{"We":[0,20],"first":[1],"give":[2],"a":[3,10,77,88],"proof":[4,27,50],"of":[5,13,25,31,46,76,99,105,119],"SAT's":[6],"NP-completeness":[7],"based":[8],"upon":[9,111],"syntactic":[11],"characterization":[12,90],"NP":[14,69],"given":[15],"by":[16,28,83],"Fagin":[17],"in":[18,44,52,74,108],"1974.":[19],"illustrate":[21],"the":[22,92,97,102,117],"central":[23],"part":[24],"our":[26],"giving":[29],"examples":[30],"how":[32,67],"two":[33],"well-known":[34],"problems,":[35,101],"MAX":[36],"INDEPENDENT":[37],"SET":[38],"and":[39],"3-COLORING,":[40],"can":[41,71],"be":[42,72],"expressed":[43,73],"terms":[45,75],"CNF.":[47],"This":[48],"new":[49,113],"is,":[51],"some":[53],"sense,":[54],"\u2018more":[55],"constructive\u2019":[56],"than":[57],"Cook's":[58],"classical":[59],"one,":[60],"as":[61],"we":[62,86,115],"need":[63],"only":[64],"to":[65],"show":[66],"an":[68],"problem":[70],"second-order":[78],"logical":[79,89],"formula.":[80],"Next,":[81],"inspired":[82],"Fagin's":[84],"characterization,":[85,114],"propose":[87],"for":[91],"class":[93,98],"NP-optimization":[94],"(NPO),":[95],"i.e.,":[96],"optimization":[100],"decision":[103],"versions":[104],"which":[106],"are":[107],"NP.":[109],"Based":[110],"this":[112],"demonstrate":[116],"Min-NPO-completeness":[118],"MIN":[120],"WSAT":[121],"under":[122],"strict":[123],"reductions.":[124]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}