메뉴 건너뛰기




Volumn 17, Issue 1, 1996, Pages 83-95

The semantics of answer literals

Author keywords

Answer literal; OTTER; Resolution

Indexed keywords

FORMAL LANGUAGES; FORMAL LOGIC; LOGIC PROGRAMMING; THEOREM PROVING;

EID: 0030213532     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00247669     Document Type: Article
Times cited : (14)

References (12)
  • 4
    • 0009461011 scopus 로고
    • Theorem proving by resolution as a basis for question-answering systems
    • B. Meltzer and D. Michie (eds)
    • Green, C.: Theorem proving by resolution as a basis for question-answering systems, in B. Meltzer and D. Michie (eds), Machine Intelligence, Vol. 4, 1969, pp. 183-205.
    • (1969) Machine Intelligence , vol.4 , pp. 183-205
    • Green, C.1
  • 5
    • 84968481089 scopus 로고
    • New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell's Principia Mathematica
    • Huntington, E.: New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell's Principia Mathematica, AMS Transactions 35 (1933), 274-304.
    • (1933) AMS Transactions , vol.35 , pp. 274-304
    • Huntington, E.1
  • 6
    • 25444519391 scopus 로고
    • The shortest single axioms for groups of exponent 4
    • Kunen, K.: The shortest single axioms for groups of exponent 4, Computers and Mathematics with Applications 29 (1995), 1-12.
    • (1995) Computers and Mathematics with Applications , vol.29 , pp. 1-12
    • Kunen, K.1
  • 7
    • 22944435729 scopus 로고
    • Extracting information from resolution proof trees
    • Luckham, D. and Nilsson, N. J.: Extracting information from resolution proof trees, Artificial Intelligence 2 (1971), 27-54.
    • (1971) Artificial Intelligence , vol.2 , pp. 27-54
    • Luckham, D.1    Nilsson, N.J.2
  • 9
    • 0042240296 scopus 로고
    • Robbins algebra: Conditions that make a near-Boolean algebra Boolean
    • Winker, S.: Robbins algebra: Conditions that make a near-Boolean algebra Boolean, J. Automated Reasoning 6 (1990), 465-489.
    • (1990) J. Automated Reasoning , vol.6 , pp. 465-489
    • Winker, S.1
  • 10
    • 0042240305 scopus 로고
    • Absorption and idempotency criteria for a problem in near-Boolean algebras
    • Winker, S.: Absorption and idempotency criteria for a problem in near-Boolean algebras, J. Algebra 153 (1992), 414-423.
    • (1992) J. Algebra , vol.153 , pp. 414-423
    • Winker, S.1
  • 11
    • 25644435454 scopus 로고    scopus 로고
    • OTTER and the Moufang identity problem
    • to appear
    • Wos, L.: OTTER and the Moufang identity problem, J. Automated Reasoning (to appear).
    • J. Automated Reasoning
    • Wos, L.1


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