메뉴 건너뛰기




Volumn , Issue , 1993, Pages 120-127

Learning From Entailment: An Application to Prepositional Horn Sentences

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING FROM ENTAILMENTS;

EID: 85027108143     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (63)

References (10)
  • 1
    • 0023453626 scopus 로고
    • Learning regular sets from queries and counterexamples
    • [Angluin, 1987]
    • [Angluin, 1987] Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106.
    • (1987) Information and Computation , vol.75 , pp. 87-106
    • Angluin, D.1
  • 3
    • 0000452640 scopus 로고
    • Learning conjunctions of Horn clauses
    • [Angluin et al., 1992]
    • [Angluin et al., 1992] Angluin, D., Frazier, M., and Pitt, L. (1992). Learning conjunctions of Horn clauses. Machine Learning, 9:147-164.
    • (1992) Machine Learning , vol.9 , pp. 147-164
    • Angluin, D.1    Frazier, M.2    Pitt, L.3
  • 4
    • 6144290465 scopus 로고
    • Tractable approximate deduction using limited vocabulary
    • [Dalai and Etherington, 1992] Vancouver
    • [Dalai and Etherington, 1992] Dalai, M. and Etherington, D. (1992). Tractable approximate deduction using limited vocabulary. In CSCSI'92, Vancouver.
    • (1992) CSCSI'92
    • Dalai, M.1    Etherington, D.2
  • 7
    • 84909897752 scopus 로고
    • Speeding inference by acquiring new concepts
    • [Kautz and Selman, 1992] San Jose
    • [Kautz and Selman, 1992] Kautz, and Selman, B. (1992). Speeding inference by acquiring new concepts. In Proceedings of AAAI'92^ San Jose.
    • (1992) Proceedings of AAAI'92
    • Kautz1    Selman, B.2
  • 8
    • 0003071129 scopus 로고
    • Generalization and learnability: A study of constrained atoms
    • [Page and Frisch, 1992] Muggleton, S. H., editor. chapter 2, pages Academic Press, London
    • [Page and Frisch, 1992] Page, C. D. and Frisch, A. (1992). Generalization and learnability: A study of constrained atoms. In Muggleton, S. H., editor. Inductive Logic Programming, chapter 2, pages 29- 60. Academic Press, London.
    • (1992) Inductive Logic Programming , pp. 29-60
    • Page, C. D.1    Frisch, A.2
  • 9
    • 85026919405 scopus 로고
    • Knowledge compilation using Horn approximations
    • [Selman and Kautz, 1991] Anaheim. [Shapiro, 1983] Shapiro, E. Y. (1983). Algorithmic Program Debugging, MIT Press, Cambridge, MA
    • [Selman and Kautz, 1991] Selman, B. and Kautz, (1991). Knowledge compilation using Horn approximations. In Proceedings of AAAI'91, Anaheim. [Shapiro, 1983] Shapiro, E. Y. (1983). Algorithmic Program Debugging, MIT Press, Cambridge, MA.
    • (1991) Proceedings of AAAI'91
    • Selman, B.1    Kautz2
  • 10
    • 0021518106 scopus 로고
    • A theory of the learnable
    • [Valiant, 1984]
    • [Valiant, 1984] Valiant, L. (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.1


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