Document Search Results

Agrawal, Shweta (ed.) et al., Advances in cryptology – ASIACRYPT 2022. 28th international conference on the theory and application of cryptology and information security, Taipei, Taiwan, December 5–9, 2022. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 13792, 340-370 (2023).

MSC: 94A60

Cite Review PDF

Full Text: DOI

Damiani, Maurizio

Partially unate Boolean functions: properties of their sum-of-products representations. (English) Zbl 1542.94289

Discrete Appl. Math. 338, 278-292 (2023).

MSC: 94D10 94C11 68Q17

Cite Review PDF

Full Text: DOI

Movsisyan, Yu. M.

Boole-De Morgan bilattices. (English) Zbl 1497.06011

J. Mult.-Val. Log. Soft Comput. 38, No. 1-2, 137-152 (2022).

Reviewer: Fang Jie (Guangzhou)

MSC: 06D30 06D05 06B25 06D75

Cite Review PDF

Full Text: Link

Alweiss, Ryan; Lovett, Shachar; Wu, Kewen; Zhang, Jiapeng

Improved bounds for the sunflower lemma. (English) Zbl 1479.05343

Ann. Math. (2) 194, No. 3, 795-815 (2021).

MSC: 05D05 05D10 05D40

Cite Review PDF

Full Text: DOI arXiv

Lyutikova, L. A.

Construction of a logical-algebraic corrector to increase the adaptive properties of the \(\Sigma \Pi \)-neuron. (English. Russian original) Zbl 1509.68222

J. Math. Sci., New York 253, No. 4, 539-546 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 154, 81-88 (2018).

MSC: 68T05 92B20

Cite Review PDF

Full Text: DOI

Meel, Kuldeep S.; Shrotri, Aditya A.; Vardi, Moshe Y.

Not all FPRASs are equal: demystifying FPRASs for DNF-counting. (English) Zbl 1483.68498

Constraints 24, No. 3-4, 211-233 (2019).

MSC: 68W20 68R07 68T20 68W25

Cite Review PDF

Full Text: DOI

Sargsyan, D. S.

On the possibility of group-theoretic description of an equivalence relation connected to the problem of covering subsets in finite fields with cosets of linear subspaces. (English) Zbl 1451.12002

Proc. Yerevan State Univ., Phys. Math. Sci. 53, No. 1, 23-27 (2019).

MSC: 12E20 11T99

Cite Review PDF

Kazimirov, Alekseĭ Sergeevich

On complexity of standard forms for multifunctions. (Russian. English summary) Zbl 1451.68133

Izv. Irkutsk. Gos. Univ., Ser. Mat. 22, 63-70 (2017).

MSC: 68Q25 03E20 68T37

Cite Review PDF

Full Text: Link

Wang, Tong; Rudin, Cynthia; Doshi-Velez, Finale; Liu, Yimin; Klampfl, Erica; Macneille, Perry

A Bayesian framework for learning rule sets for interpretable classification. (English) Zbl 1434.68467

J. Mach. Learn. Res. 18(2017-2018), Paper No. 70, 37 p. (2017).

MSC: 68T05 62F15 62H30

Cite Review PDF

Full Text: Link

Pyn’ko, A. P.

Minimization of conjunctive normal forms of partially monotonic Boolean functions. (Russian. English summary) Zbl 1374.06034

Dopov. Nats. Akad. Nauk Ukr., Mat. Pryr. Tekh. Nauky 2017, No. 3, 18-21 (2017).

MSC: 06E30

Cite Review PDF

Full Text: DOI

OA License

Haviarová, L.; Toman, E.

Properties of symmetric Boolean functions. (English) Zbl 1469.06019

J. Appl. Math. Stat. Inform. 12, No. 1, 5-24 (2016).

MSC: 06E30 05C62

Cite Review PDF

Full Text: DOI

Aslanyan, V. A.

Characterization of zigzag De Morgan functions. (English) Zbl 1353.06005

Discrete Math. Algorithms Appl. 8, No. 2, Article ID 1650030, 16 p. (2016).

Reviewer: Yuri Movsisyan (Yerevan)

MSC: 06D30 06E30 08A40

Cite Review PDF

Full Text: DOI

Degauquier, Vincent

Normal forms and functional completeness for four-valued languages. (English) Zbl 1334.03020

Bull. Belg. Math. Soc. - Simon Stevin 22, No. 4, 579-588 (2015).

MSC: 03B50

Cite Review PDF

Full Text: Euclid

To, Son Thanh; Son, Tran Cao; Pontelli, Enrico

A generic approach to planning in the presence of incomplete information: theory and implementation. (English) Zbl 1346.68181

Artif. Intell. 227, 1-51 (2015).

MSC: 68T20

Cite Review PDF

Full Text: DOI

Maximov, Yu. V.

Shortest and minimal disjunctive normal forms of complete functions. (English. Russian original) Zbl 1341.68064

Comput. Math. Math. Phys. 55, No. 7, 1242-1255 (2015); translation from Zh. Vychisl. Mat. Mat. Fiz. 55, No. 7, 1266-1280 (2015).

