{"id":"https://openalex.org/W4283711556","doi":"https://doi.org/10.23919/mipro55190.2022.9803418","title":"Implicit Boolean Network for Planning Actions","display_name":"Implicit Boolean Network for Planning Actions","publication_year":2022,"publication_date":"2022-05-23","ids":{"openalex":"https://openalex.org/W4283711556","doi":"https://doi.org/10.23919/mipro55190.2022.9803418"},"language":"en","primary_location":{"id":"doi:10.23919/mipro55190.2022.9803418","is_oa":false,"landing_page_url":"https://doi.org/10.23919/mipro55190.2022.9803418","pdf_url":null,"source":{"id":"https://openalex.org/S4363605136","display_name":"2022 45th Jubilee International Convention on Information, Communication and Electronic Technology (MIPRO)","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":"2022 45th Jubilee International Convention on Information, Communication and Electronic Technology (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/A5075168776","display_name":"\u0413. \u0410. \u041e\u043f\u0430\u0440\u0438\u043d","orcid":null},"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":"G. A. Oparin","raw_affiliation_strings":["Matrosov Institute for System Dynamics and Control Theory of SB RAS,Irkutsk,Russia","Matrosov Institute for System Dynamics and Control Theory of SB RAS, Irkutsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory of SB RAS,Irkutsk,Russia","institution_ids":["https://openalex.org/I4210148533"]},{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory of SB RAS, Irkutsk, Russia","institution_ids":["https://openalex.org/I4210148533"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013452416","display_name":"V.G. Bogdanova","orcid":"https://orcid.org/0000-0002-5763-6849"},"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":"V. G. Bogdanova","raw_affiliation_strings":["Matrosov Institute for System Dynamics and Control Theory of SB RAS,Irkutsk,Russia","Matrosov Institute for System Dynamics and Control Theory of SB RAS, Irkutsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory of SB RAS,Irkutsk,Russia","institution_ids":["https://openalex.org/I4210148533"]},{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory of SB RAS, Irkutsk, Russia","institution_ids":["https://openalex.org/I4210148533"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046194925","display_name":"\u0410.\u0410. \u041f\u0430\u0448\u0438\u043d\u0438\u043d","orcid":"https://orcid.org/0000-0002-1205-7595"},"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":"A. A. Pashinin","raw_affiliation_strings":["Matrosov Institute for System Dynamics and Control Theory of SB RAS,Irkutsk,Russia","Matrosov Institute for System Dynamics and Control Theory of SB RAS, Irkutsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory of SB RAS,Irkutsk,Russia","institution_ids":["https://openalex.org/I4210148533"]},{"raw_affiliation_string":"Matrosov Institute for System Dynamics and Control Theory of SB RAS, Irkutsk, Russia","institution_ids":["https://openalex.org/I4210148533"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8781,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68764752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"871","last_page":"876"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9577999711036682,"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.9577999711036682,"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/T10142","display_name":"Formal Methods in Verification","score":0.9276000261306763,"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/T13935","display_name":"Mathematical Control Systems and Analysis","score":0.9139000177383423,"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/reachability","display_name":"Reachability","score":0.6521693468093872},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6518722772598267},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5894378423690796},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5887783169746399},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.5626494288444519},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5548607707023621},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5547971725463867},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.5351783633232117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4857642948627472},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47157496213912964},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.464013934135437},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4630921185016632},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.4488376975059509},{"id":"https://openalex.org/keywords/standard-boolean-model","display_name":"Standard Boolean model","score":0.42846015095710754},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.38277122378349304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3734394907951355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34659355878829956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27547943592071533}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6521693468093872},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6518722772598267},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5894378423690796},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5887783169746399},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.5626494288444519},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5548607707023621},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5547971725463867},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.5351783633232117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4857642948627472},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47157496213912964},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.464013934135437},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4630921185016632},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.4488376975059509},{"id":"https://openalex.org/C68481662","wikidata":"https://www.wikidata.org/wiki/Q176197","display_name":"Standard Boolean model","level":5,"score":0.42846015095710754},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.38277122378349304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3734394907951355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34659355878829956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27547943592071533}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/mipro55190.2022.9803418","is_oa":false,"landing_page_url":"https://doi.org/10.23919/mipro55190.2022.9803418","pdf_url":null,"source":{"id":"https://openalex.org/S4363605136","display_name":"2022 45th Jubilee International Convention on Information, Communication and Electronic Technology (MIPRO)","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":"2022 45th Jubilee International Convention on Information, Communication and Electronic Technology (MIPRO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6600000262260437}],"awards":[],"funders":[{"id":"https://openalex.org/F4320327494","display_name":"Ministry of Science and Higher Education of the Russian Federation","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1667362966","https://openalex.org/W2011039300","https://openalex.org/W2013473339","https://openalex.org/W2648852783","https://openalex.org/W2956790977","https://openalex.org/W2977472319","https://openalex.org/W6610072603","https://openalex.org/W6636950635","https://openalex.org/W6768642934"],"related_works":["https://openalex.org/W2995617542","https://openalex.org/W4383066791","https://openalex.org/W4322827077","https://openalex.org/W3141532631","https://openalex.org/W2131164334","https://openalex.org/W1967292023","https://openalex.org/W4491290","https://openalex.org/W2014833376","https://openalex.org/W1568384982","https://openalex.org/W1745650241"],"abstract_inverted_index":{"It":[0],"is":[1,20,78,105,147,174,203],"usual":[2],"to":[3,47,64,86,107],"classify":[4],"the":[5,18,44,50,53,59,73,81,87,100,114,134,140,143,152,155,158,163,166,177],"automated":[6],"searching":[7,35],"of":[8,25,49,58,76,102,110,113,137,142,154,157,165,179],"a":[9,23,37,56,103,128,181,186,190],"plan":[10,104],"as":[11,22],"an":[12,209],"artificial":[13],"intelligence":[14],"problem.":[15],"In":[16,119],"planning,":[17],"environment":[19],"defined":[21,79],"set":[24],"both":[26],"states":[27],"and":[28,92,162,184],"transitions":[29,39],"between":[30],"them.":[31],"Planning":[32],"consists":[33],"in":[34,189,211],"for":[36,196],"finite":[38],"sequence":[40],"(actions)":[41],"that":[42],"transfers":[43],"initial":[45],"state":[46,89],"one":[48],"states,":[51],"satisfying":[52],"objective.":[54],"As":[55],"model":[57],"planning":[60,180],"environment,":[61],"we":[62],"propose":[63],"use":[65],"implicit":[66,82,115,159],"Boolean":[67,83,144,160,200],"networks":[68],"\u2013":[69],"binary":[70,116],"dynamic":[71,111,117],"systems,":[72],"transition":[74],"function":[75],"which":[77,205],"by":[80],"equation":[84,153],"relative":[85],"current":[88],"variables":[90,95],"vector":[91],"some":[93],"subsequent":[94],"vectors.":[96],"For":[97],"this":[98,138],"model,":[99],"forming":[101],"reduced":[106],"qualitative":[108],"analysis":[109],"properties":[112,126],"system.":[118],"particular,":[120],"these":[121],"are":[122],"reachability":[123],"or":[124],"cyclicity":[125],"over":[127],"given":[129],"discrete":[130],"time":[131],"interval.":[132],"At":[133],"final":[135],"stage":[136],"method,":[139],"verification":[141],"formula":[145,150],"satisfiability":[146,201],"performed.":[148],"This":[149],"includes":[151],"dynamics":[156],"network":[161],"specification":[164],"dynamical":[167],"property":[168],"being":[169],"verified.":[170],"The":[171],"considered":[172],"approach":[173],"demonstrated":[175],"on":[176],"problem":[178],"river":[182],"crossing":[183],"constructing":[185],"Hamiltonian":[187],"cycle":[188],"graph.":[191],"A":[192],"specialized":[193],"parallel":[194],"algorithm":[195],"solving":[197],"deeply":[198],"structured":[199],"problems":[202],"proposed,":[204],"provides":[206],"scalability":[207],"with":[208],"increase":[210],"their":[212],"dimension.":[213]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}