Michael Katz 0001

36 publications

6 venues

H Index15

Affiliation

Saarland University, Department of Computer Science, Saarbrücken
IBM Watson Health, Haifa, Israel
IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA

Links

Name Venue Year Citations
Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning. AAAI 2012 16
Implicit Abstraction Heuristics. JAIR 2010 50
Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search. ICAPS 2012 39
Structural Symmetries for Fully Observable Nondeterministic Planning. IJCAI 2016 2
When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings. ICAPS 2011 8
Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection. AAAI 2019 8
Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks. ICAPS 2019 2
New Islands of Tractability of Cost-Optimal Planning. JAIR 2008 33
Landmark-enhanced abstraction heuristics. Artificial Intelligence 2012 12
Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. IJCAI 2015 10
An AI Planning Solution to Scenario Generation for Enterprise Risk Management. AAAI 2018 9
Structural-Pattern Databases. ICAPS 2009 15
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI 2015 14
When Abstractions Met Landmarks. ICAPS 2010 12
Optimal Additive Composition of Abstraction-based Admissible Heuristics. ICAPS 2008 49
Red-Black Heuristics for Planning Tasks with Conditional Effects. AAAI 2019 1
Oversubscription Planning as Classical Planning with Multiple Cost Functions. ICAPS 2019 2
Red-Black Relaxed Plan Heuristics Reloaded. SOCS 2013 15
Symmetry Breaking: Satisficing Planning and Landmark Heuristics. ICAPS 2013 18
Stubborn Sets for Fully Observable Nondeterministic Planning. ICAPS 2017 3
Symmetry-Based Task Reduction for Relaxed Reachability Analysis. ICAPS 2018 4
Adapting Novelty to Classical Planning as Heuristic Search. ICAPS 2017 12
Red-black planning: A new systematic approach to partial delete relaxation. Artificial Intelligence 2015 52
Answering Binary Causal Questions Through Large-Scale Text Mining: An Evaluation Using Cause-Effect Pairs from Human Experts. IJCAI 2019 2
In Search of Tractability for Partial Satisfaction Planning. IJCAI 2016 3
Semi-Black Box: Rapid Development of Planning Based Solutions. AAAI 2018 0
Red-Black Relaxed Plan Heuristics. AAAI 2013 21
Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS 2017 4
Who Said We Need to Relax All Variables? ICAPS 2013 31
How to Relax a Bisimulation? ICAPS 2012 13
Structural Patterns Heuristics via Fork Decomposition. ICAPS 2008 42
IBM Scenario Planning Advisor: Plan Recognition as AI Planning in Practice. IJCAI 2018 4
Optimal admissible composition of abstraction heuristics. Artificial Intelligence 2010 46
Structural Patterns of Tractable Sequentially-Optimal Planning. ICAPS 2007 20
Heuristics and Symmetries in Classical Planning. AAAI 2015 29
A Novel Iterative Approach to Top-k Planning. ICAPS 2018 16
Copyright ©2019 Universität Würzburg
Website created in context of the REGIO Project
Impressum | Privacy | FAQ