MSC: 68Q25 06E30 94C10

Cite Review PDF

Full Text: DOI

Han, Banghe; Li, Xiaonan

Propositional compilation for all normal parameter reductions of a soft set. (English) Zbl 1323.68494

Miao, Duoqian (ed.) et al., Rough sets and knowledge technology. 9th international conference, RSKT 2014, Shanghai, China, October 24–26, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-11739-3/pbk; 978-3-319-11740-9/ebook). Lecture Notes in Computer Science 8818. Lecture Notes in Artificial Intelligence, 184-193 (2014).

MSC: 68T37

Cite Review PDF

Full Text: DOI

Aslanyan, V. A.

On zigzag De Morgan functions. (English) Zbl 1301.06027

Proc. Yerevan State Univ., Phys. Math. Sci. 2014, No. 1(233), 3-6 (2014).

MSC: 06D30 06E30

Cite Review PDF

Li, Youyu; Zhang, Xingfang

Solution methods of logical inequality groups of disjunctive normal form in the Luk propositional calculus system. (Chinese. English summary) Zbl 1313.03011

J. Syst. Sci. Math. Sci. 34, No. 2, 245-256 (2014).

MSC: 03B52

Cite Review PDF

Movsisyan, Yu. M.; Aslanyan, V. A.

De Morgan functions and free De Morgan algebras. (English) Zbl 1315.06012

Demonstr. Math. 47, No. 2, 271-283 (2014).

MSC: 06D30 06E30 06B25

Cite Review PDF

Full Text: DOI

OA License

Prank, Rein

A tool for evaluating solution economy of algebraic transformations. (English) Zbl 1284.97010

J. Symb. Comput. 61-62, 100-115 (2014).

MSC: 97E30 97D60 97U70 68W30 68U99

Cite Review PDF

Full Text: DOI

Maximov, Yu. V.

Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms. (Russian, English) Zbl 1299.06028

Zh. Vychisl. Mat. Mat. Fiz. 53, No. 9, 1569-1588 (2013); translation in Comput. Math. Math. Phys. 53, No. 9, 1391-1409 (2013).

MSC: 06E30

Cite Review PDF

Full Text: DOI

Rao, Y. Sreenivasa; Dutta, Ratna

Efficient attribute based access control mechanism for vehicular ad hoc network. (English) Zbl 1353.94070

Lopez, Javier (ed.) et al., Network and system security. 7th international conference, NSS 2013, Madrid, Spain, June 3–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38630-5/pbk). Lecture Notes in Computer Science 7873, 26-39 (2013).

MSC: 94A60 68M10

Cite Review PDF

Full Text: DOI

Haviarová, L.; Toman, E.

Properties of the interval graph of a Boolean function. (English) Zbl 1313.60004

Acta Math. Univ. Comen., New Ser. 82, No. 2, 191-200 (2013).

Reviewer: Martin Škoviera (Bratislava)

MSC: 60C05 05C80 68R10

Cite Review PDF

Couceiro, Miguel; Waldhauser, Tamás

Interpolation by polynomial functions of distributive lattices: a generalization of a theorem of R. L. Goodstein. (English) Zbl 1283.06017

Algebra Univers. 69, No. 3, 287-299 (2013).

Reviewer: Miroslav Ploščica (Košice)

MSC: 06D99 08A40 28B15 90B50

Cite Review PDF

Full Text: DOI Link

Daubner, Jakub; Toman, Eduard

Neighbourhood of constant order in the interval graph of a random Boolean function. (English) Zbl 1283.06023

Fundam. Inform. 122, No. 4, 275-295 (2013).

MSC: 06E30

Cite Review PDF

Full Text: DOI

Lejeune, Miguel A.

Pattern definition of the \(p\)-efficiency concept. (English) Zbl 1261.90032

Ann. Oper. Res. 200, 23-36 (2012).

MSC: 90C15 90C11

Cite Review PDF

Full Text: DOI

Maximov, Yu. V.

Simple disjunctive normal forms of Boolean functions with a restricted number of zeros. (English. Russian original) Zbl 1257.06007

Dokl. Math. 86, No. 1, 480-482 (2012); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 445, No. 2, 143-145 (2012).

Reviewer: Sergiu Rudeanu (Bucureşti)

MSC: 06E30 68T10

Cite Review PDF

Full Text: DOI

Korshunov, A. D.

Computational complexity of Boolean functions. (English. Russian original) Zbl 1257.94041

Russ. Math. Surv. 67, No. 1, 93-165 (2012); translation from Usp. Mat. Nauk 67, No. 1, 97-168 (2012).

Reviewer: Ioan Tomescu (Bucureşti)

MSC: 94C11 94D10 68Q06

Cite Review PDF

Full Text: DOI

Alekhno, Egor A.

The irreducibility in ordered Banach algebras. (English) Zbl 1259.46013

Positivity 16, No. 1, 143-176 (2012).

Reviewer: Andrzej Sołtysiak (Poznań)

MSC: 46B40 47B65 46B42 47A10 46H30

Cite Review PDF

Full Text: DOI

