메뉴 건너뛰기




Volumn 151, Issue SUPPL, 2003, Pages 171-200

Guided inference of nested monotone Boolean functions

Author keywords

Average query complexity; Guided inference; Membership queries; Nested monotone Boolean functions; Partially ordered sets (posets); Query selection criteria

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 0037402643     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(03)00062-8     Document Type: Article
Times cited : (5)

References (23)
  • 1
    • 84990617887 scopus 로고
    • Automatic generation of symbolic multiattribute ordinal knowledge-based DSSs: Methodology and applications
    • Ben-David A. Automatic generation of symbolic multiattribute ordinal knowledge-based DSSs: methodology and applications. Decision Sciences. 23(6):1992;1357-1372.
    • (1992) Decision Sciences , vol.23 , Issue.6 , pp. 1357-1372
    • Ben-David, A.1
  • 2
  • 3
    • 0000886186 scopus 로고
    • Predicting cause-effect relationships from incomplete discrete observations
    • Boros E., Hammer P.L., Hooker J.N. Predicting cause-effect relationships from incomplete discrete observations. SIAM Journal on Discrete Mathematics. 7(4):1994;531-543.
    • (1994) SIAM Journal on Discrete Mathematics , vol.7 , Issue.4 , pp. 531-543
    • Boros, E.1    Hammer, P.L.2    Hooker, J.N.3
  • 4
    • 0002405068 scopus 로고    scopus 로고
    • Polynomial-time recognition of 2-monotonic positive Boolean functions given by an oracle
    • Boros E., Hammer P.L., Ibaraki T., Makino K. Polynomial-time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM Journal on Computing. 26(1):1997;93-109.
    • (1997) SIAM Journal on Computing , vol.26 , Issue.1 , pp. 93-109
    • Boros, E.1    Hammer, P.L.2    Ibaraki, T.3    Makino, K.4
  • 6
    • 0012836377 scopus 로고
    • On one criterion of the optimality of an algorithm for evaluating monotonic boolean functions
    • Gainanov D.N. On one criterion of the optimality of an algorithm for evaluating monotonic boolean functions. USSR Computational Mathematics and Mathematical Physics. 24(4):1984;176-181.
    • (1984) USSR Computational Mathematics and Mathematical Physics , vol.24 , Issue.4 , pp. 176-181
    • Gainanov, D.N.1
  • 7
    • 0003179853 scopus 로고
    • Sur le nombre des fonctions Booléennes monotones de n variables
    • in French
    • Hansel G. Sur le nombre des fonctions Booléennes monotones de n variables. C. R. Acad. Sc. Paris. 262:1966;1088-1090. (in French).
    • (1966) C. R. Acad. Sc. Paris , vol.262 , pp. 1088-1090
    • Hansel, G.1
  • 11
    • 0002017397 scopus 로고
    • On the number of monotone Boolean functions
    • in Russian
    • Korshunov A.D. On the number of monotone Boolean functions. Problemy Kibernetiki. 38:1981;5-108. (in Russian).
    • (1981) Problemy Kibernetiki , vol.38 , pp. 5-108
    • Korshunov, A.D.1
  • 12
    • 0002518877 scopus 로고
    • Monotone Boolean function learning techniques integrated with user interaction
    • Proceedings of the Workshop Learning from Examples vs. Programming by Demonstration, Lake Tahoa, CA
    • B. Kovalerchuk, E. Triantaphyllou, E. Vityaev, Monotone Boolean function learning techniques integrated with user interaction, Proceedings of the Workshop Learning from Examples vs. Programming by Demonstration, 12th International Conference on Machine Learning, Lake Tahoa, CA, 1995, pp. 41-48.
    • (1995) 12th International Conference on Machine Learning , pp. 41-48
    • Kovalerchuk, B.1    Triantaphyllou, E.2    Vityaev, E.3
  • 16
    • 84955597737 scopus 로고
    • A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
    • Algorithms and Computation, Berlin, Germany: Springer-Verlag
    • Makino K., Ibaraki T. A fast and simple algorithm for identifying 2-monotonic positive Boolean functions. Proceedings of ISAACS'95, Algorithms and Computation. 1995;291-300 Springer-Verlag, Berlin, Germany.
    • (1995) Proceedings of ISAACS'95 , pp. 291-300
    • Makino, K.1    Ibaraki, T.2
  • 20
    • 0012778413 scopus 로고    scopus 로고
    • Minimizing the average query complexity of learning monotone Boolean functions
    • Torvik V.I., Triantaphyllou E. Minimizing the average query complexity of learning monotone Boolean functions. INFORMS Journal on Computing. 14(2):2002;144-174.
    • (2002) INFORMS Journal on Computing , vol.14 , Issue.2 , pp. 144-174
    • Torvik, V.I.1    Triantaphyllou, E.2
  • 22
    • 0021518106 scopus 로고
    • A theory of the learnable
    • Valiant L.G. A theory of the learnable. Communications of the ACM. 27(11):1984;1134-1142.
    • (1984) Communications of the ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1
  • 23
    • 0003363140 scopus 로고
    • Matching and record linkage
    • B.G. et al. Cox. New York, NY: John Wiley & Sons
    • Winkler W. Matching and record linkage. Cox B.G.et al. Business Survey Methods. 1995;John Wiley & Sons, New York, NY.
    • (1995) Business Survey Methods
    • Winkler, W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.