| Horn programming in linear logic is NP-complete MI Kanovich [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer …, 1992 | 104 | 1992 |
| Inductive methods and contract-signing protocols R Chadha, M Kanovich, A Scedrov Proceedings of the 8th ACM Conference on Computer and Communications …, 2001 | 101 | 2001 |
| Foundations for decision problems in separation logic with general inductive predicates T Antonopoulos, N Gorogiannis, C Haase, M Kanovich, J Ouaknine International Conference on Foundations of Software Science and Computation …, 2014 | 87 | 2014 |
| Undecidability of propositional separation logic and its neighbours J Brotherston, M Kanovich 2010 25th Annual IEEE Symposium on Logic in Computer Science, 130-139, 2010 | 73 | 2010 |
| Linear logic as a logic of computations MI Kanovich Annals of pure and applied logic 67 (1-3), 183-212, 1994 | 71 | 1994 |
| The complexity of Horn fragments of linear logic MI Kanovich Annals of Pure and Applied Logic 69 (2-3), 195-241, 1994 | 68 | 1994 |
| The multiplicative fragment of linear logic is NP-complete MI Kanovich | 57 | 1991 |
| Petri nets, Horn programs, linear logic and vector games MI Kanovich Annals of Pure and Applied Logic 75 (1-2), 107-135, 1995 | 55 | 1995 |
| Subexponentials in non-commutative linear logic M Kanovich, S Kuznetsov, V Nigam, A Scedrov Mathematical Structures in Computer Science 29 (8), 1217-1249, 2019 | 51 | 2019 |
| The classical AI planning problems in the mirror of horn linear logic: semantics, expressibility, complexity M Kanovich, J Vauzeilles Mathematical Structures in Computer Science 11 (6), 689-716, 2001 | 47 | 2001 |
| The direct simulation of Minsky machines in linear logic MI Kanovich London Mathematical Society Lecture Note Series, 123-146, 1995 | 42 | 1995 |
| Interpreting strands in linear logic I Cervesato, N Durgin, M Kanovich, A Scedrov Carnegie Mellon University, 2000 | 41 | 2000 |
| Model checking for symbolic-heap separation logic with inductive predicates J Brotherston, N Gorogiannis, M Kanovich, R Rowe ACM SIGPLAN Notices 51 (1), 84-96, 2016 | 38 | 2016 |
| Undecidability of propositional separation logic and its neighbours J Brotherston, M Kanovich Journal of the ACM (JACM) 61 (2), 1-43, 2014 | 36 | 2014 |
| Temporal linear logic specifications for concurrent processes M Kanovich, T Ito Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 48-57, 1997 | 33 | 1997 |
| Specifying real-time finite-state systems in linear logic MI Kanovich, M Okada, A Scedrov Electronic Notes in Theoretical Computer Science 16 (1), 42-59, 1998 | 32 | 1998 |
| Biabduction (and related problems) in array separation logic J Brotherston, N Gorogiannis, M Kanovich International Conference on Automated Deduction, 472-490, 2017 | 31 | 2017 |
| Undecidability of the Lambek calculus with a relevant modality M Kanovich, S Kuznetsov, A Scedrov Formal Grammar: 20th and 21st International Conferences, FG 2015, Barcelona …, 2016 | 31 | 2016 |
| Collaborative planning with confidentiality M Kanovich, P Rowe, A Scedrov Journal of Automated Reasoning 46 (3), 389-421, 2011 | 29 | 2011 |
| Petri nets, Horn programs, linear logic, and vector games MI Kanovich International Symposium on Theoretical Aspects of Computer Software, 642-666, 1994 | 27 | 1994 |
