| Natural deduction calculus for linear-time temporal logic A Bolotov, A Basukoski, O Grigoriev, V Shangin Logics in Artificial Intelligence: 10th European Conference, JELIA 2006 …, 2006 | 42 | 2006 |
| Automated first order natural deduction A Bolotov, V Bocharov, A Gorchakov, V Shangin ISCAI, 2005 | 36 | 2005 |
| Automated natural deduction for propositional linear-time temporal logic A Bolotov, O Grigoriev, V Shangin 14th International Symposium on Temporal Representation and Reasoning (TIME …, 2007 | 35 | 2007 |
| Socratic Proofs for Quantifiers★ A Wiśniewski, V Shangin Journal of Philosophical Logic 35 (2), 147-178, 2006 | 28 | 2006 |
| Natural deduction system in paraconsistent setting: Proof search for PCont A Bolotov, V Shangin Journal of Intelligent Systems 21 (1), 1-24, 2012 | 27 | 2012 |
| Correspondence analysis and automated proof-searching for first degree entailment Y Petrukhin, V Shangin European Journal of Mathematics 6 (4), 1452-1495, 2020 | 23 | 2020 |
| Natural deduction calculus for computation tree logic A Bolotov, O Grigoriev, V Shangin IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing …, 2006 | 20 | 2006 |
| Natural three-valued logics characterized by natural deduction Y Petrukhin, V Shangin Logique et Analyse, 407-427, 2018 | 17 | 2018 |
| Automated correspondence analysis for the binary extensions of the logic of paradox Y Petrukhin, V Shangin The Review of Symbolic Logic 10 (4), 756-781, 2017 | 15 | 2017 |
| Let the computer prove it A Bolotov, V Bocharov, A Gorchakov, V Makarov, V Shangin Nauka, 2004 | 15 | 2004 |
| A precise definition of an inference (by the example of natural deduction systems for logics I⟨ α, β⟩) VO Shangin Логические исследования 23 (1), 83-104, 2017 | 13 | 2017 |
| Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis Y Petrukhin, V Shangin Logic and logical philosophy 28 (2), 223–257-223–257, 2019 | 11 | 2019 |
| Functional completeness in CPL via correspondence analysis D Leszczyńska-Jasion, Y Petrukhin, V Shangin, M Jukiewicz Bulletin of the Section of Logic 48 (1), 45–76-45–76, 2019 | 7 | 2019 |
| Correspondence analysis for some fragments of classical propositional logic Y Petrukhin, V Shangin Logica Universalis 15 (1), 67-85, 2021 | 6 | 2021 |
| The method of Socratic proofs meets correspondence analysis D Leszczyńska-Jasion, Y Petrukhin, V Shangin Bulletin of the Section of Logic 48 (2), 99-116, 2019 | 5 | 2019 |
| Completeness via correspondence for extensions of paraconsistent weak Kleene logic Y Petrukhin, V Shangin The Proceedings of the 10th Smirnov Readings in Logic, 114-115, 2017 | 4 | 2017 |
| Natural deduction in a paracomplete setting AE Bolotov, VO Shangin Логические исследования, 224-247, 2014 | 4 | 2014 |
| Non-transitive correspondence analysis Y Petrukhin, V Shangin Journal of Logic, Language and Information 32 (2), 247-273, 2023 | 3 | 2023 |
| Paracomplete logic Kl: natural deduction, its automation, complexity and applications A Bolotov, D Kozhemiachenko, V Shangin Journal of Applied Logics-IfCoLog Journal of Logics and their Applications 5 …, 2018 | 3 | 2018 |
| Tackling incomplete system specifications using natural deduction in the paracomplete setting A Bolotov, V Shangin 2014 IEEE 38th Annual Computer Software and Applications Conference, 91-96, 2014 | 3 | 2014 |
Alexander BolotovUniversity of WestminsterZweryfikowany adres z wmin.ac.uk
