메뉴 건너뛰기




Volumn 18, Issue 2, 1997, Pages 171-176

Barcelona

Author keywords

Automated theorem proving; Barcelona; Competition; Data structures and algorithms; Implementation

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA STRUCTURES; FORMAL LOGIC;

EID: 0031109391     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1005862710017     Document Type: Article
Times cited : (3)

References (11)
  • 1
    • 0029724784 scopus 로고    scopus 로고
    • Complexity analysis based on ordered resolution
    • New Brunswick, NJ
    • Basin, D. and Ganzinger, H.: Complexity analysis based on ordered resolution, in 11th IEEE LICS, New Brunswick, NJ, 1996, pp. 456-465.
    • (1996) 11th IEEE LICS , pp. 456-465
    • Basin, D.1    Ganzinger, H.2
  • 2
    • 0009839335 scopus 로고
    • Flatterms, discrimination nets, and fast term rewriting
    • Christian, J.: Flatterms, discrimination nets, and fast term rewriting, Journal of Automated Reasoning 10 (1993), 95-113.
    • (1993) Journal of Automated Reasoning , vol.10 , pp. 95-113
    • Christian, J.1
  • 4
    • 84955595753 scopus 로고
    • Substitution tree indexing
    • J. Hsiang (ed.), LNCS 914, Kaiserslautern, Germany, Springer-Verlag
    • Graf, P.: Substitution tree indexing, in J. Hsiang (ed.), 6th RTA, LNCS 914, Kaiserslautern, Germany, Springer-Verlag, 1995, pp. 117-131.
    • (1995) 6th RTA , pp. 117-131
    • Graf, P.1
  • 6
    • 0000452639 scopus 로고
    • Experiments with discrimination tree indexing and path indexing for term retrieval
    • McCune, W.: Experiments with discrimination tree indexing and path indexing for term retrieval, Journal of Automated Reasoning 9(2) (1992), 147-167.
    • (1992) Journal of Automated Reasoning , vol.9 , Issue.2 , pp. 147-167
    • McCune, W.1
  • 7
    • 0029696229 scopus 로고    scopus 로고
    • Basic paramodulation and decidable theories
    • New Brunswick, NJ, USA, July 27-30
    • Nieuwenhuis, R.: Basic paramodulation and decidable theories, in 11th IEEE LICS, New Brunswick, NJ, USA, July 27-30, 1996, pp. 473-482.
    • (1996) 11th IEEE LICS , pp. 473-482
    • Nieuwenhuis, R.1
  • 8
    • 25444488920 scopus 로고    scopus 로고
    • An Implementation Kernel for Theorem Proving with Equality Clauses
    • Dept. LSI, Technical University of Catalonia, Barcelona
    • Nieuwenhuis, R., Rivero, J. M. and Vallejo, M. A.: An Implementation Kernel for Theorem Proving with Equality Clauses, Technical report, Dept. LSI, Technical University of Catalonia, Barcelona, 1996.
    • (1996) Technical Report
    • Nieuwenhuis, R.1    Rivero, J.M.2    Vallejo, M.A.3
  • 9
    • 25444438926 scopus 로고
    • Practical results on the saturation of full first-order clauses: Experiments with the saturate system (system description)
    • LNCS 690, Montreal, June 16-18, Springer-Verlag
    • Nivela, P. and Nieuwenhuis, R.: Practical results on the saturation of full first-order clauses: Experiments with the saturate system (system description), in Proc. 5th RTA, LNCS 690, Montreal, June 16-18, Springer-Verlag, 1993.
    • (1993) Proc. 5th RTA
    • Nivela, P.1    Nieuwenhuis, R.2
  • 10
    • 0003687605 scopus 로고
    • The Path-Indexing Method for Indexing Terms
    • Artificial Intelligence Center, SRI International
    • Stickel, M.: The Path-Indexing Method for Indexing Terms, Technical Report 473, Artificial Intelligence Center, SRI International, 1989.
    • (1989) Technical Report 473
    • Stickel, M.1
  • 11
    • 0003881875 scopus 로고
    • An Abstract Prolog Instruction Set
    • SRI International, Menlo Park, CA
    • Warren, D. H. D.: An Abstract Prolog Instruction Set, Technical Report Technical Note 309, SRI International, Menlo Park, CA, 1983.
    • (1983) Technical Report Technical Note 309
    • Warren, D.H.D.1


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