{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:41:32Z","timestamp":1777704092210,"version":"3.51.4"},"reference-count":11,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:00:00Z","timestamp":1602028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,10,7]]},"abstract":"<jats:p>According to Boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions (it can also be described as an OR of AND\u2019s). For each table an arbitrary T.B.T is given (total binary truth table) Boolean expression can be written as a disjunctive normal form. This paper considers a notation of a T.B.T, introduces a new concept of the hypergraphable Boolean functions and the Boolean functionable hypergraphs with respect to any given T.B.T. This study defines a notation of unitors set on switching functions and proves that every T.B.T corresponds to a minimum Boolean expression via unitors set and presents some conditions on a T.B.T to obtain a minimum irreducible Boolean expression from switching functions. Indeed, we generate a switching function in different way via the concept of hypergraphs in terms of Boolean expression in such a way that it has a minimum irreducible Boolean expression, for every given T.B.T. Finally, an algorithm is presented. Therefore, a Python programming(with complete and original codes) such that for any given T.B.T, introduces a minimum irreducible switching expression.<\/jats:p>","DOI":"10.3233\/jifs-191230","type":"journal-article","created":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T10:06:04Z","timestamp":1602237964000},"page":"2845-2859","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Switching function based on hypergraphs with algorithm and python programming"],"prefix":"10.1177","volume":"39","author":[{"given":"Mohammad","family":"Hamidi","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Payame Noor, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marzieh","family":"Rahmati","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Payame Noor, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akbar","family":"Rezaei","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Payame Noor, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-162347"},{"key":"e_1_3_1_3_2","article-title":"North Holland","author":"Berge C.","year":"1979","unstructured":"BergeC., North Holland, Graphs and Hypergraphs (1979).","journal-title":"Graphs and Hypergraphs"},{"key":"e_1_3_1_4_2","article-title":"Whitesitt, Boolean Algebra and Its Applications","author":"Eldon J.","year":"1995","unstructured":"EldonJ., Whitesitt, Boolean Algebra and Its Applications, New York Dover Publications Inc (1995).","journal-title":"New York Dover Publications Inc"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-017-1098-z"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005718500114"},{"issue":"2","key":"e_1_3_1_7_2","first-page":"21","article-title":"On Derivable Trees","volume":"8","author":"Hamidi M.","year":"2019","unstructured":"HamidiM. and Borumand SaeidA., On Derivable Trees, Transactions on Combinatorics 8(2) (2019), 21\u201343.","journal-title":"Transactions on Combinatorics"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-190036"},{"key":"e_1_3_1_9_2","first-page":"261","article-title":"Applications of Hypergraphs in Informatics a Survey and Opportunities for Research","volume":"42","author":"Molnar B.","year":"2014","unstructured":"MolnarB., Applications of Hypergraphs in Informatics a Survey and Opportunities for Research, Annales Univ Sci Budapest Sect Comp 42 (2014), 261\u2013282.","journal-title":"Annales Univ Sci Budapest Sect Comp"},{"issue":"1","key":"e_1_3_1_10_2","first-page":"106","article-title":"Detour g-interior nodes and detour g-boundary nodes in bipolar fuzzy graph with applications","volume":"49","author":"Poulik S.","year":"2020","unstructured":"PoulikS. and GhoraiG., Detour g-interior nodes and detour g-boundary nodes in bipolar fuzzy graph with applications, Hacettepe University Bulletin of Natural Sciences and Engineering Series B: Mathematics and Statistics 49(1) (2020), 106\u2013119.","journal-title":"Hacettepe University Bulletin of Natural Sciences and Engineering Series B: Mathematics and Statistics"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04265-z"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105315"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191230","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-191230","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:23Z","timestamp":1777455623000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-191230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,10,7]]}},"alternative-id":["10.3233\/JIFS-191230"],"URL":"https:\/\/doi.org\/10.3233\/jifs-191230","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,7]]}}}