Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMichael Katz 0001
Person information
- affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA
- affiliation (former): IBM Watson Health, Haifa, Israel
- affiliation (former): Saarland University, Department of Computer Science, Saarbrücken, Germany
- affiliation (former): Technion - Israel Institute of Technology, Faculty of Industrial Engineering & Management, Haifa, Israel
Other persons with the same name
- Michael Katz — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c39]Tengfei Ma, Patrick Ferber, Siyu Huo, Jie Chen, Michael Katz:
Online Planner Selection with Graph Neural Networks and Adaptive Scheduling. AAAI 2020: 5077-5084- [c38]Michael Katz, Shirin Sohrabi:
Reshaping Diverse Planning. AAAI 2020: 9892-9899 - [c37]Michael Katz, Shirin Sohrabi, Octavian Udrea:
Top-Quality Planning: Finding Practically Useful Sets of Best Plans. AAAI 2020: 9900-9907 - [c36]Oktie Hassanzadeh, Debarun Bhattacharjya, Mark Feblowitz, Kavitha Srinivas, Michael Perrone, Shirin Sohrabi, Michael Katz:
Causal Knowledge Extraction through Large-Scale Text Mining. AAAI 2020: 13610-13611 - [c35]Michael Katz, Parikshit Ram, Shirin Sohrabi, Octavian Udrea:
Exploring Context-Free Languages via Planning: The Case for Automating Machine Learning. ICAPS 2020: 403-411
2010 – 2019
- 2019
- [j7]Shirin Sohrabi, Michael Katz, Oktie Hassanzadeh
, Octavian Udrea, Mark D. Feblowitz, Anton Riabov:
IBM Scenario Planning Advisor: Plan recognition as AI planning in practice. AI Commun. 32(1): 1-13 (2019) - [c34]Michael Katz:
Red-Black Heuristics for Planning Tasks with Conditional Effects. AAAI 2019: 7619-7626 - [c33]Silvan Sievers, Michael Katz, Shirin Sohrabi, Horst Samulowitz, Patrick Ferber:
Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection. AAAI 2019: 7715-7723 - [c32]Michael Katz, Emil Keyder, Dominik Winterer, Florian Pommerening:
Oversubscription Planning as Classical Planning with Multiple Cost Functions. ICAPS 2019: 237-245 - [c31]Silvan Sievers, Gabriele Röger, Martin Wehrle, Michael Katz:
Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks. ICAPS 2019: 446-454 - [c30]Maja Vukovic, Scott N. Gerard, Rick Hull, Michael Katz, Laura Shwartz, Shirin Sohrabi, Christian Muise, John J. Rofrano, Anup K. Kalia, Jinho Hwang, Yabin Dang, Jie Ma, Zhuoxuan Jiang:
Towards Automated Planning for Enterprise Services: Opportunities and Challenges. ICSOC 2019: 64-68 - [c29]Oktie Hassanzadeh, Debarun Bhattacharjya, Mark Feblowitz, Kavitha Srinivas, Michael Perrone, Shirin Sohrabi, Michael Katz:
Answering Binary Causal Questions Through Large-Scale Text Mining: An Evaluation Using Cause-Effect Pairs from Human Experts. IJCAI 2019: 5003-5009 - [i3]Patrick Ferber, Tengfei Ma, Siyu Huo, Jie Chen, Michael Katz:
IPC: A Benchmark Data Set for Learning with Graph-Structured Data. CoRR abs/1905.06393 (2019) - 2018
- [c28]Shirin Sohrabi, Anton V. Riabov, Michael Katz, Octavian Udrea:
An AI Planning Solution to Scenario Generation for Enterprise Risk Management. AAAI 2018: 160-167 - [c27]Michael Katz, Dany Moshkovich, Erez Karpas:
Semi-Black Box: Rapid Development of Planning Based Solutions. AAAI 2018: 6211-6218 - [c26]Michael Katz, Shirin Sohrabi, Octavian Udrea, Dominik Winterer:
A Novel Iterative Approach to Top-k Planning. ICAPS 2018: 132-140 - [c25]Gabriele Röger, Silvan Sievers, Michael Katz:
Symmetry-Based Task Reduction for Relaxed Reachability Analysis. ICAPS 2018: 208-217 - [c24]Shirin Sohrabi, Michael Katz, Oktie Hassanzadeh, Octavian Udrea, Mark D. Feblowitz:
IBM Scenario Planning Advisor: Plan Recognition as AI Planning in Practice. IJCAI 2018: 5865-5867 - [i2]Tengfei Ma, Patrick Ferber, Siyu Huo, Jie Chen, Michael Katz:
Adaptive Planner Scheduling with Graph Neural Networks. CoRR abs/1811.00210 (2018) - 2017
- [c23]Michael Katz, Nir Lipovetzky, Dany Moshkovich, Alexander Tuisov:
Adapting Novelty to Classical Planning as Heuristic Search. ICAPS 2017: 172-180 - [c22]Dominik Winterer, Yusra Alkhazraji, Michael Katz, Martin Wehrle:
Stubborn Sets for Fully Observable Nondeterministic Planning. ICAPS 2017: 330-338 - [c21]Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz:
Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS 2017: 91-99 - 2016
- [c20]Michael Katz, Vitaly Mirkis:
In Search of Tractability for Partial Satisfaction Planning. IJCAI 2016: 3154-3160 - [c19]Dominik Winterer, Martin Wehrle, Michael Katz:
Structural Symmetries for Fully Observable Nondeterministic Planning. IJCAI 2016: 3293-3299 - 2015
- [j6]Carmel Domshlak, Jörg Hoffmann, Michael Katz:
Red-black planning: A new systematic approach to partial delete relaxation. Artif. Intell. 221: 73-114 (2015) - [c18]Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers, Martin Wehrle:
Heuristics and Symmetries in Classical Planning. AAAI 2015: 3371-3377 - [c17]Silvan Sievers, Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz:
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI 2015: 3378-3385 - [c16]Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz:
Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. IJCAI 2015: 1712-1718 - [c15]Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz:
An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search. KI 2015: 166-180 - 2014
- [i1]Michael Katz, Carmel Domshlak:
Implicit Abstraction Heuristics. CoRR abs/1401.3853 (2014) - 2013
- [c14]Michael Katz, Jörg Hoffmann, Carmel Domshlak:
Red-Black Relaxed Plan Heuristics. AAAI 2013 - [c13]Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Symmetry Breaking: Satisficing Planning and Landmark Heuristics. ICAPS 2013 - [c12]Michael Katz, Jörg Hoffmann, Carmel Domshlak:
Who Said We Need to Relax All Variables? ICAPS 2013 - [c11]Avigdor Gal, Michael Katz, Tomer Sagi, Matthias Weidlich, Karl Aberer, Nguyen Quoc Viet Hung, Zoltán Miklós, Eliezer Levy, Victor Shafran:
Completeness and Ambiguity of Schema Cover. OTM Conferences 2013: 241-258 - [c10]Michael Katz, Jörg Hoffmann:
Red-Black Relaxed Plan Heuristics Reloaded. SOCS 2013 - 2012
- [j5]Carmel Domshlak, Michael Katz, Sagi Lefler:
Landmark-enhanced abstraction heuristics. Artif. Intell. 189: 48-68 (2012) - [c9]Michael Katz, Emil Keyder:
Structural Patterns Beyond Forks: Extending the Complexity Boundaries of Classical Planning. AAAI 2012 - [c8]Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search. ICAPS 2012 - [c7]Michael Katz, Jörg Hoffmann, Malte Helmert:
How to Relax a Bisimulation? ICAPS 2012 - 2011
- [j4]Michael Katz:
Implicit abstraction heuristics for cost-optimal planning. AI Commun. 24(4): 343-345 (2011) - [c6]Erez Karpas, Michael Katz, Shaul Markovitch:
When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings. ICAPS 2011 - 2010
- [j3]Michael Katz, Carmel Domshlak:
Optimal admissible composition of abstraction heuristics. Artif. Intell. 174(12-13): 767-798 (2010) - [j2]Michael Katz, Carmel Domshlak:
Implicit Abstraction Heuristics. J. Artif. Intell. Res. 39: 51-126 (2010) - [c5]Carmel Domshlak, Michael Katz, Sagi Lefler:
When Abstractions Met Landmarks. ICAPS 2010: 50-56
2000 – 2009
- 2009
- [c4]Michael Katz, Carmel Domshlak:
Structural-Pattern Databases. ICAPS 2009 - 2008
- [j1]Michael Katz, Carmel Domshlak:
New Islands of Tractability of Cost-Optimal Planning. J. Artif. Intell. Res. 32: 203-288 (2008) - [c3]Michael Katz, Carmel Domshlak:
Optimal Additive Composition of Abstraction-based Admissible Heuristics. ICAPS 2008: 174-181 - [c2]Michael Katz, Carmel Domshlak:
Structural Patterns Heuristics via Fork Decomposition. ICAPS 2008: 182-189 - 2007
- [c1]Michael Katz, Carmel Domshlak:
Structural Patterns of Tractable Sequentially-Optimal Planning. ICAPS 2007: 200-207
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-04-11 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
