{"id":"https://openalex.org/W1594093112","doi":"https://doi.org/10.1007/3-540-46135-3_12","title":"A Hybrid Approach for SAT","display_name":"A Hybrid Approach for SAT","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1594093112","doi":"https://doi.org/10.1007/3-540-46135-3_12","mag":"1594093112"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46135-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46135-3_12","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/A5011839072","display_name":"Djamal Habet","orcid":"https://orcid.org/0000-0002-2901-4954"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Djamal Habet","raw_affiliation_strings":["Centre LGI2P, \u00e9ecole des Mines d\u2019Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France","Centre LGI2P, \u00e9ecole des Mines d'Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France"],"affiliations":[{"raw_affiliation_string":"Centre LGI2P, \u00e9ecole des Mines d\u2019Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France","institution_ids":[]},{"raw_affiliation_string":"Centre LGI2P, \u00e9ecole des Mines d'Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107369625","display_name":"Chu Min Li","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Chu Min Li","raw_affiliation_strings":["LaRIA, Universit\u00e9 de Picardie Jules Verne, 5, Rue du Moulin Neuf, 80000, Amiens, France"],"affiliations":[{"raw_affiliation_string":"LaRIA, Universit\u00e9 de Picardie Jules Verne, 5, Rue du Moulin Neuf, 80000, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003973140","display_name":"Laure Brisoux Devendeville","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laure Devendeville","raw_affiliation_strings":["LaRIA, Universit\u00e9 de Picardie Jules Verne, 5, Rue du Moulin Neuf, 80000, Amiens, France"],"affiliations":[{"raw_affiliation_string":"LaRIA, Universit\u00e9 de Picardie Jules Verne, 5, Rue du Moulin Neuf, 80000, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001025683","display_name":"Michel Vasquez","orcid":"https://orcid.org/0000-0001-6346-2550"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michel Vasquez","raw_affiliation_strings":["Centre LGI2P, \u00e9ecole des Mines d\u2019Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France","Centre LGI2P, \u00e9ecole des Mines d'Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France"],"affiliations":[{"raw_affiliation_string":"Centre LGI2P, \u00e9ecole des Mines d\u2019Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France","institution_ids":[]},{"raw_affiliation_string":"Centre LGI2P, \u00e9ecole des Mines d'Al\u00e8s, Site EERIE Parc Scientifique Georges Besse, 30035, Cedex 01, N\u00eees, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011839072"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6864,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.86764347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"184"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976999759674072,"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.9976999759674072,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9876000285148621,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9442449808120728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7345477938652039},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.6871305704116821},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.5603393316268921},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5410354137420654},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5398790836334229},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.538143515586853},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5186561942100525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5056331157684326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4842085838317871},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4540683627128601},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4472518563270569},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4324856102466583},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.426433801651001},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.39693647623062134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25671640038490295},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0906011164188385},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07325449585914612}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9442449808120728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7345477938652039},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.6871305704116821},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.5603393316268921},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5410354137420654},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5398790836334229},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.538143515586853},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5186561942100525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5056331157684326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4842085838317871},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4540683627128601},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4472518563270569},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4324856102466583},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.426433801651001},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.39693647623062134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25671640038490295},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0906011164188385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07325449585914612},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-46135-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46135-3_12","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"},{"id":"pmh:oai:HAL:hal-00359416v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00359416","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CP 2002 : principles and practice of constraint programming, Sep 2002, Ithaca NY, United States. pp.172-184, ⟨10.1007/3-540-46135-3_12⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4000000059604645,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W14839205","https://openalex.org/W30950413","https://openalex.org/W60032993","https://openalex.org/W1495369628","https://openalex.org/W1506611120","https://openalex.org/W1556434751","https://openalex.org/W1572277334","https://openalex.org/W1585537805","https://openalex.org/W1600919542","https://openalex.org/W1667614912","https://openalex.org/W1961775031","https://openalex.org/W2015932695","https://openalex.org/W2025399946","https://openalex.org/W2036265926","https://openalex.org/W2057361103","https://openalex.org/W2095435811","https://openalex.org/W2106440199","https://openalex.org/W2136950039","https://openalex.org/W2155218845","https://openalex.org/W2156708389","https://openalex.org/W2160444875","https://openalex.org/W2165372647","https://openalex.org/W2339500526","https://openalex.org/W2407714145","https://openalex.org/W2567722231","https://openalex.org/W2913258176","https://openalex.org/W4212899374","https://openalex.org/W4300496347","https://openalex.org/W6634300341","https://openalex.org/W6675949385","https://openalex.org/W6684615325"],"related_works":["https://openalex.org/W2037710955","https://openalex.org/W3098335909","https://openalex.org/W2008046591","https://openalex.org/W1593855989","https://openalex.org/W1967528652","https://openalex.org/W2605620386","https://openalex.org/W2610532450","https://openalex.org/W1594093112","https://openalex.org/W1999772761","https://openalex.org/W4252759566"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}