Nikonov, V. G.

On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF. (Russian. English summary) Zbl 1477.94097

Mat. Vopr. Kriptografii 2, No. 4, 37-47 (2011).

MSC: 94D10 94A60

Cite Review PDF

Full Text: DOI MNR

Timofeyev, V. G.; Chebotarev, A. N.

Improved method of synthesis of an automaton from its specification in the language \(L\). (English. Russian original) Zbl 1298.68178

Cybern. Syst. Anal. 47, No. 3, 335-345 (2011); translation from Kibern. Sist. Anal. 2011, No. 3, 3-14 (2011).

MSC: 68Q60 68Q45

Cite Review PDF

Full Text: DOI

Zou, Yi Ming

Dynamics of Boolean networks. (English) Zbl 1215.94099

Discrete Contin. Dyn. Syst., Ser. S 4, No. 6, 1629-1640 (2011).

MSC: 94C10 05C38

Cite Review PDF

Full Text: DOI arXiv

Gu, Huamao; Wang, Xun; Ling, Yun; Gao, Ji

Determining the \({\mathcal SH}OI{\mathcal N}(D)\)-satisfiability with a complete disjunctive normal form group. (Chinese. English summary) Zbl 1240.68355

J. Softw. 21, No. 8, 1863-1877 (2010).

MSC: 68T27 68Q55 68T37 68T30

Cite Review PDF

Full Text: DOI

Wang, Tingming

D-stochastic truth degree of formulas based on standardized representation in propositional logic. (Chinese. English summary) Zbl 1212.03003

Period. Ocean Univ. China 39, No. 1, 169-172 (2009).

MSC: 03B05 03B48

Cite Review PDF

Yin, Zhiwei; Zhang, Jianpei

An attribute reduction algorithm based on a concentration Boolean matrix. (Chinese. English summary) Zbl 1212.68341

J. Harbin Eng. Univ. 30, No. 3, 307-311 (2009).

MSC: 68T37 68W05

Cite Review PDF

Lee, Kwangsu; Hwang, Jung Yeon; Lee, Dong Hoon

Non-interactive identity-based DNF signature scheme and its extensions. (English) Zbl 1167.94332

Bull. Korean Math. Soc. 46, No. 4, 743-769 (2009).

MSC: 94A60

Cite Review PDF

Full Text: DOI

Wei, Yantian; Liu, Hui; Yan, Lin; Pang, Shanqi

Analysis and proof for attribute reductions completed by anti-dominance function based on granular computing. (Chinese. English summary) Zbl 1199.68386

J. Guangxi Norm. Univ., Nat. Sci. 26, No. 3, 104-109 (2008).

MSC: 68T30

Cite Review PDF

Chandra, Pravin; Singh, R. K.; Singh, Yogesh

Generation of mutants for Boolean expression. (English) Zbl 1177.68046

J. Discrete Math. Sci. Cryptography 11, No. 5, 589-607 (2008).

MSC: 68N30

Cite Review PDF

Full Text: DOI

Čepek, Ondřej; Kronus, David; Kučera, Petr

Recognition of interval Boolean functions. (English) Zbl 1171.06007

Ann. Math. Artif. Intell. 52, No. 1, 1-24 (2008).

MSC: 06E30 68Q25 68T30

Cite Review PDF

Full Text: DOI

Sloan, Robert H.; Szörényi, Balázs; Turán, György

Projective DNF formulae and their revision. (English) Zbl 1132.68049

Discrete Appl. Math. 156, No. 4, 530-544 (2008).

MSC: 68T05

Cite Review PDF

Full Text: DOI

van Deemter, Kees; Krahmer, Emiel

Graphs and booleans: on the generation of referring expressions. (English) Zbl 07857591

Bunt, Harry (ed.) et al., Computing meaning. Volume 3. Dordrecht: Springer. Stud. Linguist. Philos. 83, 397-422 (2007).

MSC: 68T27 68T30 68T50 91F20

Cite Review PDF

Full Text: DOI

Sloan, Robert H.; Szörényi, Balázs; Turán, György

On \(k\)-term DNF with the largest number of prime implicants. (English) Zbl 1158.94008

SIAM J. Discrete Math. 21, No. 4, 987-998 (2007).

MSC: 94C10

Cite Review PDF

Full Text: DOI

An, Runqiu; Feng, Yuquan

The wrong area of the simplification algorithm for calculating the reduced differential matrix in use. (Chinese. English summary) Zbl 1164.68410

Math. Pract. Theory 37, No. 19, 99-101 (2007).

MSC: 68T37

Cite Review PDF

Perfilieva, Irina

Functional system of BL-algebra with infinite formulas. (English) Zbl 1141.06009

J. Mult.-Val. Log. Soft Comput. 12, No. 1-2, 183-200 (2006).

MSC: 06D35

Cite Review PDF

Mubayi, Dhruv; Turán, György; Zhao, Yi

The DNF exception problem. (English) Zbl 1086.68113

Theor. Comput. Sci. 352, No. 1-3, 85-96 (2006).

MSC: 68T05 68T27

Cite Review PDF

Full Text: DOI

Holeňa, Martin

Extraction of fuzzy logic rules from data by means of artificial neural networks. (English) Zbl 1249.68158

Kybernetika 41, No. 3, 297-314 (2005).

MSC: 68T05 03B52 62M45

Cite Review PDF

Full Text: EuDML Link

Miltersen, Peter Bro; Radhakrishnan, Jaikumar; Wegener, Ingo

On converting CNF to DNF. (English) Zbl 1080.94018

Theor. Comput. Sci. 347, No. 1-2, 325-335 (2005).

MSC: 94C10

Cite Review PDF

Full Text: DOI

Bshouty, Nader H.; Mossel, Elchanan; O’Donnell, Ryan; Servedio, Rocco A.

Learning DNF from random walks. (English) Zbl 1093.68045

J. Comput. Syst. Sci. 71, No. 3, 250-265 (2005).

MSC: 68Q32

Cite Review PDF

Full Text: DOI

Schieber, Baruch; Geist, Daniel; Zaks, Ayal

Computing the minimum DNF representation of Boolean functions defined by intervals. (English) Zbl 1101.68089

Discrete Appl. Math. 149, No. 1-3, 154-173 (2005).

MSC: 68T20 06E30 68Q25

Cite Review PDF

Full Text: DOI

Maes, Koen; De Baets, Bernard; Fodor, János

The unique role of the Łukasiewicz-triplet in the theory of fuzzified normal forms. (English) Zbl 1086.03021

Fuzzy Sets Syst. 153, No. 2, 161-179 (2005).

MSC: 03B52 03E72

Cite Review PDF

Full Text: DOI

Hellerstein, Lisa; Raghavan, Vijay

Exact learning of DNF formulas using DNF hypotheses. (English) Zbl 1073.68035

J. Comput. Syst. Sci. 70, No. 4, 435-470 (2005).

MSC: 68Q32 06E30 68Q15 68Q25 68T05

Cite Review PDF

Full Text: DOI

D’yakonov, A. G.

Codings and their use in the DNF implementation of binary functions. (Russian, English) Zbl 1070.03508

Zh. Vychisl. Mat. Mat. Fiz. 44, No. 8, 1511-1520 (2004); translation in Comput. Math. Math. Phys. 44, No. 8, 1435-1444 (2004).

Reviewer: Andrei Zemskov (Moskva)

MSC: 03B50 06E30 94C10

Cite Review PDF

Perfilieva, I.

Normal forms in BL and Ł\(\Pi\) algebras of functions. (English) Zbl 1077.03047

Soft Comput. 8, No. 4, 291-298 (2004).

Reviewer: Rostislav Horcik (Praha)

MSC: 03G25 03B52 06D35

Cite Review PDF

Full Text: DOI

Klivans, Adam R.; Servedio, Rocco A.

Learning DNF in time \(2^{\widetilde O(n^{1/3})}\). (English) Zbl 1073.68036

J. Comput. Syst. Sci. 68, No. 2, 303-318 (2004).

MSC: 68Q32

Cite Review PDF

Full Text: DOI

Woods, Alan R.

Subset sum “cubes” and the complexity of primality testing. (English) Zbl 1098.68050

Theor. Comput. Sci. 322, No. 1, 203-219 (2004).

MSC: 68Q15 11Y11 68Q25 94C10

Cite Review PDF

Full Text: DOI

Bshouty, Nader H.; Jackson, Jeffrey C.; Tamon, Christino

More efficient PAC-learning of DNF with membership queries under the uniform distribution. (English) Zbl 1072.68087

J. Comput. Syst. Sci. 68, No. 1, 205-234 (2004).

MSC: 68T05

Cite Review PDF

Full Text: DOI

Foldes, S.; Hammer, P. L.

Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. (English) Zbl 1051.06010

Discrete Appl. Math. 142, No. 1-3, 53-65 (2004).

MSC: 06E30 39B62

Cite Review PDF

Full Text: DOI

Perfilieva, I.

Normal forms in BL-algebra and their contribution to universal approximation of functions. (English) Zbl 1036.03021

Fuzzy Sets Syst. 143, No. 1, 111-127 (2004).

Reviewer: Salvatore Sessa (Napoli)

MSC: 03B52 06D35

Cite Review PDF

Full Text: DOI

D’yakonov, A. G.

Construction of disjunctive normal forms by consecutive multiplication. (Russian, English) Zbl 1076.68560

Zh. Vychisl. Mat. Mat. Fiz. 43, No. 10, 1589-1600 (2003); translation in Comput. Math. Math. Phys. 43, No. 10, 1529-1540 (2003).

Reviewer: Andrei Zemskov (Moskva)

MSC: 68T10 06E30

Cite Review PDF

Gurov, S. I.

Logical recognition algorithms based on the Gilbert expansion. (Russian, English) Zbl 1072.94025

Zh. Vychisl. Mat. Mat. Fiz. 43, No. 8, 1243-1248 (2003); translation in Comput. Math. Math. Phys. 43, No. 8, 1192-1197 (2003).

Reviewer: Andrei Zemskov (Moskva)

