Evidence algorithm and sequent logical inference search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1705 LNAI, Issue , 1999, Pages 44-61

  Degtyarev, Anatoli I ^a,c   Lyaletski, Alexander V ^b   Morokhovets, Marina K ^c  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

^b TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

^c V M GLUSHKOV INSTITUTE OF CYBERNETICS   (Ukraine)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER CIRCUITS; INFERENCE ENGINES;

AUTOMATED SEARCHES; CLASSICAL LOGIC; DEDUCTIVE TECHNIQUES; EVIDENCE ALGORITHMS; FIRST-ORDER LANGUAGE; LOGICAL INFERENCE; NATURAL LANGUAGES; SOUNDNESS AND COMPLETENESS;

CALCULATIONS;

EID: 22844456306     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_4     Document Type: Conference Paper

References (25)

1. Degtyaurev, A., Lyeiletski, A.: Logical inference in SAD (In Russian). In: Kapitonova, Yu. (ed.): Matematicheskie osnovy sistem iskusstvennogo intellekta. Institute of Cybernetics, Kiev (1981) 3-11
2. Lyaletski, A.: Gentzen Cetlculi and admissible substitutions. In: Actes preliminaries, du Simposium Pranco-Sovetique "Informatika-91". Grenoble, Preince (1991) 99-111
3. Glushkov, v.: Some problems of automata theory and artificial intelligence (in Russian). Kibernetika 2 (1970) 3-13
4. Anufriyev, F., Fediurko, V., Letichevski, A., Asel'derov, Z., Didukh I.: On one algorithm of theorem proof search in Group Theory (in RussiEtn). Kibernetika 1 (1966) 23-29
5. Anufriyev, F.: An algorithm of theorem proof search in logiccd calculi (in Russian). In: Teoriya avtomatov 5. Institute of Cybernetics, Kiev (1969) 3-26
6. Glushkov, V, Vershinin, K., Kapitonova, Yu., Letichevski, A., Madevanniy, N., Kostyrko, V.: On a formsil language for description of mathematical texts (in Russian). In: Avtomatizatsiya poiska dokazatel'stv teorem v matematike. Institute of Cybernetics, Kiev (1974) 3-36
7. Degtyarev, A.: The strategy of monotone puramodulation (in Russian). In: Proc.of 5th All Soviet Union conf.on mathematical logic. Novosibirsk (1979) 39
8. Atayan, V., Vershinin, K.: On formalization of some inference search methods (in Russicin). In: Avtomatizatsiya obrabotki matematicheskikh tekstov. Institute of Cybernetics, Kiev (1980) 36-52
9. Kapitonova, Yu., Vershinin, K., Degtyarev, A., Zhezherun, A., Lyaletski, A.: On a system for mathematical texts processing (in Russian). Kibernetika 2 (1979) 48
10. Glushkov, v.: The System for Proving Automation (in Russian). In: Avtomatizatsiya obrabotki matematicheskikh tekstov. Institute of Cybernetics, Kiev (1980) 3-30
11. Degtyarev, A.: Equality handling techniques in theories with a full set of reductions (in Russian). In: Matematicheskoye obespecheniye sistem logicheskogo vyvoda i deduktivnych postroyeniy na EVM. Institute of Cybernetics, Kiev (1983) 42-55
12. Atayan, V., Morokhovets, M.: Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system. Cybernetics and System Analysis 32 (1996) 442-465
13. Degtyarev, A., Kapitonova, Yu., Letichevski, A., Lyeiletski, A., Morokhovets, M.: A brief historical sketch on Kiev school of automated theorem proving. In: Buchberger, B., Jebelean, T. (eds.): Proc. Second International THEOREMA Workshop. RISC, Linz, Austria (1998) 151-155
14. GcJlier, J. : Logic for computer science: foundations of Automatic Theorem Proving. Harper and Row, Inc. New York (1986) 513 p
15. Robinson, J.: A Machine-Oriented Logic Based on Resolution Principle. JACM (1965) 23-41
16. Kanger, S.: Simplified proof method for elementciry logic. In: Comp. Program, and Form. Sys.: Stud, in Logic. Amsterdam, North-Holland, Publ. Co. (1963) 87-93
17. Lyeiletski, A.V.: Variant of Herbreind Theorem for Formulas in Prefix Form (in Russian). Kibernetika 1 (1981) 112-116
18. Atayan, V., Vershinin, K., Zhezherun, A.: On structureil processing of mathematical texts (in Russian). In: Raspoznaveiniye obrazov. Institute of Cybernetics, Kiev (1978) 43-54
19. Morokhovets, M., Luzhnykh, A.: Representing mathematical texts in a formeilized natural-like language. In: Buchberger, B., Jebelean, T. (eds.): Proc. Second International THEOREMA Workshop. RISC, Linz, Austria (1998) 157-160
20. http://www-formal.stanford.edu/clt/ARS/systems.html
21. http://mizcir.uw.bialostok.pl/
22. Buchberger, B., Jebeleem, T., Kriftner, F., Mctrin, M., Tomuta, E., Vasaru, D.: A survey of the Theorema project. In: KuechUn, W. (ed.): Proc. ISSAC'97, Maui, Hawaii (1997) 384-391
23. http://www.ags.uni-sb.de/projects/deduktion/projects/omega/
24. http://www.cl.CEim.eic.uk/Research/HVG/Isabelle/
25. http://www.Cybercom.net/rbjones/rbjpub/logic/qedresOO.htm