메뉴 건너뛰기




Volumn 3452 LNAI, Issue , 2005, Pages 415-431

Can a higher-order and a first-order theorem prover cooperate?

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; SET THEORY;

EID: 26844502141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_27     Document Type: Conference Paper
Times cited : (7)

References (24)
  • 3
    • 84957690820 scopus 로고    scopus 로고
    • Extensional higher-order paramodulation and RUE-resolution
    • Springer
    • C. Benzmüller. Extensional higher-order paramodulation and RUE-resolution. Proc. of CADE-16, LNAI 1632, p. 399-413. Springer, 1999.
    • (1999) Proc. of CADE-16, LNAI , vol.1632 , pp. 399-413
    • Benzmüller, C.1
  • 4
    • 26844465479 scopus 로고    scopus 로고
    • Comparing approaches to resolution based higher-order theorem proving
    • C. Benzmüller. Comparing approaches to resolution based higher-order theorem proving. Synthese, 133(1-2):203-235, 2002.
    • (2002) Synthese , vol.133 , Issue.1-2 , pp. 203-235
    • Benzmüller, C.1
  • 5
    • 84974667694 scopus 로고    scopus 로고
    • Experiments with an agent-oriented reasoning system
    • LNAI/2174, Springer
    • C. Benzmüller, M. Jamnik, M. Kerber, and V. Sorge. Experiments with an Agent-Oriented Reasoning System. Proc. of KI 2001, LNAI/2174, p.409-424. Springer, 2001.
    • (2001) Proc. of KI 2001 , pp. 409-424
    • Benzmüller, C.1    Jamnik, M.2    Kerber, M.3    Sorge, V.4
  • 7
    • 84867755103 scopus 로고    scopus 로고
    • A blackboard architecture for guiding interactive proofs
    • Springer
    • C. Benzmüller and V. Sorge. A Blackboard Architecture for Guiding Interactive Proofs. Proc. of AIMSA '98, LNAI 1480, p. 102-114. Springer, 1998.
    • (1998) Proc. of AIMSA '98, LNAI , vol.1480 , pp. 102-114
    • Benzmüller, C.1    Sorge, V.2
  • 8
    • 26844552442 scopus 로고    scopus 로고
    • OANTS - An open approach at combining interactive and automated theorem proving
    • AK Peters
    • C. Benzmüller and V. Sorge. OANTS - An open approach at combining Interactive and Automated Theorem Proving. Proc. of Calculemus-2000. AK Peters, 2001.
    • (2001) Proc. of Calculemus-2000
    • Benzmüller, C.1    Sorge, V.2
  • 9
    • 84957107255 scopus 로고    scopus 로고
    • Selectively instantiating definitions
    • Springer
    • M. Bishop and P. Andrews. Selectively instantiating definitions. Proc. of CADE-15, LNAI 1421. Springer, 1998.
    • (1998) Proc. of CADE-15, LNAI , vol.1421
    • Bishop, M.1    Andrews, P.2
  • 10
    • 26844453668 scopus 로고    scopus 로고
    • PhD thesis, Dept. of Mathematical Sciences, Carnegie Mellon University, USA
    • C. E. Brown. Set Comprehension in Church's Type Theory. PhD thesis, Dept. of Mathematical Sciences, Carnegie Mellon University, USA, 2004.
    • (2004) Set Comprehension in Church's Type Theory
    • Brown, C.E.1
  • 12
    • 84880692234 scopus 로고    scopus 로고
    • Cooperation of heterogeneous provers
    • Morgan Kaufmann
    • J. Denzinger and D. Fuchs. Cooperation of Heterogeneous Provers. Proc. IJCAI-16, p. 10-15. Morgan Kaufmann, 1999.
    • (1999) Proc. IJCAI-16 , pp. 10-15
    • Denzinger, J.1    Fuchs, D.2
  • 14
    • 7044232919 scopus 로고    scopus 로고
    • Superposition with equivalence reasoning and delayed clause normal form transformation
    • Springer
    • H. Ganzinger and J. Stuber. Superposition with equivalence reasoning and delayed clause normal form transformation. Proc. of CADE-19, LNAI 2741. Springer, 2003.
    • (2003) Proc. of CADE-19, LNAI , vol.2741
    • Ganzinger, H.1    Stuber, J.2
  • 15
    • 84948978867 scopus 로고    scopus 로고
    • An LCF-style interface between HOL and first-order logic
    • Springer
    • J. Hurd. An LCF-style interface between HOL and first-order logic. Automated Deduction - CADE-18, LNAI 2392, p. 134-138. Springer, 2002.
    • (2002) Automated Deduction - CADE-18, LNAI , vol.2392 , pp. 134-138
    • Hurd, J.1
  • 17
    • 84903818014 scopus 로고    scopus 로고
    • TRAMP: Transformation of machine-found proofs into natural deduction proofs at the assertion level
    • Springer
    • A. Meier. TRAMP: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level. Proc. of CADE-17, LNAI 1831. Springer, 2000.
    • (2000) Proc. of CADE-17, LNAI , vol.1831
    • Meier, A.1
  • 18
    • 9444297962 scopus 로고    scopus 로고
    • Experiments on supporting interactive proof using resolution
    • Springer
    • J. Meng and L. C. Paulson. Experiments on supporting interactive proof using resolution. Proc. of IJCAR 2004, LNCS 3097, p. 372-384. Springer, 2004.
    • (2004) Proc. of IJCAR 2004, LNCS , vol.3097 , pp. 372-384
    • Meng, J.1    Paulson, L.C.2
  • 20
    • 84867757667 scopus 로고    scopus 로고
    • Muscadet2.3: A knowledge-based theorem prover based on natural deduction
    • Springer
    • D. Pastre. Muscadet2.3 : A knowledge-based theorem prover based on natural deduction. Proc. of IJCAR-01, LNAI 2083, p. 685-689. Springer, 2001.
    • (2001) Proc. of IJCAR-01, LNAI , vol.2083 , pp. 685-689
    • Pastre, D.1
  • 21
    • 84867820806 scopus 로고    scopus 로고
    • Vampire 1.1 (system description)
    • Springer
    • A. Riazanov and A. Voronkov. Vampire 1.1 (system description). Proc. of IJCAR-01, LNAI 2083, p. 376-380. Springer, 2001.
    • (2001) Proc. of IJCAR-01, LNAI , vol.2083 , pp. 376-380
    • Riazanov, A.1    Voronkov, A.2
  • 24
    • 0032186666 scopus 로고    scopus 로고
    • The TPTP problem library: CNF release v1.2.1
    • G. Sutcliffe and C. Suttner. The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177-203, 1998.
    • (1998) Journal of Automated Reasoning , vol.21 , Issue.2 , pp. 177-203
    • Sutcliffe, G.1    Suttner, C.2


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