Papers

3

Total Citations

38

H-Index

3

About

Max Kanovich is a leading figure in the intersection of logic and artificial intelligence, renowned for pioneering the use of Horn linear logic to model and solve classical AI planning problems. His most cited work (2001, 26 citations) introduces a comprehensive logical framework that captures the semantics, expressibility, and complexity of planning—the quintessential challenge of enabling a robot to transition from an initial state to a set of goal states through a sequence of actions. This foundational paper demonstrates how Horn linear logic can circumvent the undecidability that plagues many planning formalisms, offering a robust theoretical backbone for automated reasoning. Kanovich has further advanced the field by tackling the computationally daunting problem of strong planning under uncertainty, particularly in domains with numerous but identical elements. His 2007 and 2003 contributions (9 and 3 citations, respectively) show how to cope polynomially with such complexity, providing generic approaches that scale efficiently. Through these works, Kanovich has solidified his reputation as a key architect of logical methods for AI, bridging theoretical computer science and practical planning systems.

Research Focus

Key Achievements

3
H-Index
3
Papers
38
Total Citations
13
Avg Citations/Paper
🏆 Most Cited Paper
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
26 citations · 2001
📈 Most Prolific Year: 2001 (1 Papers)
🤝 Key Collaborators: 1
🏛 Institutions: Russian State University for the Humanities, Queen Mary University of London, University of Pennsylvania

Top Papers

  1. 1
  2. 2
  3. 3

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago