{"id":"https://openalex.org/W1583135763","doi":"https://doi.org/10.1007/978-3-540-69912-5_11","title":"Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model","display_name":"Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model","publication_year":2007,"publication_date":"2007-08-20","ids":{"openalex":"https://openalex.org/W1583135763","doi":"https://doi.org/10.1007/978-3-540-69912-5_11","mag":"1583135763"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-69912-5_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69912-5_11","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/A5078475872","display_name":"G\u00e1bor Kusper","orcid":"https://orcid.org/0000-0001-6969-1629"},"institutions":[{"id":"https://openalex.org/I120832542","display_name":"Eszterhazy Karoly Catholic University","ror":"https://ror.org/004gfgx38","country_code":"HU","type":"education","lineage":["https://openalex.org/I120832542"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"G\u00e1bor Kusper","raw_affiliation_strings":["Eszterh\u00e1zy K\u00e1roly College, Department of Information Technology, 1. sqr. Eszterh\u00e1zy , Eger 3300, Hungary","Eszterh\u00e1zy K\u00e1roly College, Department of Information Technology, Hungary#TAB#"],"affiliations":[{"raw_affiliation_string":"Eszterh\u00e1zy K\u00e1roly College, Department of Information Technology, 1. sqr. Eszterh\u00e1zy , Eger 3300, Hungary","institution_ids":["https://openalex.org/I120832542"]},{"raw_affiliation_string":"Eszterh\u00e1zy K\u00e1roly College, Department of Information Technology, Hungary#TAB#","institution_ids":["https://openalex.org/I120832542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078475872"],"corresponding_institution_ids":["https://openalex.org/I120832542"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4172,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64220654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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.9987999796867371,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.7987160682678223},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6665743589401245},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6634796857833862},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6210017204284668},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5946443676948547},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.512122631072998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5039369463920593},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.452359676361084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4224967360496521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.388824462890625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32767021656036377},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1368219256401062},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1169934868812561}],"concepts":[{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.7987160682678223},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6665743589401245},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6634796857833862},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6210017204284668},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5946443676948547},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.512122631072998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5039369463920593},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.452359676361084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4224967360496521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.388824462890625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32767021656036377},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1368219256401062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1169934868812561},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-69912-5_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69912-5_11","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W177642149","https://openalex.org/W1521505629","https://openalex.org/W1738704815","https://openalex.org/W1965913970","https://openalex.org/W1974010251","https://openalex.org/W1974563688","https://openalex.org/W1978253773","https://openalex.org/W1981549588","https://openalex.org/W2003160050","https://openalex.org/W2003979824","https://openalex.org/W2006146932","https://openalex.org/W2011992362","https://openalex.org/W2021870295","https://openalex.org/W2031823362","https://openalex.org/W2036265926","https://openalex.org/W2040475127","https://openalex.org/W2061917453","https://openalex.org/W2066749637","https://openalex.org/W2080416548","https://openalex.org/W2099844223","https://openalex.org/W2913068454","https://openalex.org/W4296415990"],"related_works":["https://openalex.org/W2039120963","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}