{"id":"https://openalex.org/W1530052040","doi":"https://doi.org/10.1007/978-3-540-68111-3_27","title":"JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check","display_name":"JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check","publication_year":2008,"publication_date":"2008-05-28","ids":{"openalex":"https://openalex.org/W1530052040","doi":"https://doi.org/10.1007/978-3-540-68111-3_27","mag":"1530052040"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-68111-3_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68111-3_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5073895931","display_name":"Daniel Singer","orcid":"https://orcid.org/0000-0001-5479-2806"},"institutions":[{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Daniel Singer","raw_affiliation_strings":["LITA - EA 3097, Universit\u00e9 Paul Verlaine - Metz, Metz cedex, France","LITA, Universit\u00e9 Paul Verlaine-Metz, Metz cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LITA - EA 3097, Universit\u00e9 Paul Verlaine - Metz, Metz cedex, France","institution_ids":["https://openalex.org/I4210148061"]},{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine-Metz, Metz cedex, France#TAB#","institution_ids":["https://openalex.org/I4210148061"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012789130","display_name":"Anthony Monnet","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anthony Monnet","raw_affiliation_strings":["LITA - EA 3097, Universit\u00e9 Paul Verlaine - Metz, Metz cedex, France","LITA, Universit\u00e9 Paul Verlaine-Metz, Metz cedex, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LITA - EA 3097, Universit\u00e9 Paul Verlaine - Metz, Metz cedex, France","institution_ids":["https://openalex.org/I4210148061"]},{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine-Metz, Metz cedex, France#TAB#","institution_ids":["https://openalex.org/I4210148061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073895931"],"corresponding_institution_ids":["https://openalex.org/I4210148061"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9307,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.83336894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"258"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9940000176429749,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9842000007629395,"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/satisfiability","display_name":"Satisfiability","score":0.7165518403053284},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7044324278831482},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6031593680381775},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5867709517478943},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5853571891784668},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5802716612815857},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.5598663687705994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5496717691421509},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.5237162709236145},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5063244104385376},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.4858681559562683},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4428722560405731},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44281649589538574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4322552978992462},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4282233715057373},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4134995937347412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4024478495121002},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33451640605926514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2364797294139862},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1873047649860382},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10125988721847534},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06450214982032776}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7165518403053284},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7044324278831482},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6031593680381775},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5867709517478943},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5853571891784668},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5802716612815857},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.5598663687705994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5496717691421509},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.5237162709236145},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5063244104385376},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.4858681559562683},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4428722560405731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44281649589538574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4322552978992462},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4282233715057373},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4134995937347412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4024478495121002},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33451640605926514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2364797294139862},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1873047649860382},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10125988721847534},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06450214982032776},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-68111-3_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68111-3_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W200045149","https://openalex.org/W1507988282","https://openalex.org/W1532006000","https://openalex.org/W1549462649","https://openalex.org/W1555678362","https://openalex.org/W1568031762","https://openalex.org/W1580458916","https://openalex.org/W1583130056","https://openalex.org/W1589918049","https://openalex.org/W1600913231","https://openalex.org/W1606555018","https://openalex.org/W1686746446","https://openalex.org/W1832793528","https://openalex.org/W1966350062","https://openalex.org/W1970590090","https://openalex.org/W2015372451","https://openalex.org/W2038264652","https://openalex.org/W2057361103","https://openalex.org/W2105210717","https://openalex.org/W2131761962","https://openalex.org/W2143992647","https://openalex.org/W2169084680","https://openalex.org/W2561675875","https://openalex.org/W2986773320","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1970590090","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}