乐胖代购免代理版

{"id":"https://openalex.org/W2170622195","doi":"https://doi.org/10.1109/foci.2007.372174","title":"A New Reduction from 3SAT to n-Partite Graphs","display_name":"A New Reduction from 3SAT to n-Partite Graphs","publication_year":2007,"publication_date":"2007-04-01","ids":{"openalex":"https://openalex.org/W2170622195","doi":"https://doi.org/10.1109/foci.2007.372174","mag":"2170622195"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/foci.2007.372174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www0.cs.ucl.ac.uk/staff/d.hulme/docs/Hulme FOCI07.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056711051","display_name":"Daniel Hulme","orcid":"https://orcid.org/0000-0001-7649-2361"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel J Hulme","raw_affiliation_strings":["Department of Computer Science, University College London, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College London, London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009832059","display_name":"Robin Hirsch","orcid":"https://orcid.org/0000-0002-2983-4178"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robin Hirsch","raw_affiliation_strings":["Department of Computer Science, University College London, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College London, London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108402432","display_name":"Bernard F. Buxton","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bernard F Buxton","raw_affiliation_strings":["Department of Computer Science, University College London, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College London, London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025214993","display_name":"R. Beau Lotto","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"R.Beau Lotto","raw_affiliation_strings":["Department of Computer Science, University College London, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College London, London, UK","institution_ids":["https://openalex.org/I45129253"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.206067,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":63,"max":70},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"238"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9999,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9999,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9965,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.7442906},{"id":"https://openalex.org/keywords/representation","display_name":"Representation","score":0.54275537},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.52024615},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.46655935}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7513945},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.7442906},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.66374063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5731715},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.54275537},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.52024615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5187483},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.51349574},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.49625045},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.46655935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37577695},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3247601},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3043077},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2612275},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/foci.2007.372174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.2939","pdf_url":"http://www0.cs.ucl.ac.uk/staff/d.hulme/docs/Hulme FOCI07.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.2939","pdf_url":"http://www0.cs.ucl.ac.uk/staff/d.hulme/docs/Hulme FOCI07.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.59}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":13,"referenced_works":["https://openalex.org/W1487965496","https://openalex.org/W1627230931","https://openalex.org/W1685626019","https://openalex.org/W1793685185","https://openalex.org/W1979914370","https://openalex.org/W1997491141","https://openalex.org/W2011039300","https://openalex.org/W2029256254","https://openalex.org/W2036265926","https://openalex.org/W2043193943","https://openalex.org/W2047749000","https://openalex.org/W2148546044","https://openalex.org/W2165813048"],"related_works":["https://openalex.org/W4399433994","https://openalex.org/W3124056051","https://openalex.org/W2408711288","https://openalex.org/W2322595442","https://openalex.org/W2128006027","https://openalex.org/W2095156144","https://openalex.org/W2094368841","https://openalex.org/W2048447692","https://openalex.org/W2007316622","https://openalex.org/W1024451821"],"abstract_inverted_index":{"The":[0],"constraint":[1],"satisfaction":[2],"problem":[3,35],"(CSP)":[4],"is":[5,67],"one":[6],"of":[7,30,52,55,60,137],"the":[8,33,53,58,100,107,132],"most":[9],"prominent":[10],"problems":[11],"in":[12,24,36,71,117],"artificial":[13],"intelligence,":[14],"logic,":[15],"theoretical":[16],"computer":[17],"science,":[18],"engineering":[19],"and":[20,26,44,92,128,135],"many":[21,112],"other":[22],"areas":[23],"science":[25],"industry.":[27],"One":[28],"instance":[29],"a":[31,76,124,140],"CSP,":[32],"satisfiability":[34],"propositional":[37,62],"logic":[38],"(SAT),":[39],"has":[40,45,97],"become":[41],"increasingly":[42],"popular":[43],"illuminated":[46],"important":[47],"insights":[48],"into":[49],"our":[50],"understanding":[51],"fundamentals":[54],"computation.":[56],"Though":[57],"concept":[59],"representing":[61],"formulae":[63],"as":[64],"n-partite":[65],"graphs":[66,91],"certainly":[68],"not":[69],"novel,":[70],"this":[72,95,118],"paper":[73],"we":[74,109,130],"introduce":[75],"new":[77],"polynomial":[78],"reduction":[79,108],"from":[80],"3SAT":[81,114],"to":[82],"G":[83],"7":[86],"":[87],"n":[90],"demonstrate":[93],"that":[94,111],"framework":[96,119],"advantages":[98,134],"over":[99],"standard":[101],"representation.":[102],"More":[103],"specifically,":[104],"after":[105],"presenting":[106],"show":[110],"hard":[113],"instances":[115],"represented":[116],"can":[120],"be":[121],"solved":[122],"using":[123,138],"basic":[125],"path-consistency":[126],"algorithm,":[127],"finally":[129],"discuss":[131],"potential":[133],"implications":[136],"such":[139],"representation":[141]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2170622195","counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2024-12-11T21:29:59.662263","created_date":"2016-06-24"}