{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:48:51Z","timestamp":1649123331971},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p> Extending the notion of context-free languages and equational sets, we use the approximation theory to define boolean subsets and boolean fuzzy subsets of an algebra. We establish some basic properties of boolean fuzzy sets. <\/jats:p>","DOI":"10.1142\/s0129054107005248","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T07:37:41Z","timestamp":1193643461000},"page":"1197-1207","source":"Crossref","is-referenced-by-count":8,"title":["BOOLEAN FUZZY SETS"],"prefix":"10.1142","volume":"18","author":[{"given":"ZOLT\u00c1N","family":"\u00c9SIK","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, University of Szeged, \u00c1rp\u00e1d t\u00e9r 2, 6720 Szeged, Hungary"},{"name":"GRLMC, Rovira i Virgili University, Pl. Imperial T\u00e0rraco 1, 43005 Tarragona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WERNER","family":"KUICH","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Diskrete Mathematik und Geometrie, Technische Univarsit\u00e4t Wien, Wiedner Hauptstrasse 8\u201310, 1040 Wien, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000110"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90069-9"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4210-9"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.02.004"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196798000156"},{"key":"rf9","first-page":"243","volume":"10","author":"\u00c9sik Z.","journal-title":"J. Automata, Languages, and Combinatorics"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00330-3"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/321127.321132"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2156-2"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90353-1"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.03.006"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107005248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:42:46Z","timestamp":1565138566000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107005248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":13,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1142\/S0129054107005248"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107005248","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}