메뉴 건너뛰기




Volumn 117, Issue 2, 2000, Pages 231-253

Robust logics

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; LEARNING SYSTEMS; POLYNOMIALS;

EID: 0033875407     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00002-3     Document Type: Article
Times cited : (71)

References (48)
  • 2
    • 0000492326 scopus 로고
    • Learning from noisy examples
    • Angluin D., Laird P. Learning from noisy examples. Machine Learning. Vol. 2:(4):1988;343-370.
    • (1988) Machine Learning , vol.2 , Issue.4 , pp. 343-370
    • Angluin, D.1    Laird, P.2
  • 8
    • 0001001905 scopus 로고
    • Polynomial learnability and inductive logic programming: Methods and results
    • Cohen W.W., Page C.D. Polynomial learnability and inductive logic programming: Methods and results. New Generation Computing. Vol. 13:(314):1995;369-409.
    • (1995) New Generation Computing , vol.13 , Issue.314 , pp. 369-409
    • Cohen, W.W.1    Page, C.D.2
  • 9
    • 0024739191 scopus 로고
    • A general lower bound on the number of examples needed for learning
    • Ehrenfeucht A., Haussler D., Kearns M., Valiant L. A general lower bound on the number of examples needed for learning. Inform. and Comput. Vol. 82:(3):1989;247-266.
    • (1989) Inform. and Comput. , vol.82 , Issue.3 , pp. 247-266
    • Ehrenfeucht, A.1    Haussler, D.2    Kearns, M.3    Valiant, L.4
  • 12
    • 0025535649 scopus 로고
    • An analysis of first-order logics of probability
    • Halpern J.Y. An analysis of first-order logics of probability. Artificial Intelligence. Vol. 46:1990;311-350.
    • (1990) Artificial Intelligence , vol.46 , pp. 311-350
    • Halpern, J.Y.1
  • 13
    • 0024082469 scopus 로고
    • Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
    • Haussler D. Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. Artificial Intelligence. Vol. 36:1988;177-221.
    • (1988) Artificial Intelligence , vol.36 , pp. 177-221
    • Haussler, D.1
  • 14
    • 0027188175 scopus 로고
    • Efficient noise-tolerant learning from statistical queries
    • New York: ACM Press
    • Kearns M.J. Efficient noise-tolerant learning from statistical queries. Proc. 25th ACM Symposium on Theory of Computing. 1993;392-401 ACM Press, New York.
    • (1993) Proc. 25th ACM Symposium on Theory of Computing , pp. 392-401
    • Kearns, M.J.1
  • 15
    • 0027640858 scopus 로고
    • Learning in the presence of malicious errors
    • Kearns M., Li M. Learning in the presence of malicious errors. SIAM J. Comput. Vol. 22:(4):1993;807-837.
    • (1993) SIAM J. Comput. , vol.22 , Issue.4 , pp. 807-837
    • Kearns, M.1    Li, M.2
  • 19
    • 0031224128 scopus 로고    scopus 로고
    • Learning to reason
    • Khardon R., Roth D. Learning to reason. J. ACM. Vol. 44:(5):1997;697-772.
    • (1997) J. ACM , vol.44 , Issue.5 , pp. 697-772
    • Khardon, R.1    Roth, D.2
  • 20
    • 84880663523 scopus 로고    scopus 로고
    • Relational learning for NLP using linear threshold elements
    • San Mateo, CA: Morgan Kaufmann
    • Khardon R., Roth D., Valiant L.G. Relational learning for NLP using linear threshold elements. Proc. IJCAI-99, Stockholm, Sweden. 1999;911-917 Morgan Kaufmann, San Mateo, CA.
    • (1999) Proc. IJCAI-99, Stockholm, Sweden , pp. 911-917
    • Khardon, R.1    Roth, D.2    Valiant, L.G.3
  • 21
    • 0004951436 scopus 로고
    • Inductive logic programming and learnability
    • Kietz J.-U., Dzeroski S. Inductive logic programming and learnability. SIGART Bulletin. Vol. 5:(1):1994;22-32.
    • (1994) SIGART Bulletin , vol.5 , Issue.1 , pp. 22-32
    • Kietz, J.-U.1    Dzeroski, S.2
  • 22
    • 84969342575 scopus 로고
    • The Perceptron algorithm versus Winnow: Linear versus logarithmic mistake bounds when few input variables are relevant
    • also: Artificial Intelligence 97 (1997) 325-343
    • Kivinen J., Warmuth M.K., Auer P. The Perceptron algorithm versus Winnow: Linear versus logarithmic mistake bounds when few input variables are relevant. Proc. 8th ACM Conference on Computational Learning Theory. 1995;289-296. also: Artificial Intelligence 97 (1997) 325-343.
    • (1995) Proc. 8th ACM Conference on Computational Learning Theory , pp. 289-296
    • Kivinen, J.1    Warmuth, M.K.2    Auer, P.3
  • 25
    • 0025467212 scopus 로고
    • CYC: Toward programs with common sense
    • Lenat D.B. CYC: Toward programs with common sense. Comm. ACM. Vol. 33:(8):1990;30-49.
    • (1990) Comm. ACM , vol.33 , Issue.8 , pp. 30-49
    • Lenat, D.B.1
  • 26
    • 34250091945 scopus 로고
    • Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
    • Littlestone N. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning. Vol. 2:1988;285-318.
    • (1988) Machine Learning , vol.2 , pp. 285-318
    • Littlestone, N.1
  • 30
    • 0028429573 scopus 로고
    • Inductive logic programming: Theory and methods
    • Muggleton S., De Raedt L. Inductive logic programming: Theory and methods. J. Logic Programming. Vol. 19:1994;629-679.
    • (1994) J. Logic Programming , vol.19 , pp. 629-679
    • Muggleton, S.1    De Raedt, L.2
  • 33
    • 0024092215 scopus 로고
    • Computational limits on learning from examples
    • Pitt L., Valiant L.G. Computational limits on learning from examples. J. ACM. Vol. 35:1988;965-984.
    • (1988) J. ACM , vol.35 , pp. 965-984
    • Pitt, L.1    Valiant, L.G.2
  • 34
    • 0001172265 scopus 로고
    • Learning logical definitions from relations
    • Quinlan J.R. Learning logical definitions from relations. Machine Learning. Vol. 5:1990;239-266.
    • (1990) Machine Learning , vol.5 , pp. 239-266
    • Quinlan, J.R.1
  • 35
    • 1442267080 scopus 로고
    • Learning decision lists
    • Rivest R.L. Learning decision lists. Machine Learning. Vol. 2:(3):1987;229-246.
    • (1987) Machine Learning , vol.2 , Issue.3 , pp. 229-246
    • Rivest, R.L.1
  • 37
    • 0002614701 scopus 로고
    • Learning to reason: The non-monotonic case
    • Roth D. Learning to reason: The non-monotonic case. Proc. IJCAI-95, Montreal, Quebec. 1995;1178-1184.
    • (1995) Proc. IJCAI-95, Montreal, Quebec , pp. 1178-1184
    • Roth, D.1
  • 38
    • 0030358856 scopus 로고    scopus 로고
    • A connectionist framework for reasoning: Reasoning with examples
    • Roth D. A connectionist framework for reasoning: Reasoning with examples. Proc. AAAI-96, Portland, OR. 1996;1256-1261.
    • (1996) Proc. AAAI-96, Portland, or , pp. 1256-1261
    • Roth, D.1
  • 41
    • 0002988210 scopus 로고
    • Computing machinery and intelligence
    • Reprinted in: D.C. Ince (Ed.), Collected Works of A.M. Turing: Mechanical Intelligence, North-Holland, Amsterdam, 1992.
    • Turing A.M. Computing machinery and intelligence. Mind. Vol. 59:1950;433-460. Reprinted in: D.C. Ince (Ed.), Collected Works of A.M. Turing: Mechanical Intelligence, North-Holland, Amsterdam, 1992.
    • (1950) Mind , vol.59 , pp. 433-460
    • Turing, A.M.1
  • 42
    • 0010946127 scopus 로고
    • Solvable and unsolvable problems
    • Reprinted in: D.C. Ince (Ed.), Collected Works of A.M. Turing: Mechanical Intelligence, North-Holland, Amsterdam, 1992.
    • Turing A.M. Solvable and unsolvable problems. Science News. Vol. 31:1954;7-23. Reprinted in: D.C. Ince (Ed.), Collected Works of A.M. Turing: Mechanical Intelligence, North-Holland, Amsterdam, 1992.
    • (1954) Science News , vol.31 , pp. 7-23
    • Turing, A.M.1
  • 44
    • 0021518106 scopus 로고
    • A theory of the learnable
    • Valiant L.G. A theory of the learnable. Comm. ACM. Vol. 27:(11):1984;1134-1142.
    • (1984) Comm. ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1
  • 47
    • 22044450454 scopus 로고    scopus 로고
    • A neuroidal architecture for cognitive computation
    • Berlin: Springer. also: J. ACM, to appear
    • Valiant L.G. A neuroidal architecture for cognitive computation. Lecture Notes in Computer Science. Vol. 1443:1998;642-669 Springer, Berlin. also: J. ACM, to appear.
    • (1998) Lecture Notes in Computer Science , vol.1443 , pp. 642-669
    • Valiant, L.G.1
  • 48
    • 0033225586 scopus 로고    scopus 로고
    • Projection learning
    • Valiant L.G. Projection learning. Machine Learning. Vol. 37:(2):1999;115-130.
    • (1999) Machine Learning , vol.37 , Issue.2 , pp. 115-130
    • Valiant, L.G.1


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