메뉴 건너뛰기




Volumn 1397 LNAI, Issue , 1998, Pages 60-76

Hyper tableau - The next generation

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84886243786     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69778-0_14     Document Type: Conference Paper
Times cited : (43)

References (23)
  • 1
    • 0042411559 scopus 로고    scopus 로고
    • A rational and efficient algorithm for view deletion in databases
    • Jan Maluszynski, editor, Port Jefferson, New York, The MIT Press
    • Chandrabose Aravindan and Peter Baumgartner. A Rational and Efficient Algorithm for View Deletion in Databases. In Jan Maluszynski, editor, Logic Programming - Proceedings of the 1997 International Symposium, Port Jefferson, New York, 1997. The MIT Press.
    • (1997) Logic Programming - Proceedings of the 1997 International Symposium
    • Aravindan, C.1    Baumgartner, P.2
  • 3
    • 0013307624 scopus 로고    scopus 로고
    • number 1126 in Lecture Notes in Aritificial Intelligence. European Workshop on Logic in AI, Springer
    • Peter Baumgartner, Ulrich Furbach, and Ilkka Niemela. Hyper Tableaux. In Proc. JELIA 96, number 1126 in Lecture Notes in Aritificial Intelligence. European Workshop on Logic in AI, Springer, 1996.
    • (1996) Proc. JELIA 96
    • Baumgartner, P.1    Furbach, U.2    Niemela, I.3    Tableaux, H.4
  • 4
    • 0005483198 scopus 로고
    • Rewrite-based equational theorem proving with selection and simplification
    • Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
    • (1994) Journal of Logic and Computation , vol.4 , Issue.3 , pp. 217-247
    • Bachmair, L.1    Ganzinger, H.2
  • 5
    • 84957644043 scopus 로고    scopus 로고
    • The tableau-based theorem prover version 4.0
    • New Brunswick, NJ, USA, volume 1104 of Lecture Notes in Computer Science, Springer
    • Bernhard Beckert, Reiner Hähnle, Peter Oel, and Martin Sulzmann. The tableau-based theorem prover version 4.0. In Proceedings, 13th International Conference on Automated Deduction (CADE), New Brunswick, NJ, USA, volume 1104 of Lecture Notes in Computer Science, pages 303-307. Springer, 1996.
    • (1996) Proceedings, 13th International Conference on Automated Deduction (CADE) , pp. 303-307
    • Beckert, B.1    Hähnle, R.2    Oel, P.3    Sulzmann, M.4
  • 8
    • 0017267539 scopus 로고
    • Analytic resolution in theorem proving
    • D. Brand. Analytic Resolution in Theorem Proving. Artificial Intelligence, 7:285-318, 1976.
    • (1976) Artificial Intelligence , vol.7 , pp. 285-318
    • Brand, D.1
  • 12
    • 0016973778 scopus 로고
    • Resolution strategies as decision procedures
    • W.H. Joyner. Resolution Strategies as Decision Procedures. Journal of the ACM, 23(3):396-417, 1976.
    • (1976) Journal of the ACM , vol.23 , Issue.3 , pp. 396-417
    • Joyner, W.H.1
  • 13
    • 5844357250 scopus 로고
    • Semantic tableaux with ordering restrictions
    • A. Bundy, editor, volume 814 of LNAI, Springer
    • Stefan Klingenbeck and Reiner Hahnle. Semantic tableaux with ordering restrictions. In A. Bundy, editor, Proc. CADE-12, volume 814 of LNAI, pages 708-722. Springer, 1994.
    • (1994) Proc. CADE-12 , pp. 708-722
    • Klingenbeck, S.1    Hahnle, R.2
  • 14
    • 84886256002 scopus 로고    scopus 로고
    • Rigid hypertableaux
    • Lecture Notes in Aritificial Intelligence, Springer
    • Michael Kfihn. Rigid Hypertableaux. In Proc.ofKI '97, Lecture Notes in Aritificial Intelligence. Springer, 1997.
    • (1997) Proc.Of KI '97
    • Kfihn, M.1
  • 16
    • 0028715389 scopus 로고
    • Controlled integrations of the cut rule into connection tableau calculi
    • R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994.
    • (1994) Journal of Automated Reasoning , vol.13
    • Letz, R.1    Mayr, K.2    Goller, C.3
  • 17
    • 0003019709 scopus 로고
    • Eliminating duplicates with the hyper-linking strategy
    • S.-J. Lee and D. Plaisted. Eliminating Duplicates with the Hyper-Linking Strategy. Journal of Automated Reasoning, 9:25-42, 1992.
    • (1992) Journal of Automated Reasoning , vol.9 , pp. 25-42
    • Lee, S.-J.1    Plaisted, D.2
  • 19
    • 85032870902 scopus 로고
    • SATCHMO: A theorem prover implemented in Prolog
    • Ewing Lusk and Ross Overbeek, editors, Illinois, May 1988, volume 310 of Lecture Notes in Computer Science, Springer
    • Rainer Manthey and Francois Bry. SATCHMO: a theorem prover implemented in Prolog. In Ewing Lusk and Ross 0verbeek, editors, Proceedings of the 9th Conference on Automated Deduction, Argonne, Illinois, May 1988, volume 310 of Lecture Notes in Computer Science, pages 415-434. Springer, 1988.
    • (1988) Proceedings of the 9th Conference on Automated Deduction, Argonne , pp. 415-434
    • Manthey, R.1    Bry, F.2
  • 21
    • 84886258805 scopus 로고    scopus 로고
    • A Tableau calculus for minimal model reasoning
    • Miglioli et al
    • Ilkka Niemelfä. A Tableau Calculus for Minimal Model Reasoning. In Miglioli et al. MMMO96
    • MMMO96
    • Niemelfä, I.1
  • 23
    • 0001685428 scopus 로고
    • Automated deduction with hyper-resolution
    • J. A. Robinson. Automated deduction with hyper-resolution. Internat. J. Comput. Math., 1:227-234, 1965.
    • (1965) Internat. J. Comput. Math. , vol.1 , pp. 227-234
    • Robinson, J.A.1


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