{"id":"https://openalex.org/W4234414781","doi":"https://doi.org/10.1109/date.2003.1253706","title":"Local search for Boolean relations on the basis of unit propagation","display_name":"Local search for Boolean relations on the basis of unit propagation","publication_year":2003,"publication_date":"2003-12-22","ids":{"openalex":"https://openalex.org/W4234414781","doi":"https://doi.org/10.1109/date.2003.1253706"},"language":"en","primary_location":{"id":"doi:10.1109/date.2003.1253706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2003.1253706","pdf_url":null,"source":{"id":"https://openalex.org/S4363607952","display_name":"2003 Design, Automation and Test in Europe Conference and Exhibition","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 Design, Automation and Test in Europe Conference and Exhibition","raw_type":"proceedings-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/A5071857442","display_name":"Y. Novikov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":true,"raw_author_name":"Y. Novikov","raw_affiliation_strings":["United Institute of Informatics Problems, National Academy of Science of Belarus, Belarus"],"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems, National Academy of Science of Belarus, Belarus","institution_ids":["https://openalex.org/I4210105192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071857442"],"corresponding_institution_ids":["https://openalex.org/I4210105192"],"apc_list":null,"apc_paid":null,"fwci":1.6631,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.83773585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":null,"first_page":"810","last_page":"815"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9987999796867371,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7131835222244263},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.7044167518615723},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.6599945425987244},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6458371877670288},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.609318733215332},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.558456301689148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5534713268280029},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.521264374256134},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5020444393157959},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.48474857211112976},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.48411524295806885},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47022199630737305},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45076310634613037},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.4263990521430969},{"id":"https://openalex.org/keywords/unit-interval","display_name":"Unit interval","score":0.4110351502895355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39670684933662415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34531351923942566},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.27830660343170166},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1644740104675293},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1176702082157135}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7131835222244263},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.7044167518615723},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.6599945425987244},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6458371877670288},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.609318733215332},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.558456301689148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5534713268280029},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.521264374256134},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5020444393157959},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.48474857211112976},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.48411524295806885},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47022199630737305},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45076310634613037},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4263990521430969},{"id":"https://openalex.org/C128394911","wikidata":"https://www.wikidata.org/wiki/Q1987578","display_name":"Unit interval","level":2,"score":0.4110351502895355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39670684933662415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34531351923942566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27830660343170166},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1644740104675293},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1176702082157135},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2003.1253706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2003.1253706","pdf_url":null,"source":{"id":"https://openalex.org/S4363607952","display_name":"2003 Design, Automation and Test in Europe Conference and Exhibition","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 Design, Automation and Test in Europe Conference and Exhibition","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W87194468","https://openalex.org/W1511155470","https://openalex.org/W1973267383","https://openalex.org/W1979093351","https://openalex.org/W2024148935","https://openalex.org/W2044560939","https://openalex.org/W2119241964","https://openalex.org/W2135613306","https://openalex.org/W2140132043","https://openalex.org/W2147897801","https://openalex.org/W2162928907","https://openalex.org/W4243399171","https://openalex.org/W4250620173","https://openalex.org/W6603509382","https://openalex.org/W6630643794"],"related_works":["https://openalex.org/W2135610719","https://openalex.org/W2111523115","https://openalex.org/W4234414781","https://openalex.org/W2529689007","https://openalex.org/W66231286","https://openalex.org/W2801270188","https://openalex.org/W2131164334","https://openalex.org/W32483372","https://openalex.org/W3141532631","https://openalex.org/W1946973508"],"abstract_inverted_index":{"We":[0,79],"propose":[1],"a":[2,13,64,81,96,100],"method":[3,20,55],"for":[4,88,99,111],"local":[5],"search":[6],"of":[7,12,27,30,38,84],"Boolean":[8,65],"relations":[9],"relating":[10],"variables":[11,32],"CNF":[14,31],"(conjunctive":[15],"normal":[16],"form)":[17],"formula.":[18],"The":[19,67,102],"is":[21,56,70,109],"to":[22,34,58],"branch":[23],"on":[24,72],"small":[25],"subsets":[26],"the":[28,36,50,54,85,106,116],"set":[29],"and":[33,92],"analyze":[35],"results":[37],"unit":[39,51,89],"propagation.":[40],"By":[41],"taking":[42],"into":[43],"account":[44],"variable":[45],"value":[46],"assignments,":[47],"deduced":[48],"during":[49],"propagation":[52],"procedure,":[53],"able":[57],"justify":[59],"any":[60],"relation":[61],"represented":[62],"by":[63],"expression.":[66],"proposed":[68,107],"technique":[69,108],"based":[71],"bitwise":[73],"logical":[74],"operations":[75],"over":[76],"ternary":[77],"vectors.":[78],"implement":[80],"restricted":[82],"version":[83],"method,":[86],"used":[87],"clause":[90],"derivation":[91],"equivalent-literal":[93],"identification,":[94],"in":[95,115],"preprocessor":[97],"engine":[98],"SAT-solver.":[101],"experiments":[103],"show":[104],"that":[105],"useful":[110],"solving":[112],"real-world":[113],"instances":[114],"formal":[117],"verification":[118],"domain.":[119]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}