메뉴 건너뛰기




Volumn 1314, Issue , 1997, Pages 163-174

A new design and implementation of progol by bottom-up computation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; HEURISTIC ALGORITHMS;

EID: 38149075991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63494-0_54     Document Type: Conference Paper
Times cited : (6)

References (6)
  • 2
    • 0026271995 scopus 로고
    • A Model Generation Theorem Prover in KL1 Using a Ramified-Stack Algorithm
    • Fujita, H. and Hasegawa, R.: A Model Generation Theorem Prover in KL1 Using a Ramified-Stack Algorithm. Proc. of the 8th ICLP, (1991) 535-548
    • (1991) Proc. Of the 8Th ICLP , pp. 535-548
    • Fujita, H.1    Hasegawa, R.2
  • 3
    • 85032870902 scopus 로고
    • SATCHMO: A theorem prover implemented in Prolog
    • Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog. Proc. of the 9th CADE, (1988) 415-434
    • (1988) Proc. Of the 9Th CADE , pp. 415-434
    • Manthey, R.1    Bry, F.2
  • 4
    • 77951503082 scopus 로고
    • Inverse Entailment and Progol
    • Muggleton, S.: Inverse Entailment and Progol. New Generation Computing, Vol.13, (1995) 245-286
    • (1995) New Generation Computing , vol.13 , pp. 245-286
    • Muggleton, S.1
  • 5
    • 0025554561 scopus 로고
    • Design of the kernel language for the parallel inference machine
    • Ueda, K. and Chikayama, T.: Design of the kernel language for the parallel inference machine. The Computer Journal, 33(6) (1990) 494-500
    • (1990) The Computer Journal , vol.33 , Issue.6 , pp. 494-500
    • Ueda, K.1    Chikayama, T.2


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