Michael Katz 0001
74 publications
9 venues
H Index 23
Affiliation
IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USAIBM Watson Health, Haifa, Israel
Saarland University, Department of Computer Science, Saarbr cken, Germany
Technion - Israel Institute of Technology, Faculty of Industrial Engineering & Management, Haifa, Israel
Links
| Name | Venue | Year | citations |
|---|---|---|---|
QueryGym: Step-by-Step Interaction with Relational Databases.
|
AAAI | 2026 | 0 |
| Automating Thought of Search: A Journey Towards Soundness and Completeness (Student Abstract).
|
AAAI | 2025 | 1 |
| ACPBench: Reasoning About Action, Change, and Planning.
|
AAAI | 2025 | 0 |
| Large Language Models as Planning Domain Generators (Student Abstract).
|
AAAI | 2024 | 2 |
| Unifying and Certifying Top-Quality Planning.
|
ICAPS | 2024 | 1 |
| Interactive Plan Selection Using Linear Temporal Logic, Disjunctive Action Landmarks, and Natural Language Instruction.
|
AAAI | 2024 | 3 |
| Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning.
|
SOCS | 2024 | 1 |
| Thought of Search: Planning with Language Models Through The Lens of Efficiency.
|
NIPS/NeurIPS | 2024 | 34 |
| Partially Observable Hierarchical Reinforcement Learning with AI Planning (Student Abstract).
|
AAAI | 2024 | 3 |
| Can LLMs Fix Issues with Reasoning Models? Towards More Likely Models for AI Planning.
|
AAAI | 2024 | 0 |
| Generalized Planning in PDDL Domains with Pretrained Large Language Models.
|
AAAI | 2024 | 0 |
| Large Language Models as Planning Domain Generators.
|
ICAPS | 2024 | 0 |
| Generating SAS+ Planning Tasks of Specified Causal Structure.
|
SOCS | 2023 | 0 |
| K∗ Search over Orbit Space for Top-k Planning.
|
IJCAI | 2023 | 7 |
| Optimistic Exploration in Reinforcement Learning Using Symbolic Model Estimates.
|
NIPS/NeurIPS | 2023 | 9 |
| On K* Search for Top-K Planning.
|
SOCS | 2023 | 11 |
| K∗ and Partial Order Reduction for Top-Quality Planning.
|
SOCS | 2023 | 10 |
| On Partial Satisfaction Planning with Total-Order HTNs.
|
ICAPS | 2023 | 1 |
| Action Space Reduction for Planning Domains.
|
IJCAI | 2023 | 1 |
| PARIS: Planning Algorithms for Reconfiguring Independent Sets.
|
ECAI | 2023 | 0 |
| Conflict-Directed Diverse Planning for Logic-Geometric Programming.
|
ICAPS | 2022 | 9 |
| How to Reduce Action Space for Planning Domains? (Student Abstract).
|
AAAI | 2022 | 0 |
| Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria.
|
ICAPS | 2022 | 6 |
| A* Search and Bound-Sensitive Heuristics for Oversubscription Planning.
|
AAAI | 2022 | 5 |
| Bounding Quality in Diverse Planning.
|
AAAI | 2022 | 10 |
| A Conflict-Driven Interface Between Symbolic Planning and Nonlinear Constraint Solving.
|
IEEE Robotics and Automation Letters | 2022 | 10 |
| On Producing Shortest Cost-Optimal Plans.
|
SOCS | 2022 | 2 |
| Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators.
|
ICAPS | 2022 | 0 |
| The Fewer the Merrier: Pruning Preferred Operators with Novelty.
|
IJCAI | 2021 | 2 |
| IBM Scenario Planning Advisor: A Neuro-Symbolic ERM Solution.
|
AAAI | 2021 | 7 |
| Custom-Design of FDR Encodings: The Case of Red-Black Planning.
|
IJCAI | 2021 | 3 |
| Symbolic Search for Oversubscription Planning.
|
AAAI | 2021 | 5 |
| Efficient Black-Box Planning Using Macro-Actions with Focused Effects.
|
IJCAI | 2021 | 0 |
| Reshaping Diverse Planning.
|
AAAI | 2020 | 54 |
| Exploring Context-Free Languages via Planning: The Case for Automating Machine Learning.
|
ICAPS | 2020 | 23 |
| Causal Knowledge Extraction through Large-Scale Text Mining.
|
AAAI | 2020 | 22 |
| Top-Quality Planning: Finding Practically Useful Sets of Best Plans.
|
AAAI | 2020 | 36 |
| Online Planner Selection with Graph Neural Networks and Adaptive Scheduling.
|
AAAI | 2020 | 0 |
| Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks.
|
ICAPS | 2019 | 28 |
| Answering Binary Causal Questions Through Large-Scale Text Mining: An Evaluation Using Cause-Effect Pairs from Human Experts.
|
IJCAI | 2019 | 56 |
| Oversubscription Planning as Classical Planning with Multiple Cost Functions.
|
ICAPS | 2019 | 13 |
| Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection.
|
AAAI | 2019 | 43 |
| Red-Black Heuristics for Planning Tasks with Conditional Effects.
|
AAAI | 2019 | 5 |
| An AI Planning Solution to Scenario Generation for Enterprise Risk Management.
|
AAAI | 2018 | 55 |
| Semi-Black Box: Rapid Development of Planning Based Solutions.
|
AAAI | 2018 | 5 |
| IBM Scenario Planning Advisor: Plan Recognition as AI Planning in Practice.
|
IJCAI | 2018 | 25 |
| Symmetry-Based Task Reduction for Relaxed Reachability Analysis.
|
ICAPS | 2018 | 19 |
| A Novel Iterative Approach to Top-k Planning.
|
ICAPS | 2018 | 67 |
| Strengthening Canonical Pattern Databases with Structural Symmetries.
|
SOCS | 2017 | 6 |
| Adapting Novelty to Classical Planning as Heuristic Search.
|
ICAPS | 2017 | 32 |
| Stubborn Sets for Fully Observable Nondeterministic Planning.
|
ICAPS | 2017 | 8 |
| Structural Symmetries for Fully Observable Nondeterministic Planning.
|
IJCAI | 2016 | 7 |
| In Search of Tractability for Partial Satisfaction Planning.
|
IJCAI | 2016 | 8 |
| Red-black planning: A new systematic approach to partial delete relaxation.
|
Artificial Intelligence | 2015 | 93 |
| Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning.
|
IJCAI | 2015 | 19 |
| Heuristics and Symmetries in Classical Planning.
|
AAAI | 2015 | 62 |
| Factored Symmetries for Merge-and-Shrink Abstractions.
|
AAAI | 2015 | 23 |
| Red-Black Relaxed Plan Heuristics Reloaded.
|
SOCS | 2013 | 17 |
| Red-Black Relaxed Plan Heuristics.
|
AAAI | 2013 | 26 |
| Who Said We Need to Relax All Variables?
|
ICAPS | 2013 | 33 |
| Symmetry Breaking: Satisficing Planning and Landmark Heuristics.
|
ICAPS | 2013 | 30 |
| Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search.
|
ICAPS | 2012 | 72 |
| Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning.
|
AAAI | 2012 | 19 |
| Landmark-enhanced abstraction heuristics.
|
Artificial Intelligence | 2012 | 16 |
| How to Relax a Bisimulation?
|
ICAPS | 2012 | 0 |
| When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings.
|
ICAPS | 2011 | 12 |
| When Abstractions Met Landmarks.
|
ICAPS | 2010 | 18 |
| Optimal admissible composition of abstraction heuristics.
|
Artificial Intelligence | 2010 | 87 |
| Implicit Abstraction Heuristics.
|
JAIR | 2010 | 66 |
| Structural-Pattern Databases.
|
ICAPS | 2009 | 14 |
| New Islands of Tractability of Cost-Optimal Planning.
|
JAIR | 2008 | 41 |
| Structural Patterns Heuristics via Fork Decomposition.
|
ICAPS | 2008 | 55 |
| Optimal Additive Composition of Abstraction-based Admissible Heuristics.
|
ICAPS | 2008 | 76 |
| Structural Patterns of Tractable Sequentially-Optimal Planning.
|
ICAPS | 2007 | 19 |