default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarmel Domshlak
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
[c58]Alexander Shleyfman, Alexander Tuisov, Carmel Domshlak:
Blind Search for Atari-Like Online Planning Revisited. IJCAI 2016: 3251-3257- 2015
- [j31]Carmel Domshlak, Jörg Hoffmann, Michael Katz:
Red-black planning: A new systematic approach to partial delete relaxation. Artif. Intell. 221: 73-114 (2015) - [j30]Carmel Domshlak, Vitaly Mirkis:
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations. J. Artif. Intell. Res. 52: 97-169 (2015) - [c57]Alexander Shleyfman, Antonín Komenda, Carmel Domshlak:
On Interruptible Pure Exploration in Multi-Armed Bandits. AAAI 2015: 3592-3598 - [c56]Daniel Gnad, Jörg Hoffmann, Carmel Domshlak:
From Fork Decoupling to Star-Topology Decoupling. SOCS 2015: 53-61 - [e2]Ronen I. Brafman, Carmel Domshlak, Patrik Haslum, Shlomo Zilberstein:
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, ICAPS 2015, Jerusalem, Israel, June 7-11, 2015. AAAI Press 2015, ISBN 978-1-57735-731-5 [contents] - 2014
- [j29]Zohar Feldman, Carmel Domshlak:
Simple Regret Optimization in Online Planning for Markov Decision Processes. J. Artif. Intell. Res. 51: 165-205 (2014) - [c55]Carmel Domshlak, Anton Nazarenko:
The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph. ICAPS 2014 - [c54]Zohar Feldman, Carmel Domshlak:
On MABs and Separation of Concerns in Monte-Carlo Planning for MDPs. ICAPS 2014 - [c53]Antonín Komenda, Alexander Shleyfman, Carmel Domshlak:
On Robustness of CMAB Algorithms: Experimental Approach. CGW@ECAI 2014: 16-28 - [c52]Zohar Feldman, Carmel Domshlak:
Monte-Carlo Tree Search: To MC or to DP? ECAI 2014: 321-326 - [c51]Vitaly Mirkis, Carmel Domshlak:
Landmarks in Oversubscription Planning. ECAI 2014: 633-638 - [c50]Alexander Shleyfman, Antonín Komenda, Carmel Domshlak:
On Combinatorial Actions and CMABs with Linear Side Information. ECAI 2014: 825-830 - [i16]Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
Generic Preferences over Subsets of Structured Objects. CoRR abs/1401.3459 (2014) - [i15]Michael Katz, Carmel Domshlak:
Implicit Abstraction Heuristics. CoRR abs/1401.3853 (2014) - [i14]Carmel Domshlak, Erez Karpas, Shaul Markovitch:
Online Speedup Learning for Optimal Planning. CoRR abs/1401.5861 (2014) - 2013
- [j28]Ronen I. Brafman
, Carmel Domshlak:
On the complexity of planning for agent teams and its implications for single agent planning. Artif. Intell. 198: 52-71 (2013) - [j27]Carmel Domshlak, Anton Nazarenko:
The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph. J. Artif. Intell. Res. 48: 783-812 (2013) - [c49]Erez Karpas, Tomer Sagi, Carmel Domshlak, Avigdor Gal, Avi Mendelson, Moshe Tennenholtz:
Data-Parallel Computing Meets STRIPS. AAAI 2013: 474-480 - [c48]Michael Katz, Jörg Hoffmann, Carmel Domshlak:
Red-Black Relaxed Plan Heuristics. AAAI 2013: 489-495 - [c47]Carmel Domshlak:
Fault Tolerant Planning: Complexity and Compilation. ICAPS 2013 - [c46]Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Symmetry Breaking: Satisficing Planning and Landmark Heuristics. ICAPS 2013 - [c45]Michael Katz, Jörg Hoffmann, Carmel Domshlak:
Who Said We Need to Relax All Variables? ICAPS 2013 - [c44]Vitaly Mirkis, Carmel Domshlak:
Abstractions for Oversubscription Planning. ICAPS 2013 - [c43]Carmel Domshlak, Zohar Feldman:
To UCT, or not to UCT? (Position Paper). SOCS 2013: 63-70 - [c42]Zohar Feldman, Carmel Domshlak:
Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency. UAI 2013 - [i13]Ronen I. Brafman, Carmel Domshlak:
Introducing Variable Importance Tradeoffs into CP-Nets. CoRR abs/1301.0558 (2013) - [i12]Solomon Eyal Shimony, Carmel Domshlak, Eugene Santos Jr.:
Cost-Sharing in Bayesian Knowledge Bases. CoRR abs/1302.1567 (2013) - [i11]Zohar Feldman, Carmel Domshlak:
Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency. CoRR abs/1309.6828 (2013) - 2012
- [j26]Carmel Domshlak, Michael Katz, Sagi Lefler:
Landmark-enhanced abstraction heuristics. Artif. Intell. 189: 48-68 (2012) - [j25]Carmel Domshlak, Erez Karpas, Shaul Markovitch:
Online Speedup Learning for Optimal Planning. J. Artif. Intell. Res. 44: 709-755 (2012) - [c41]Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search. ICAPS 2012 - [c40]Erez Karpas, Carmel Domshlak:
Optimal Search with Inadmissible Heuristics. ICAPS 2012 - [i10]Zohar Feldman, Carmel Domshlak:
Online Planning in MDPs: Rationality and Optimization. CoRR abs/1206.3382 (2012) - [i9]Carmel Domshlak, Thorsten Joachims:
Unstructuring User Preferences: Efficient Non-Parametric Utility Revelation. CoRR abs/1207.1390 (2012) - [i8]Ronen I. Brafman, Carmel Domshlak, Tanya Kogan:
Compact Value-Function Representations for Qualitative Preferences. CoRR abs/1207.4126 (2012) - 2011
- [j24]Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci, Henri Prade:
Preferences in AI: An overview. Artif. Intell. 175(7-8): 1037-1052 (2011) - [c39]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Zohar Feldman:
Planning for Operational Control Systems with Predictable Exogenous Events. AAAI 2011: 940-945 - [e1]Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert:
Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI 2011 [contents] - [i7]Ronen I. Brafman, Carmel Domshlak:
Structure and Complexity in Planning with Unary Operators. CoRR abs/1106.5256 (2011) - [i6]Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole:
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements. CoRR abs/1107.0023 (2011) - [i5]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
On Graphical Modeling of Preference and Importance. CoRR abs/1109.6345 (2011) - [i4]Carmel Domshlak, Jörg Hoffmann:
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting. CoRR abs/1111.0044 (2011) - 2010
- [j23]Michael Katz, Carmel Domshlak:
Optimal admissible composition of abstraction heuristics. Artif. Intell. 174(12-13): 767-798 (2010) - [j22]Michael Katz, Carmel Domshlak:
Implicit Abstraction Heuristics. J. Artif. Intell. Res. 39: 51-126 (2010) - [c38]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Transferable Utility Planning Games. AAAI 2010: 709-714 - [c37]Carmel Domshlak, Erez Karpas, Shaul Markovitch:
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning. AAAI 2010: 1071-1076 - [c36]Carmel Domshlak, Michael Katz, Sagi Lefler:
When Abstractions Met Landmarks. ICAPS 2010: 50-56 - [c35]Raz Nissim, Ronen I. Brafman, Carmel Domshlak:
A general, fully distributed multi-agent planning algorithm. AAMAS 2010: 1323-1330
2000 – 2009
- 2009
- [j21]Ronen I. Brafman, Carmel Domshlak:
Preference Handling - An Introductory Tutorial. AI Mag. 30(1): 58-86 (2009) - [j20]Carmel Domshlak, Vitaly Mirkis:
Set-structured and cost-sharing heuristics for classical planning. Ann. Math. Artif. Intell. 56(2): 211-239 (2009) - [j19]Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
Generic Preferences over Subsets of Structured Objects. J. Artif. Intell. Res. 34: 133-164 (2009) - [j18]Carmel Domshlak, Jörg Hoffmann, Ashish Sabharwal:
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings. J. Artif. Intell. Res. 36: 415-469 (2009) - [c34]Malte Helmert, Carmel Domshlak:
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? ICAPS 2009 - [c33]Michael Katz, Carmel Domshlak:
Structural-Pattern Databases. ICAPS 2009 - [c32]Natali Levi-Soskin, Oren Kurland, Carmel Domshlak:
Navigating in the Dark: Modeling Uncertainty in Ad Hoc Retrieval Using Multiple Relevance Models. ICTIR 2009: 79-91 - [c31]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Planning Games. IJCAI 2009: 73-78 - [c30]Erez Karpas, Carmel Domshlak:
Cost-Optimal Planning with Landmarks. IJCAI 2009: 1728-1733 - [i3]Malte Helmert, Carmel Domshlak:
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? Graph Search Engineering 2009 - [i2]Carmel Domshlak, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. CoRR abs/0905.3766 (2009) - 2008
- [j17]Ronen I. Brafman, Carmel Domshlak:
Graphically structured value-function compilation. Artif. Intell. 172(2-3): 325-349 (2008) - [j16]Michael Katz, Carmel Domshlak:
New Islands of Tractability of Cost-Optimal Planning. J. Artif. Intell. Res. 32: 203-288 (2008) - [j15]Sara Cohen, Carmel Domshlak, Naama Zwerdling:
On ranking techniques for desktop search. ACM Trans. Inf. Syst. 26(2): 11:1-11:24 (2008) - [c29]Ronen I. Brafman, Carmel Domshlak:
From One to Many: Planning for Loosely Coupled Multi-Agent Systems. ICAPS 2008: 28-35 - [c28]Michael Katz, Carmel Domshlak:
Optimal Additive Composition of Abstraction-based Admissible Heuristics. ICAPS 2008: 174-181 - [c27]Michael Katz, Carmel Domshlak:
Structural Patterns Heuristics via Fork Decomposition. ICAPS 2008: 182-189 - [c26]Haggai Roitman, Avigdor Gal, Carmel Domshlak:
Providing Top-K Alternative Schema Matchings with . ER 2008: 538-539 - [c25]Oren Kurland, Carmel Domshlak:
A rank-aggregation approach to searching for optimal query-specific clusters. SIGIR 2008: 547-554 - 2007
- [j14]Carmel Domshlak, Jörg Hoffmann:
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting. J. Artif. Intell. Res. 30: 565-620 (2007) - [j13]Carmel Domshlak, Avigdor Gal, Haggai Roitman:
Rank Aggregation for Automatic Schema Matching. IEEE Trans. Knowl. Data Eng. 19(4): 538-553 (2007) - [j12]Carmel Domshlak, Thorsten Joachims:
Efficient and non-parametric reasoning over user preferences. User Model. User Adapt. Interact. 17(1-2): 41-69 (2007) - [c24]Michael Katz, Carmel Domshlak:
Structural Patterns of Tractable Sequentially-Optimal Planning. ICAPS 2007: 200-207 - [c23]Vitaly Mirkis, Carmel Domshlak:
Cost-Sharing Approximations for h+. ICAPS 2007: 240-247 - [c22]Mattan Winaver, Oren Kurland, Carmel Domshlak:
Towards robust query expansion: model selection in the language modeling framework. SIGIR 2007: 729-730 - [c21]Sara Cohen, Carmel Domshlak, Naama Zwerdling:
On ranking techniques for desktop search. WWW 2007: 1183-1184 - 2006
- [j11]Carmel Domshlak, Steven D. Prestwich, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
Hard and soft constraints for reasoning about qualitative conditional preferences. J. Heuristics 12(4-5): 263-285 (2006) - [j10]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
On Graphical Modeling of Preference and Importance. J. Artif. Intell. Res. 25: 389-424 (2006) - [c20]Ronen I. Brafman, Carmel Domshlak:
Factored Planning: How, When, and When Not. AAAI 2006: 809-814 - [c19]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony, Y. Silver:
Preferences over Sets. AAAI 2006: 1101-1106 - [c18]Carmel Domshlak, Jörg Hoffmann:
Fast Probabilistic Planning through Weighted Model Counting. ICAPS 2006: 243-252 - [c17]Jörg Hoffmann, Ashish Sabharwal, Carmel Domshlak:
Friends or Foes? An AI Planning Perspective on Abstraction and Search. ICAPS 2006: 294-303 - [i1]Oren Kurland, Lillian Lee, Carmel Domshlak:
Better than the real thing? Iterative pseudo-query processing using cluster-based language models. CoRR abs/cs/0601046 (2006) - 2005
- [j9]Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bhaskar Krishnamachari, Bart Selman, Magda Valls:
Sensor networks and distributed CSP: communication, computation and complexity. Artif. Intell. 161(1-2): 117-147 (2005) - [c16]Oren Kurland, Lillian Lee, Carmel Domshlak:
Better than the real thing?: iterative pseudo-query processing using cluster-based language models. SIGIR 2005: 19-26 - [c15]Carmel Domshlak, Thorsten Joachims:
Unstructuring User Preferences: Efficient Non-Parametric Utility Revelation. UAI 2005: 169-177 - 2004
- [j8]Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole:
Preference-Based Constrained Optimization with CP-Nets. Comput. Intell. 20(2): 137-157 (2004) - [j7]Carmel Domshlak, Solomon Eyal Shimony:
Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence. Int. J. Intell. Syst. 19(8): 703-725 (2004) - [j6]Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole:
CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. J. Artif. Intell. Res. 21: 135-191 (2004) - [j5]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
Qualitative decision making in adaptive presentation of structured information. ACM Trans. Inf. Syst. 22(4): 503-539 (2004) - [c14]James H. Lawton, Carmel Domshlak:
On the Role of Knowledge in Multi-Agent Opportunism. AAMAS 2004: 1270-1271 - [c13]James H. Lawton, Carmel Domshlak:
Multi-Agent Opportunistic Planning and Plan Execution. ICTAI 2004: 408-415 - [c12]Ronen I. Brafman, Carmel Domshlak, Tanya Kogan:
Compact Value-Function Representations for Qualitative Preferences. UAI 2004: 51-59 - 2003
- [j4]Solomon Eyal Shimony, Carmel Domshlak:
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks. Artif. Intell. 151(1-2): 213-225 (2003) - [j3]Rachel Ben-Eliyahu-Zohary, Carmel Domshlak, Ehud Gudes, N. Liusternik, Amnon Meisels, Tzachi Rosen, Solomon Eyal Shimony:
FlexiMine - A Flexible Platform for KDD Research and Application Development. Ann. Math. Artif. Intell. 39(1-2): 175-204 (2003) - [j2]Ronen I. Brafman, Carmel Domshlak:
Structure and Complexity in Planning with Unary Operators. J. Artif. Intell. Res. 18: 315-349 (2003) - [c11]Carmel Domshlak, Solomon Eyal Shimony:
Efficient Probabilistic Reasoning in Bayes Nets with Mutual Exclusion and Context Specific Independence. FLAIRS 2003: 496-500 - [c10]Carmel Domshlak, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. IJCAI 2003: 215-220 - [c9]Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls:
Grid-based SensorDCSP. IJCAI 2003: 1359-1361 - 2002
- [j1]Carmel Domshlak:
On Recursively Directed Hypercubes. Electron. J. Comb. 9(1) (2002) - [c8]Carmel Domshlak, Ronen I. Brafman:
Structure and Complexity in Planning with Unary Operators. AIPS 2002: 34-43 - [c7]Ehud Gudes, Carmel Domshlak, Natalia Orlov:
Remote Conferencing with Multimedia Objects. EDBT Workshops 2002: 526-543 - [c6]Carmel Domshlak, Ronen I. Brafman:
CP-nets: Reasoning and Consistency Testing. KR 2002: 121-132 - [c5]Ronen I. Brafman, Carmel Domshlak:
Introducing Variable Importance Tradeoffs into CP-Nets. UAI 2002: 69-76 - 2001
- [c4]Carmel Domshlak, Ronen I. Brafman, Solomon Eyal Shimony:
Preference-Based Configuration of Web Page Content. IJCAI 2001: 1451-1456 - 2000
- [c3]Carmel Domshlak, Ronen I. Brafman:
Strucutre and Complexity in Planning with Unary Operators. PuK 2000
1990 – 1999
- 1998
- [c2]Carmel Domshlak, D. Gershkovich, Ehud Gudes, N. Liusternik, Amnon Meisels, Tzachi Rosen, Solomon Eyal Shimony:
FlexiMine - A Flexible Platform for KDD Research and Application Construction. KDD 1998: 184-188 - 1997
- [c1]Solomon Eyal Shimony, Carmel Domshlak, Eugene Santos Jr.:
Cost-Sharing in Bayesian Knowledge Bases. UAI 1997: 421-428
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-06-14 19:05 CEST 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:
