Max I. Kanovich

	2012
40		Vivek Nigam, Tajana Ban Kirigin, Andre Scedrov, Carolyn L. Talcott, Max I. Kanovich, Ranko Perovic: Towards an automated assistant for clinical investigations. IHI 2012: 773-778
39		Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic: A Rewriting Framework for Activities Subject to Regulations. RTA 2012: 305-322
38		Max I. Kanovich: Light linear logics with controlled weakening: Expressibility, confluent strong normalization. Ann. Pure Appl. Logic 163(7): 854-874 (2012)
	2011
37		Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn: The Complexity of Abduction for Separated Heap Abstractions. SAS 2011: 25-42
36		Max I. Kanovich, Paul Rowe, Andre Scedrov: Collaborative Planning with Confidentiality. J. Autom. Reasoning 46(3-4): 389-421 (2011)
35		Max I. Kanovich, Jacqueline Vauzeilles: Linear logic as a tool for planning under temporal uncertainty. Theor. Comput. Sci. 412(20): 2072-2092 (2011)
	2010
34		Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov: Bounded Memory Dolev-Yao Adversaries in Collaborative Systems. Formal Aspects in Security and Trust 2010: 18-33
33		James Brotherston, Max I. Kanovich: Undecidability of Propositional Separation Logic and Its Neighbours. LICS 2010: 130-139
	2009
32		Max I. Kanovich, Paul Rowe, Andre Scedrov: Policy Compliance in Collaborative Systems. CSF 2009: 218-233
31		Max I. Kanovich: Light Linear Logic with Controlled Weakening. LFCS 2009: 246-264
	2007
30		Max I. Kanovich, Paul Rowe, Andre Scedrov: Collaborative Planning With Privacy. CSF 2007: 265-278
29		Max I. Kanovich: A Note on Rewriting Proofs and Fibonacci Numbers. LFCS 2007: 284-292
28		Max I. Kanovich: The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map. Discrete Mathematics 307(15): 1909-1935 (2007)
27		Max I. Kanovich, Jacqueline Vauzeilles: Strong planning under uncertainty in domains with numerous but identical elements (a generic approach). Theor. Comput. Sci. 379(1-2): 84-119 (2007)
	2006
26		Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui: Intuitionistic phase semantics is almost classical. Mathematical Structures in Computer Science 16(1): 67-86 (2006)
	2004
25		Max I. Kanovich: Finding direct partition bijections by two-directional rewriting techniques. Discrete Mathematics 285(1-3): 151-166 (2004)
	2003
24		Max I. Kanovich, Jacqueline Vauzeilles: Coping Polynomially with Numerous but Identical Elements within Planning Problems. CSL 2003: 285-298
23		Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Theor. Comput. Sci. 294(3): 525-549 (2003)
	2002
22		Max I. Kanovich: Bijections between Partitions by Two-Directional Rewriting Techniques. CSL 2002: 44-58
	2001
21		Rohit Chadha, Max I. Kanovich, Andre Scedrov: Inductive methods and contract-signing protocols. ACM Conference on Computer and Communications Security 2001: 176-185
20		Max I. Kanovich: The Expressive Power of Horn Monadic Linear Logic. CSL 2001: 39-53
19		Max I. Kanovich, Jacqueline Vauzeilles: The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity. Mathematical Structures in Computer Science 11(6): 689-716 (2001)
	1998
18		Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Specifying Real-Time Finite-State Systems in Linear Logic. Electr. Notes Theor. Comput. Sci. 16(1): 42-59 (1998)
	1997
17		Max I. Kanovich, Takayasu Ito: Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract). LICS 1997: 48-57
16		Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Electr. Notes Theor. Comput. Sci. 6: 221-234 (1997)
	1996
15		Max I. Kanovich: Linear Logic Automata. Ann. Pure Appl. Logic 78(1-3): 147-188 (1996)
14		Max I. Kanovich: Simulating Computations in Second Order Non-Commutative Linear Logic. Electr. Notes Theor. Comput. Sci. 3: 106 (1996)
	1995
13		Max I. Kanovich: The Complexity of Neutrals in Linear Logic LICS 1995: 486-495
12		Max I. Kanovich: Petri Nets, Horn Programs, Linear Logic and Vector Games. Ann. Pure Appl. Logic 75(1-2): 107-135 (1995)
	1994
11		Max I. Kanovich, Zoya M. Shalyapina: The Rumors System Of Russian Synthesis. COLING 1994: 177-179
10		Max I. Kanovich: Computational and Concurrency Aspects of Linear Logic. IFIP Congress (1) 1994: 336-341
9		Max I. Kanovich: Computational and Concurrency Models of Linear Logic. LFCS 1994: 184-190
8		Max I. Kanovich: Petri Nets, Horn Programs, Linear Logic, and Vector Games. TACS 1994: 642-666
7		Max I. Kanovich: Simulating Guarded Programs in Linear Logic. Theory and Practice of Parallel Programming 1994: 45-69
6		Max I. Kanovich: Linear Logic as a Logic of Computations. Ann. Pure Appl. Logic 67(1-3): 183-212 (1994)
5		Max I. Kanovich: The Complexity of Horn Fragments of Linear Logic. Ann. Pure Appl. Logic 69(2-3): 195-241 (1994)
	1992
4		Max I. Kanovich: Horn Programming in Linear Logic Is NP-Complete LICS 1992: 200-210
	1991
3		Max I. Kanovich: Efficient Program Synthesis: Semantics, Logic, Complexity. TACS 1991: 615-632
	1990
2		Max I. Kanovich: Efficient Program Synthesis in Computational Models. J. Log. Program. 9(2&3): 159-177 (1990)
	1989
1		Max I. Kanovich: What is the Logic of Computational Tasks? Logic at Botik 1989: 181-185

Coauthor Index

1	James Brotherston	[33]
2	Rohit Chadha	[21]
3	Nikos Gorogiannis	[37]
4	Takayasu Ito	[17]
5	Tajana Ban Kirigin	[34] [39] [40]
6	Vivek Nigam	[34] [39] [40]
7	Peter W. O'Hearn	[37]
8	Mitsuhiro Okada	[16] [18] [23] [26]
9	Ranko Perovic	[39] [40]
10	Paul Rowe	[30] [32] [36]
11	Andre Scedrov	[16] [18] [21] [23] [30] [32] [34] [36] [39] [40]
12	Zoya M. Shalyapina	[11]
13	Carolyn L. Talcott	[39] [40]
14	Kazushige Terui	[26]
15	Jacqueline Vauzeilles	[19] [24] [27] [35]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page