MSC: 94C10 06E30

Cite Review PDF

Pippenger, Nicholas

The shortest disjunctive normal form of a random Boolean function. (English) Zbl 1023.94023

Random Struct. Algorithms 22, No. 2, 161-186 (2003).

Reviewer: Sergiu Rudeanu (Bucureşti)

MSC: 94C10 06E30

Cite Review PDF

Full Text: DOI

D’yakonov, A. G.

Construction of disjunctive normal forms in algorithms of pattern recognition. (Russian, English) Zbl 1099.68708

Zh. Vychisl. Mat. Mat. Fiz. 42, No. 12, 1899-1907 (2002); translation in Comput. Math. Math. Phys. 42, No. 12, 1824-1832 (2002).

Reviewer: Andrei Zemskov (Moskva)

MSC: 68T10 94C10

Cite Review PDF

D’yakonov, A. G.

Test approach to the implementation of Boolean functions with few zeros by disjunctive normal forms. (Russian, English) Zbl 1064.94022

Zh. Vychisl. Mat. Mat. Fiz. 42, No. 6, 924-928 (2002); translation in Comput. Math. Math. Phys. 42, No. 6, 889-893 (2002).

Reviewer: Andrei Zemskov (Moskva)

MSC: 94C10

Cite Review PDF

Yudaev, P. V.

Comparison of two algorithms for simplifying disjunctive normal forms. (Russian, English) Zbl 1055.06005

Zh. Vychisl. Mat. Mat. Fiz. 42, No. 2, 269-272 (2002); translation in Comput. Math. Math. Phys. 42, No. 2, 257-260 (2002).

Reviewer: Andrei Zemskov (Moskva)

MSC: 06E30 94C10 68W30

Cite Review PDF

Petrík, Milan

Svoboda maps in many-valued logic. (English) Zbl 1037.03021

J. Electr. Eng. 53, No. 12/s, 100-104 (2002).

MSC: 03B50 03B52 94C10

Cite Review PDF

Foldes, Stephan; Hammer, Peter L.

Disjunctive and conjunctive representations in finite lattices and convexity spaces. (English) Zbl 1008.06005

Discrete Math. 258, No. 1-3, 13-25 (2002).

MSC: 06B05 06E30 52A35 52A37

Cite Review PDF

Full Text: DOI

Korshunov, A. D.; Shmulevich, I.

On the distribution of the number of monotone Boolean functions relative to the number of lower units. (English) Zbl 1006.90056

Discrete Math. 257, No. 2-3, 463-479 (2002).

MSC: 90C09 06E30 94C10

Cite Review PDF

Full Text: DOI

D’yakonov, A. G.

Implementation of a class of Boolean functions with a small number of zeros by irredundant disjunctive normal forms. (English. Russian original) Zbl 1021.06005

Comput. Math. Math. Phys. 41, No. 5, 775-782 (2001); translation from Zh. Vychisl. Mat. Mat. Fiz. 41, No. 5, 821-828 (2001).

Reviewer: Alexey Tret’yakov (Siedlce)

MSC: 06E30 94C10

Cite Review PDF

Xu, Y.; Liu, J.; Ruan, D.

\((\top,\bot,N)\) fuzzy logic. (English) Zbl 0993.03029

Mathware Soft Comput. 8, No. 2, 71-82 (2001).

Reviewer: Radko Mesiar (Bratislava)

MSC: 03B52

Cite Review PDF

Full Text: EuDML

Gonda, J.

Transformation of the canonical disjunctive normal form of a Boolean function to its Zhegalkin-polynomial and back. (English) Zbl 0981.06009

Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 20, 147-156 (2001).

MSC: 06E30

Cite Review PDF

Zeilberger, Doron

How Berger, Felzenbaum and Fraenkel revolutionized Covering Systems the same way that George Boole revolutionized Logic. (English) Zbl 1004.11006

Electron. J. Comb. 8, No. 2, Research Paper A1, 10 p. (2001).

Reviewer: Štefan Porubský (Praha)

MSC: 11A07 11B25 03B05 01A65

Cite Review PDF

Full Text: EuDML EMIS

Andreev, A. S.; Sagalovich, Yuri L.

Modifications in algebraic diagnostics. (English) Zbl 1067.94598

Seventh international workshop on algebraic and combinatorial coding theory, ACCT-7, Bansko, Bulgaria, June 18–24, 2000. Proceedings. Sofia: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics. 33-37 (2000).

Reviewer: F. I. Solov’eva (Novosibirsk)

MSC: 94C10 94C12 06E30

Cite Review PDF

Foldes, Stephan; Hammer, Peter L.

Disjunctive and conjunctive normal forms of pseudo-Boolean functions. (English) Zbl 0965.06015

Discrete Appl. Math. 107, No. 1-3, 1-26 (2000).

MSC: 06E30

Cite Review PDF

Full Text: DOI

Shabanin, O. V.

On the complexity of the disjunctive normal form of threshold functions. (English. Russian original) Zbl 0983.94063

