메뉴 건너뛰기




Volumn 35, Issue 2, 1999, Pages 95-116

Learning to reason with a restricted view

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; PERFORMANCE;

EID: 0032652171     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007581123604     Document Type: Article
Times cited : (17)

References (28)
  • 1
    • 0000710299 scopus 로고
    • Queries and concept learning
    • Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4), 319-342.
    • (1988) Machine Learning , vol.2 , Issue.4 , pp. 319-342
    • Angluin, D.1
  • 3
    • 0007563290 scopus 로고
    • Learning Boolean functions in an infinite attribute space
    • Blum, A. (1992). Learning Boolean functions in an infinite attribute space. Machine Learning, 9(4), 373-386.
    • (1992) Machine Learning , vol.9 , Issue.4 , pp. 373-386
    • Blum, A.1
  • 5
    • 58149319164 scopus 로고
    • Exact learning via the monotone theory
    • Bshouty, N.H. (1995). Exact learning via the monotone theory. Information and Computation, 123(1), 146-153.
    • (1995) Information and Computation , vol.123 , Issue.1 , pp. 146-153
    • Bshouty, N.H.1
  • 6
    • 85059770931 scopus 로고
    • The complexity of theorem proving procedures
    • Shaker Heights, OH: ACM Press
    • Cook, S.A. (1971). The complexity of theorem proving procedures. 3rd Annual ACM Symposium of the Theory of Computing (pp. 151-158). Shaker Heights, OH: ACM Press.
    • (1971) 3rd Annual ACM Symposium of the Theory of Computing , pp. 151-158
    • Cook, S.A.1
  • 7
    • 0031198976 scopus 로고    scopus 로고
    • Logical settings for concept learning
    • see also relevant errata (forthcoming)
    • De Raedt, L. (1997). Logical settings for concept learning. Artificial Intelligence, 95(1), 187-201, see also relevant errata (forthcoming).
    • (1997) Artificial Intelligence , vol.95 , Issue.1 , pp. 187-201
    • De Raedt, L.1
  • 13
    • 0028324717 scopus 로고
    • Cryptographic limitations on learning Boolean formulae and finite automata
    • Kearns, M.J., & Valiant, L.G. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM, 41(1), 67-95.
    • (1994) Journal of the ACM , vol.41 , Issue.1 , pp. 67-95
    • Kearns, M.J.1    Valiant, L.G.2
  • 17
    • 0031359622 scopus 로고    scopus 로고
    • Default and relevance in model based reasoning
    • Khardon, R., & Roth, D. (1997a). Default and relevance in model based reasoning. Artificial Intelligence, 97(12), 169-193.
    • (1997) Artificial Intelligence , vol.97 , Issue.12 , pp. 169-193
    • Khardon, R.1    Roth, D.2
  • 18
    • 0031224128 scopus 로고    scopus 로고
    • Learning to reason
    • Khardon, R., & Roth, D. (1997b). Learning to reason. Journal of the ACM, 44(5), 697-725.
    • (1997) Journal of the ACM , vol.44 , Issue.5 , pp. 697-725
    • Khardon, R.1    Roth, D.2
  • 19
    • 34250091945 scopus 로고
    • Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
    • Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.
    • (1988) Machine Learning , vol.2 , pp. 285-318
    • Littlestone, N.1
  • 20
    • 0030170414 scopus 로고    scopus 로고
    • Off-line reasoning for on-line efficiency: Knowledge bases
    • Moses, Y., & Tennenholtz, M. (1996). Off-line reasoning for on-line efficiency: Knowledge bases. Artificial Intelligence, 83(2), 229-239.
    • (1996) Artificial Intelligence , vol.83 , Issue.2 , pp. 229-239
    • Moses, Y.1    Tennenholtz, M.2
  • 21
    • 0028429573 scopus 로고
    • Inductive logic programming: Theory and methods
    • Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 20, 629-679.
    • (1994) Journal of Logic Programming , vol.20 , pp. 629-679
    • Muggleton, S.1    De Raedt, L.2
  • 22
    • 0027641832 scopus 로고
    • Small-bias probability spaces: Efficient constructions and applications
    • Naor, J., & Naor, M. (1993). Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4), 838-856.
    • (1993) SIAM Journal on Computing , vol.22 , Issue.4 , pp. 838-856
    • Naor, J.1    Naor, M.2
  • 23
    • 0008694313 scopus 로고
    • Nonmonotonic reasoning
    • Annual Reviews Inc.
    • Reiter, R. (1987). Nonmonotonic reasoning. Annual Reviews of Computer Science (pp. 147-188). Annual Reviews Inc.
    • (1987) Annual Reviews of Computer Science , pp. 147-188
    • Reiter, R.1
  • 26
    • 0030102186 scopus 로고    scopus 로고
    • Knowledge compilation and theory approximation
    • Selman, B., & Kautz, H. (1996). Knowledge compilation and theory approximation. Journal of the ACM, 43(2), 193-224.
    • (1996) Journal of the ACM , vol.43 , Issue.2 , pp. 193-224
    • Selman, B.1    Kautz, H.2
  • 27
    • 0021518106 scopus 로고
    • A theory of the learnable
    • Valiant, L.G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134-1142.
    • (1984) Communications of the ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1


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