{"id":"https://openalex.org/W2735839445","doi":"https://doi.org/10.23919/mipro.2017.7973601","title":"Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior","display_name":"Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2735839445","doi":"https://doi.org/10.23919/mipro.2017.7973601","mag":"2735839445"},"language":"en","primary_location":{"id":"doi:10.23919/mipro.2017.7973601","is_oa":false,"landing_page_url":"https://doi.org/10.23919/mipro.2017.7973601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)","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/A5091140171","display_name":"Stepan Kochemazov","orcid":"https://orcid.org/0000-0003-2848-5786"},"institutions":[{"id":"https://openalex.org/I4210148533","display_name":"Institute for System Dynamics and Control Theory","ror":"https://ror.org/04wteqw51","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210127387","https://openalex.org/I4210148533","https://openalex.org/I4210164537"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Stepan Kochemazov","raw_affiliation_strings":["Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia"],"affiliations":[{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia","institution_ids":["https://openalex.org/I4210148533"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009176581","display_name":"Oleg Zaikin","orcid":"https://orcid.org/0000-0002-0145-5010"},"institutions":[{"id":"https://openalex.org/I4210148533","display_name":"Institute for System Dynamics and Control Theory","ror":"https://ror.org/04wteqw51","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210127387","https://openalex.org/I4210148533","https://openalex.org/I4210164537"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Oleg Zaikin","raw_affiliation_strings":["Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia"],"affiliations":[{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia","institution_ids":["https://openalex.org/I4210148533"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056056607","display_name":"Alexander Semenov","orcid":"https://orcid.org/0000-0001-6172-4801"},"institutions":[{"id":"https://openalex.org/I4210148533","display_name":"Institute for System Dynamics and Control Theory","ror":"https://ror.org/04wteqw51","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210127387","https://openalex.org/I4210148533","https://openalex.org/I4210164537"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Semenov","raw_affiliation_strings":["Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia"],"affiliations":[{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia","institution_ids":["https://openalex.org/I4210148533"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091140171"],"corresponding_institution_ids":["https://openalex.org/I4210148533"],"apc_list":null,"apc_paid":null,"fwci":0.319,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.57793431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"185","issue":null,"first_page":"1172","last_page":"1177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10211","display_name":"Computational Drug Discovery Methods","score":0.9898999929428101,"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.957099974155426,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7816514372825623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6726976037025452},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6473058462142944},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6198980808258057},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6192396879196167},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5729635953903198},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5518544316291809},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.5195791721343994},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.48838919401168823},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.44736337661743164},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4281778335571289},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4204341173171997},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.42000219225883484},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.40025249123573303},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.2360280454158783},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19970840215682983}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7816514372825623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6726976037025452},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6473058462142944},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6198980808258057},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6192396879196167},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5729635953903198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5518544316291809},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.5195791721343994},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.48838919401168823},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.44736337661743164},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4281778335571289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4204341173171997},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.42000219225883484},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.40025249123573303},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.2360280454158783},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19970840215682983},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/mipro.2017.7973601","is_oa":false,"landing_page_url":"https://doi.org/10.23919/mipro.2017.7973601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W60686164","https://openalex.org/W1500127208","https://openalex.org/W2008620264","https://openalex.org/W2012413542","https://openalex.org/W2017461851","https://openalex.org/W2041157860","https://openalex.org/W2054716637","https://openalex.org/W2141389982","https://openalex.org/W2477278089","https://openalex.org/W4206807714","https://openalex.org/W6602526659","https://openalex.org/W6680874277"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2480084299","https://openalex.org/W2014111643","https://openalex.org/W2408080066","https://openalex.org/W2406837904","https://openalex.org/W192406999","https://openalex.org/W2571882453","https://openalex.org/W3128448798","https://openalex.org/W4211028879","https://openalex.org/W3120153087"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,19,27],"study":[4],"several":[5,73],"discrete":[6],"models":[7,18],"of":[8,23,53,65,86,93],"collective":[9],"behavior":[10],"based":[11],"on":[12,97,103],"Synchronous":[13],"Boolean":[14,33],"Networks.":[15],"For":[16],"these":[17],"consider":[20],"a":[21,46],"number":[22],"related":[24],"problems":[25],"that":[26,49,102],"solve":[28],"by":[29,114],"reducing":[30],"them":[31],"to":[32,56,81],"satisfiability":[34],"problem":[35],"(SAT)":[36],"and":[37,61,107],"applying":[38],"state-of-the-art":[39,116],"parameterized":[40],"SAT":[41,94,121],"solving":[42,95],"algorithms.":[43],"We":[44,89],"describe":[45],"greedy":[47],"algorithm":[48,69],"exploits":[50],"the":[51,84,91,98,109],"features":[52],"functions":[54],"used":[55],"recalculate":[57],"network":[58,66],"nodes":[59],"weights":[60],"interconnections":[62],"between":[63],"neighborhoods":[64],"nodes.":[67],"This":[68],"in":[70],"combination":[71],"with":[72,101],"specific":[74],"propositional":[75,87],"encoding":[76],"techniques,":[77],"makes":[78],"it":[79],"possible":[80],"significantly":[82],"reduce":[83],"size":[85],"encoding.":[88],"compare":[90],"effectiveness":[92],"algorithms":[96],"new":[99],"encodings":[100,106],"previously":[104],"employed":[105],"evaluate":[108],"total":[110],"performance":[111],"gain":[112],"achieved":[113],"using":[115],"tools":[117],"for":[118],"finding":[119],"efficient":[120],"solver":[122],"parameters.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}