Discrete Math. Appl. 10, No. 2, 175-182 (2000); translation from Diskret. Mat. 12, No. 2, 85-92 (2000).

MSC: 94C10 06E30 68Q25

Cite Review PDF

Full Text: DOI

Savický, P.; Sgall, J.

DNF tautologies with a limited number of occurrences of every variable. (English) Zbl 0944.68059

Theor. Comput. Sci. 238, No. 1-2, 495-498 (2000).

MSC: 68Q05

Cite Review PDF

Full Text: DOI

Jeronimo, Gabriela; Sabia, Juan

On the number of sets definable by polynomials. (English) Zbl 0956.68163

J. Algebra 227, No. 2, 633-644 (2000).

MSC: 68W30 03C10 12Y05

Cite Review PDF

Full Text: DOI Link

Gurvich, V.; Khachiyan, L.

On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. (English) Zbl 0953.06013

Discrete Appl. Math. 96-97, 363-373 (1999).

Reviewer: Heribert Vollmer (Würzburg)

MSC: 06E30 68Q17 94C10

Cite Review PDF

Full Text: DOI

Bshouty, Nader H.; Jackson, Jeffrey C.

Learning dNF over the uniform distribution using a quantum example oracle. (English) Zbl 0918.68033

SIAM J. Comput. 28, No. 3, 1136-1153 (1999).

MSC: 68W10 68Q05

Cite Review PDF

Full Text: DOI

Rudeanu, Sergiu

On general and reproductive solutions of finite equations. (English) Zbl 0945.03030

Publ. Inst. Math., Nouv. Sér. 63(77), 26-30 (1998).

Reviewer: Dragić Banković (Kragujevac)

MSC: 03B50 06E30 03E20 39B52

Cite Review PDF

Full Text: EuDML

Yao, Nan; Gu, Hongfang; Xiao, Xi’an; Zhu, Wujia

Equivalent complete disjunctive normal form in an extended system of the propositional calculus of medium logic. (Chinese. English summary) Zbl 0910.03017

J. Nanjing Univ. Aeronaut. Astronaut. 30, No. 4, 359-365 (1998).

MSC: 03B52

Cite Review PDF

Makharadze, M.

Standard forms of formulas of \(\tau\)-logics. (English) Zbl 0996.03506

Bull. Georgian Acad. Sci. 155, No. 1, 96-97 (1997).

MSC: 03B70 68Q60

Cite Review PDF

Trofymlyuk, O. T.; Mych, I. A.

Homogeneous and \(\widetilde\alpha\)-monotonic Boolean functions. (Ukrainian) Zbl 0934.06016

Nauk. Visn. Uzhgorod. Univ., Ser. Mat. 2, 108-113 (1997).

MSC: 06E30

Cite Review PDF

Greenberg, Harvey J.

Possibilities of logically equivalent expressions. (English) Zbl 0915.03024

Fuzzy Sets Syst. 86, No. 2, 249-250 (1997).

MSC: 03B52

Cite Review PDF

Full Text: DOI

Arbatli, A. Duygu; Akin, H. Levent

Rule extraction from trained neural networks using genetic algorithms. (English) Zbl 0936.92003

Nonlinear Anal., Theory Methods Appl. 30, No. 3, 1639-1648 (1997).

MSC: 92B20

Cite Review PDF

Full Text: DOI

Donskoy, Vladimir; Perekhod, Igor

Multiple criteria models with the linear pseudoboolean functions and disjunctive restrictions. (English) Zbl 0907.90230

Fandel, Günter (ed.) et al., Multiple criteria decision making. Proceedings of the 12th international conference, Hagen, Germany, June 19–23, 1995. Berlin: Springer. Lect. Notes Econ. Math. Syst. 448, 13-21 (1997).

Reviewer: N.Popovici (Cluj-Napoca)

MSC: 90C29 90C09

Cite Review PDF

Gurvich, Vladimir; Khachiyan, Leonid

On the frequency of the most frequently occurring variable in dual monotone DNFs. (English) Zbl 0872.06012

Discrete Math. 169, No. 1-3, 245-248 (1997).

MSC: 06E30 94C10 05C65 68Q25

Cite Review PDF

Full Text: DOI

Triantaphyllou, Evangelos; Soyster, Allen L.

On the minimum number of logical clauses inferred from examples. (English) Zbl 0865.68099

Comput. Oper. Res. 23, No. 8, 783-799 (1996).

Reviewer: J.Šefránek (Bratislava)

MSC: 68T05 03B05 05C90

Cite Review PDF

Full Text: DOI

Salzer, Gernot

Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices. (English) Zbl 1415.03030

McRobbie, M. A. (ed.) et al., Automated deduction – CADE-13. 13th international conference on automated deduction, New Brunswick, NJ, USA, July/August 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1104, 688-702 (1996).

MSC: 03B35 03B50

Cite Review PDF

Full Text: DOI

Dixon, Clare

Search strategies for resolution in temporal logics. (English) Zbl 1412.68218

McRobbie, M. A. (ed.) et al., Automated deduction – CADE-13. 13th international conference on automated deduction, New Brunswick, NJ, USA, July/August 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1104, 673-687 (1996).

