default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Shleyfman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Lee-or Alon, Hanna Weitman, Alexander Shleyfman, Gal A. Kaminka:
Planning to be Healthy: Towards Personalized Medication Planning. ECAI 2024: 4232-4239- [c27]Alexander Tuisov, Alexander Shleyfman, Erez Karpas:
Good Things Come to Those Who Wait: The Power of Sensing in Social Laws. ECAI 2024: 4328-4335 - [c26]Evgeny Mishlyakov, Mikhail Gruntov, Alexander Shleyfman, Erez Karpas:
A Deterministic Search Approach for Solving Stochastic Drone Search and Rescue Planning Without Communications. SOCS 2024: 73-81 - 2023
- [c25]Ronen Nir, Alexander Shleyfman, Erez Karpas:
Automated Verification of Social Laws in Numeric Settings. AAAI 2023: 12087-12094 - [c24]Alexander Shleyfman, Daniel Gnad, Peter Jonsson:
Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis. AAAI 2023: 12112-12119 - [c23]Daniel Gnad, Malte Helmert
, Peter Jonsson, Alexander Shleyfman:
Planning over Integers: Compilations and Undecidability. ICAPS 2023: 148-152 - [c22]Alexander Shleyfman, Ryo Kuroiwa, J. Christopher Beck:
Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning. ICAPS 2023: 393-401 - [c21]Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck:
Extracting and Exploiting Bounds of Numeric Variables for Optimal Linear Numeric Planning. ECAI 2023: 1332-1339 - 2022
- [j3]Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck:
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions. J. Artif. Intell. Res. 75: 1477-1548 (2022) - [c20]Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck:
LM-Cut Heuristics for Optimal Linear Numeric Planning. ICAPS 2022: 203-212 - 2021
- [j2]Alexander Shleyfman, Peter Jonsson:
Computational Complexity of Computing Symmetries in Finite-Domain Planning. J. Artif. Intell. Res. 70: 1183-1221 (2021) - [c19]Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck:
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions. ICAPS 2021: 210-218 - [c18]Anton Korikov, Alexander Shleyfman, J. Christopher Beck:
Counterfactual Explanations for Optimization-Based Decisions in the Context of the GDPR. IJCAI 2021: 4097-4103 - [c17]Ronen Nir, Alexander Shleyfman, Erez Karpas:
Learning-Based Synthesis of Social Laws in STRIPS. SOCS 2021: 88-96 - 2020
- [c16]Ronen Nir, Alexander Shleyfman, Erez Karpas:
Automated Synthesis of Social Laws in STRIPS. AAAI 2020: 9941-9948
2010 – 2019
- 2019
- [c15]Daniel Fiser, Álvaro Torralba, Alexander Shleyfman:
Operator Mutexes and Symmetries for Simplifying Planning Tasks. AAAI 2019: 7586-7593 - [c14]Alexander Shleyfman:
On Computational Complexity of Automorphism Groups in Classical Planning. ICAPS 2019: 428-436 - 2018
- [j1]Arik Senderovich, Alexander Shleyfman, Matthias Weidlich, Avigdor Gal, Avishai Mandelbaum:
To aggregate or to eliminate? Optimal model simplification for improved process performance prediction. Inf. Syst. 78: 96-111 (2018) - [c13]Alexander Shleyfman, Erez Karpas:
Position Paper: Reasoning About Domains with PDDL. AAAI Spring Symposia 2018 - 2017
- [c12]Daniel Gnad, Álvaro Torralba, Alexander Shleyfman, Jörg Hoffmann:
Symmetry Breaking in Star-Topology Decoupled Search. ICAPS 2017: 125-134 - [c11]Erez Karpas, Alexander Shleyfman, Moshe Tennenholtz:
Automated Verification of Social Law Robustness in STRIPS. ICAPS 2017: 163-171 - 2016
- [c10]Arik Senderovich, Alexander Shleyfman, Matthias Weidlich, Avigdor Gal, Avishai Mandelbaum:
P ^3 -Folder: Optimal Model Simplification for Improving Accuracy in Process Performance Prediction. BPM 2016: 418-436 - [c9]Alexander Shleyfman, Alexander Tuisov, Carmel Domshlak:
Blind Search for Atari-Like Online Planning Revisited. IJCAI 2016: 3251-3257 - 2015
- [c8]Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers, Martin Wehrle:
Heuristics and Symmetries in Classical Planning. AAAI 2015: 3371-3377 - [c7]Silvan Sievers, Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz:
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI 2015: 3378-3385 - [c6]Alexander Shleyfman, Antonín Komenda, Carmel Domshlak:
On Interruptible Pure Exploration in Multi-Armed Bandits. AAAI 2015: 3592-3598 - [c5]Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz:
Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. IJCAI 2015: 1712-1718 - 2014
- [c4]Antonín Komenda, Alexander Shleyfman, Carmel Domshlak:
On Robustness of CMAB Algorithms: Experimental Approach. CGW@ECAI 2014: 16-28 - [c3]Alexander Shleyfman, Antonín Komenda, Carmel Domshlak:
On Combinatorial Actions and CMABs with Linear Side Information. ECAI 2014: 825-830 - 2013
- [c2]Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Symmetry Breaking: Satisficing Planning and Landmark Heuristics. ICAPS 2013 - 2012
- [c1]Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search. ICAPS 2012
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-10-28 20:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