MSC: 68T15 03B44

Cite Review PDF

Full Text: DOI

Egly, Uwe; Rath, Thomas

On the practical value of different definitional translations to normal form. (English) Zbl 1412.68219

McRobbie, M. A. (ed.) et al., Automated deduction – CADE-13. 13th international conference on automated deduction, New Brunswick, NJ, USA, July/August 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1104, 403-417 (1996).

MSC: 68T15 03B35

Cite Review PDF

Full Text: DOI

Triantaphyllou, Evangelos; Soyster, Allen L.

A relationship between CNF and DNF systems derivable from examples. (English) Zbl 0882.68127

ORSA J. Comput. 7, No. 3, 283-285 (1995).

MSC: 68T05

Cite Review PDF

Full Text: DOI Link

Coudert, Olivier

Doing two-level logic minimization 100 times faster. (English) Zbl 0858.94035

Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 112-121 (1995).

Reviewer: U.Schöning (Ulm)

MSC: 94C10 68Q25 03B35

Cite Review PDF

Aizenstein, Howard; Pitt, Leonard

On the learnability of disjunctive normal form formulas. (English) Zbl 0831.68094

Mach. Learn. 19, No. 3, 183-208 (1995).

MSC: 68T05

Cite Review PDF

Grumbach, Stéphane; Su, Jianwen; Tollu, Christophe

Linear constraint query languages expressive power and complexity. (English) Zbl 1540.68070

Leivant, Daniel (ed.), Logic and computational complexity. International workshop, LCC ’94, Indianapolis, IN, USA, October 13–16, 1994. Selected Papers. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 960, 426-446 (1995).

MSC: 68P15 68Q25

Cite Review PDF

Full Text: DOI

Boros, Endre; Hammer, Peter L.; Sun, Xiaorong

Recognition of \(q\)-Horn formulae in linear time. (English) Zbl 0821.68109

Discrete Appl. Math. 55, No. 1, 1-13 (1994).

MSC: 68T27

Cite Review PDF

Full Text: DOI

Kucera, Ludek; Marchetti-Spaccamela, Alberto; Protasi, Marco

On learning monotone DNF formulae under uniform distributions. (English) Zbl 0804.68120

Inf. Comput. 110, No. 1, 84-95 (1994).

MSC: 68T05 68Q25

Cite Review PDF

Full Text: DOI

Knyazeva, V. F.; Knyazev, Yu. V.; Svirshcheva, É. A.

Reduction of Boolean function to minimal orthogonal form. (English. Russian original) Zbl 0822.06012

Cybern. Syst. Anal. 29, No. 5, 641-647 (1993); translation from Kibern. Sist. Anal. 1993, No. 5, 17-25 (1993).

Reviewer: N.Ţăndăreanu (Craiova)

MSC: 06E30 94C10 03G05

Cite Review PDF

Found 183 Documents (Results 1–100)

On properties of multiaffine predicates on a finite set. (English. Russian original) Zbl 07740755

Experimental study of algorithms for minimization of binary decision diagrams using algebraic representations of cofactors. (English. Russian original) Zbl 1533.68426

Hardware implementation of code converters designed to reduce the length of binary encoded words. (English. Russian original) Zbl 1533.68425

DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF. (English) Zbl 1519.94200

Partially unate Boolean functions: properties of their sum-of-products representations. (English) Zbl 1542.94289

Boole-De Morgan bilattices. (English) Zbl 1497.06011

Improved bounds for the sunflower lemma. (English) Zbl 1479.05343

Construction of a logical-algebraic corrector to increase the adaptive properties of the \(\Sigma \Pi \)-neuron. (English. Russian original) Zbl 1509.68222

Not all FPRASs are equal: demystifying FPRASs for DNF-counting. (English) Zbl 1483.68498

On the possibility of group-theoretic description of an equivalence relation connected to the problem of covering subsets in finite fields with cosets of linear subspaces. (English) Zbl 1451.12002

On complexity of standard forms for multifunctions. (Russian. English summary) Zbl 1451.68133

A Bayesian framework for learning rule sets for interpretable classification. (English) Zbl 1434.68467

Minimization of conjunctive normal forms of partially monotonic Boolean functions. (Russian. English summary) Zbl 1374.06034

Properties of symmetric Boolean functions. (English) Zbl 1469.06019

Characterization of zigzag De Morgan functions. (English) Zbl 1353.06005

Normal forms and functional completeness for four-valued languages. (English) Zbl 1334.03020

A generic approach to planning in the presence of incomplete information: theory and implementation. (English) Zbl 1346.68181

Shortest and minimal disjunctive normal forms of complete functions. (English. Russian original) Zbl 1341.68064

Propositional compilation for all normal parameter reductions of a soft set. (English) Zbl 1323.68494

On zigzag De Morgan functions. (English) Zbl 1301.06027

Solution methods of logical inequality groups of disjunctive normal form in the Luk propositional calculus system. (Chinese. English summary) Zbl 1313.03011

De Morgan functions and free De Morgan algebras. (English) Zbl 1315.06012

A tool for evaluating solution economy of algebraic transformations. (English) Zbl 1284.97010

Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms. (Russian, English) Zbl 1299.06028

Efficient attribute based access control mechanism for vehicular ad hoc network. (English) Zbl 1353.94070

Properties of the interval graph of a Boolean function. (English) Zbl 1313.60004

Interpolation by polynomial functions of distributive lattices: a generalization of a theorem of R. L. Goodstein. (English) Zbl 1283.06017

Neighbourhood of constant order in the interval graph of a random Boolean function. (English) Zbl 1283.06023

Pattern definition of the \(p\)-efficiency concept. (English) Zbl 1261.90032

Simple disjunctive normal forms of Boolean functions with a restricted number of zeros. (English. Russian original) Zbl 1257.06007

Computational complexity of Boolean functions. (English. Russian original) Zbl 1257.94041

The irreducibility in ordered Banach algebras. (English) Zbl 1259.46013

On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF. (Russian. English summary) Zbl 1477.94097

Improved method of synthesis of an automaton from its specification in the language \(L\). (English. Russian original) Zbl 1298.68178

Dynamics of Boolean networks. (English) Zbl 1215.94099

Determining the \({\mathcal SH}OI{\mathcal N}(D)\)-satisfiability with a complete disjunctive normal form group. (Chinese. English summary) Zbl 1240.68355

D-stochastic truth degree of formulas based on standardized representation in propositional logic. (Chinese. English summary) Zbl 1212.03003

An attribute reduction algorithm based on a concentration Boolean matrix. (Chinese. English summary) Zbl 1212.68341

Non-interactive identity-based DNF signature scheme and its extensions. (English) Zbl 1167.94332

Analysis and proof for attribute reductions completed by anti-dominance function based on granular computing. (Chinese. English summary) Zbl 1199.68386

Generation of mutants for Boolean expression. (English) Zbl 1177.68046

Recognition of interval Boolean functions. (English) Zbl 1171.06007

Projective DNF formulae and their revision. (English) Zbl 1132.68049

Graphs and booleans: on the generation of referring expressions. (English) Zbl 07857591

On \(k\)-term DNF with the largest number of prime implicants. (English) Zbl 1158.94008

The wrong area of the simplification algorithm for calculating the reduced differential matrix in use. (Chinese. English summary) Zbl 1164.68410

Functional system of BL-algebra with infinite formulas. (English) Zbl 1141.06009

The DNF exception problem. (English) Zbl 1086.68113

Extraction of fuzzy logic rules from data by means of artificial neural networks. (English) Zbl 1249.68158

On converting CNF to DNF. (English) Zbl 1080.94018

Learning DNF from random walks. (English) Zbl 1093.68045

Computing the minimum DNF representation of Boolean functions defined by intervals. (English) Zbl 1101.68089

The unique role of the Łukasiewicz-triplet in the theory of fuzzified normal forms. (English) Zbl 1086.03021

Exact learning of DNF formulas using DNF hypotheses. (English) Zbl 1073.68035

Codings and their use in the DNF implementation of binary functions. (Russian, English) Zbl 1070.03508

Normal forms in BL and Ł\(\Pi\) algebras of functions. (English) Zbl 1077.03047

Learning DNF in time \(2^{\widetilde O(n^{1/3})}\). (English) Zbl 1073.68036

Subset sum “cubes” and the complexity of primality testing. (English) Zbl 1098.68050

More efficient PAC-learning of DNF with membership queries under the uniform distribution. (English) Zbl 1072.68087

Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. (English) Zbl 1051.06010

Normal forms in BL-algebra and their contribution to universal approximation of functions. (English) Zbl 1036.03021

Construction of disjunctive normal forms by consecutive multiplication. (Russian, English) Zbl 1076.68560

Logical recognition algorithms based on the Gilbert expansion. (Russian, English) Zbl 1072.94025

The shortest disjunctive normal form of a random Boolean function. (English) Zbl 1023.94023

Construction of disjunctive normal forms in algorithms of pattern recognition. (Russian, English) Zbl 1099.68708

Test approach to the implementation of Boolean functions with few zeros by disjunctive normal forms. (Russian, English) Zbl 1064.94022

Comparison of two algorithms for simplifying disjunctive normal forms. (Russian, English) Zbl 1055.06005

Svoboda maps in many-valued logic. (English) Zbl 1037.03021

Disjunctive and conjunctive representations in finite lattices and convexity spaces. (English) Zbl 1008.06005

On the distribution of the number of monotone Boolean functions relative to the number of lower units. (English) Zbl 1006.90056

Implementation of a class of Boolean functions with a small number of zeros by irredundant disjunctive normal forms. (English. Russian original) Zbl 1021.06005

\((\top,\bot,N)\) fuzzy logic. (English) Zbl 0993.03029

Transformation of the canonical disjunctive normal form of a Boolean function to its Zhegalkin-polynomial and back. (English) Zbl 0981.06009

How Berger, Felzenbaum and Fraenkel revolutionized Covering Systems the same way that George Boole revolutionized Logic. (English) Zbl 1004.11006