default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonen I. Brafman
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Ronen I. Brafman
, Giuseppe De Giacomo:
Regular decision processes. Artif. Intell. 331: 104113 (2024)- [j38]Or Wertheim, Dan R. Suissa, Ronen I. Brafman:
Plug'n Play Task-Level Autonomy for Robotics Using POMDPs and Probabilistic Programs. IEEE Robotics Autom. Lett. 9(1): 587-594 (2024) - [i27]Elias Goldsztejn, Ronen I. Brafman:
Bridging the Gap: Regularized Reinforcement Learning for Improved Classical Motion Planning with Safety Modules. CoRR abs/2403.18524 (2024) - 2023
- [j37]Lera Shtutland, Dorin Shmaryahu, Ronen I. Brafman, Guy Shani:
Unavoidable deadends in deterministic partially observable contingent planning. Auton. Agents Multi Agent Syst. 37(1): 3 (2023) - [c103]Ronen I. Brafman, David Tolpin, Or Wertheim:
Probabilistic Programs as an Action Description Language. AAAI 2023: 15351-15358 - [c102]Tal Shahar, Ronen I. Brafman:
Reinforcement Learning in RDPs by Combining Deep RL with Automata Learning. ECAI 2023: 2097-2104 - [c101]Elias Goldsztejn, Tal Feiner, Ronen I. Brafman:
PTDRL: Parameter Tuning Using Deep Reinforcement Learning. IROS 2023: 11356-11362 - [i26]Elias Goldsztejn, Tal Feiner, Ronen I. Brafman:
PTDRL: Parameter Tuning using Deep Reinforcement Learning. CoRR abs/2306.10833 (2023) - 2022
- [c100]Eliran Abdoo, Ronen I. Brafman, Guy Shani, Nitsan Soffair:
Team-Imitate-Synchronize for Solving Dec-POMDPs. ECML/PKDD (4) 2022: 216-232 - [c99]Or Wertheim, Dan R. Suissa, Ronen I. Brafman:
Towards Plug'n Play Task-Level Autonomy for Robotics Using POMDPs and Generative Models. AREA@IJCAI-ECAI 2022: 98-111 - 2021
- [c98]Shashank Shekhar, Ronen I. Brafman, Guy Shani:
Improved Knowledge Modeling and Its Use for Signaling in Multi-Agent Planning with Partial Observability. AAAI 2021: 11954-11961 - [c97]Alexander Kovalchuk, Shashank Shekhar, Ronen I. Brafman:
Verifying Plans and Scripts for Robotics Tasks Using Performance Level Profiles. ICAPS 2021: 673-681 - 2020
- [j36]Shashank Shekhar, Ronen I. Brafman:
Representing and planning with interacting actions and privacy. Artif. Intell. 278 (2020) - [c96]Maor Gaon, Ronen I. Brafman:
Reinforcement Learning with Non-Markovian Rewards. AAAI 2020: 3980-3987 - [c95]Eden Abadi, Ronen I. Brafman:
Learning and Solving Regular Decision Processes. IJCAI 2020: 1948-1954 - [i25]Eden Abadi, Ronen I. Brafman:
Learning and Solving Regular Decision Processes. CoRR abs/2003.01008 (2020)
2010 – 2019
- 2019
- [c94]Shashank Shekhar, Ronen I. Brafman, Guy Shani:
A Factored Approach to Deterministic Contingent Multi-Agent Planning. ICAPS 2019: 419-427 - [c93]Ronen I. Brafman, Giuseppe De Giacomo:
Regular Decision Processes: Modelling Dynamic Systems without Using Hidden Variables. AAMAS 2019: 1844-1846 - [c92]Ronen I. Brafman, Giuseppe De Giacomo:
Planning for LTLf /LDLf Goals in Non-Markovian Fully Observable Nondeterministic Domains. IJCAI 2019: 1602-1608 - [c91]Ronen I. Brafman, Giuseppe De Giacomo:
Regular Decision Processes: A Model for Non-Markovian Domains. IJCAI 2019: 5516-5522 - [i24]Maor Gaon, Ronen I. Brafman:
Reinforcement Learning with Non-Markovian Rewards. CoRR abs/1912.02552 (2019) - 2018
- [j35]Shlomi Maliah, Guy Shani, Ronen I. Brafman:
Landmark-based heuristic online contingent planning. Auton. Agents Multi Agent Syst. 32(5): 602-634 (2018) - [c90]Ronen I. Brafman, Giuseppe De Giacomo, Fabio Patrizi:
LTLf/LDLf Non-Markovian Rewards. AAAI 2018: 1771-1778 - [c89]Shashank Shekhar, Ronen I. Brafman:
Representing and Planning with Interacting Actions and Privacy. ICAPS 2018: 232-240 - [c88]Alexandre Cukier, Ronen I. Brafman, Yotam Perkal, David Tolpin:
A Planning Approach to Monitoring Computer Programs' Behavior. CSCML 2018: 243-254 - [i23]Amos Beimel, Ronen I. Brafman:
Privacy Preserving Multi-Agent Planning with Provable Guarantees. CoRR abs/1810.13354 (2018) - 2017
- [j34]Daniel Berend, Ronen I. Brafman, Solomon Eyal Shimony, Shira Zucker, Shimon Cohen:
Optimal ordering of statistically dependent tests. Discret. Appl. Math. 226: 17-31 (2017) - [c87]Ronen I. Brafman, Giuseppe De Giacomo, Massimo Mecella, Sebastian Sardiña:
Service Composition in Stochastic Settings. AI*IA 2017: 159-171 - [c86]Shlomi Maliah, Ronen I. Brafman, Guy Shani:
Increased Privacy with Reduced Communication in Multi-Agent Planning. ICAPS 2017: 209-217 - [i22]Ronen I. Brafman, Giuseppe De Giacomo, Fabio Patrizi:
Specifying Non-Markovian Rewards in MDPs Using LDL on Finite Traces (Preliminary Version). CoRR abs/1706.08100 (2017) - [i21]Alexandre Cukier, Ronen I. Brafman, Yotam Perkal, David Tolpin:
A Planning Approach to Monitoring Behavior of Computer Programs. CoRR abs/1709.03363 (2017) - 2016
- [j33]Ronen I. Brafman, Guy Shani:
Online belief tracking using regression for contingent planning. Artif. Intell. 241: 131-152 (2016) - [c85]Shlomi Maliah, Guy Shani, Ronen I. Brafman:
Online Macro Generation for Privacy Preserving Planning. ICAPS 2016: 216-220 - [c84]Ronen I. Brafman, Michael Bar-Sinai, Maor Ashkenazi:
Performance level profiles: A formal language for describing the expected performance of functional modules. IROS 2016: 1751-1756 - 2015
- [c83]Ran Taig, Ronen I. Brafman:
A Compilation Based Approach to Conformant Probabilistic Planning with Stochastic Actions. ICAPS 2015: 220-224 - [c82]Ronen I. Brafman:
A Privacy Preserving Algorithm for Multi-Agent Planning and Search. IJCAI 2015: 1530-1536 - [e4]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
- [j32]Daniel Berend, Ronen I. Brafman, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker:
Optimal ordering of independent tests with precedence constraints. Discret. Appl. Math. 162: 115-127 (2014) - [j31]Raz Nissim, Ronen I. Brafman:
Distributed Heuristic Forward Search for Multi-agent Planning. J. Artif. Intell. Res. 51: 293-332 (2014) - [c81]Ran Taig, Ronen I. Brafman:
A Relevance-Based Compilation Method for Conformant Probabilistic Planning. AAAI 2014: 2374-2380 - [c80]Shlomi Maliah, Ronen I. Brafman, Erez Karpas, Guy Shani:
Partially Observable Online Contingent Planning Using Landmark Heuristics. ICAPS 2014 - [c79]Ronen I. Brafman, Guy Shani:
On The Properties of Belief Tracking for Online Contingent Planning using Regression. ECAI 2014: 147-152 - [i20]Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman, Eric A. Hansen, Mausam:
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains. CoRR abs/1401.3428 (2014) - [i19]Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
Generic Preferences over Subsets of Structured Objects. CoRR abs/1401.3459 (2014) - [i18]Ronen I. Brafman, Guy Shani:
Replanning in Domains with Partial Information and Sensing Actions. CoRR abs/1401.6048 (2014) - 2013
- [j30]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) - [c78]Ronen I. Brafman, Guy Shani, Shlomo Zilberstein:
Qualitative Planning under Partial Observability in Multi-Agent Domains. AAAI 2013: 130-137 - [c77]Raz Nissim, Ronen I. Brafman:
Cost-Optimal Planning by Self-Interested Agents. AAAI 2013: 732-738 - [c76]Ran Taig, Ronen I. Brafman:
Compiling Conformant Probabilistic Planning Problems into Classical Planning. ICAPS 2013 - [c75]Amihai Savir, Ronen I. Brafman, Guy Shani:
Recommending improved configurations for complex objects with an application in travel planning. RecSys 2013: 391-394 - [i17]Ronen I. Brafman, Carmel Domshlak:
Introducing Variable Importance Tradeoffs into CP-Nets. CoRR abs/1301.0558 (2013) - [i16]Guy Shani, Ronen I. Brafman, David Heckerman:
An MDP-based Recommender System. CoRR abs/1301.0600 (2013) - [i15]Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman:
UCP-Networks: A Directed Graphical Representation of Conditional Utilities. CoRR abs/1301.2259 (2013) - [i14]Craig Boutilier, Ronen I. Brafman, Holger H. Hoos, David Poole:
Reasoning With Conditional Ceteris Paribus Preference Statem. CoRR abs/1301.6681 (2013) - [i13]Craig Boutilier, Ronen I. Brafman, Christopher W. Geib:
Structured Reachability Analysis for Markov Decision Processes. CoRR abs/1301.7361 (2013) - [i12]Raz Nissim, Ronen I. Brafman:
Distributed Heuristic Forward Search for Multi-Agent Systems. CoRR abs/1306.5858 (2013) - 2012
- [j29]Ronen I. Brafman, Guy Shani:
Replanning in Domains with Partial Information and Sensing Actions. J. Artif. Intell. Res. 45: 565-600 (2012) - [c74]Udi Apsel, Ronen I. Brafman:
Lifted MEU by Weighted Model Counting. AAAI 2012: 1861-1867 - [c73]Ronen I. Brafman, Guy Shani:
A Multi-Path Compilation Approach to Contingent Planning. AAAI 2012: 1868-1874 - [c72]Raz Nissim, Ronen I. Brafman:
Multi-agent A* for parallel and distributed systems. AAMAS 2012: 1265-1266 - [c71]Avitan Gefen, Ronen I. Brafman:
Pruning Methods for Optimal Delete-Free Planning. ICAPS 2012 - [c70]Raz Nissim, Udi Apsel, Ronen I. Brafman:
Tunneling and Decomposition-Based State Reduction for Optimal Planning. ECAI 2012: 624-629 - [c69]Udi Apsel, Ronen I. Brafman:
Exploiting Uniform Assignments in First-Order MPE. UAI 2012: 74-83 - [i11]Udi Apsel, Ronen I. Brafman:
Extended Lifted Inference with Joint Formulas. CoRR abs/1202.3698 (2012) - [i10]Ronen I. Brafman, Carmel Domshlak, Tanya Kogan:
Compact Value-Function Representations for Qualitative Preferences. CoRR abs/1207.4126 (2012) - [i9]Udi Apsel, Ronen I. Brafman:
Exploiting Uniform Assignments in First-Order MPE. CoRR abs/1210.4845 (2012) - 2011
- [j28]Ronen I. Brafman:
Relational preference rules for control. Artif. Intell. 175(7-8): 1180-1193 (2011) - [c68]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Zohar Feldman:
Planning for Operational Control Systems with Predictable Exogenous Events. AAAI 2011: 940-945 - [c67]Ronen I. Brafman, Enrico Pilotto, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh:
The Next Best Solution. AAAI 2011: 1537-1540 - [c66]Avitan Gefen, Ronen I. Brafman:
The Minimal Seed Set Problem. ICAPS 2011 - [c65]Ronen I. Brafman, Ran Taig:
A Translation Based Approach to Probabilistic Conformant Planning. ADT 2011: 16-27 - [c64]Guy Shani, Ronen I. Brafman:
Replanning in Domains with Partial Information and Sensing Actions. IJCAI 2011: 2021-2026 - [c63]Udi Apsel, Ronen I. Brafman:
Extended Lifted Inference with Joint Formulas. UAI 2011: 11-18 - [e3]Ronen I. Brafman, Fred S. Roberts, Alexis Tsoukiàs:
Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings. Lecture Notes in Computer Science 6992, Springer 2011, ISBN 978-3-642-24872-6 [contents] - [i8]Craig Boutilier, Ronen I. Brafman:
Partial-Order Planning with Concurrent Interacting Actions. CoRR abs/1106.0249 (2011) - [i7]Ronen I. Brafman, Carmel Domshlak:
Structure and Complexity in Planning with Unary Operators. CoRR abs/1106.5256 (2011) - [i6]Ronen I. Brafman, Moshe Tennenholtz:
Learning to Coordinate Efficiently: A Model-based Approach. CoRR abs/1106.5258 (2011) - [i5]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) - [i4]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
On Graphical Modeling of Preference and Importance. CoRR abs/1109.6345 (2011) - 2010
- [c62]Ronen I. Brafman, Yagil Engel:
Decomposed Utility Functions and Graphical Models for Reasoning about Preferences. AAAI 2010: 267-272 - [c61]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Transferable Utility Planning Games. AAAI 2010: 709-714 - [c60]Raz Nissim, Ronen I. Brafman, Carmel Domshlak:
A general, fully distributed multi-agent planning algorithm. AAMAS 2010: 1323-1330 - [c59]Brian Lee, Savil Srivastava, Ranjitha Kumar, Ronen I. Brafman, Scott R. Klemmer:
Designing with interactive example galleries. CHI 2010: 2257-2266 - [c58]Ronen I. Brafman, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh:
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms. KR 2010 - [e2]Ronen I. Brafman, Hector Geffner, Jörg Hoffmann, Henry A. Kautz:
Proceedings of the 20th International Conference on Automated Planning and Scheduling, ICAPS 2010, Toronto, Ontario, Canada, May 12-16, 2010. AAAI 2010 [contents]
2000 – 2009
- 2009
- [j27]Ronen I. Brafman, Carmel Domshlak:
Preference Handling - An Introductory Tutorial. AI Mag. 30(1): 58-86 (2009) - [j26]Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman, Eric A. Hansen, Mausam:
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains. J. Artif. Intell. Res. 34: 27-59 (2009) - [j25]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) - [c57]Ronen I. Brafman, Yagil Engel:
Directional Decomposition of Multiattribute Utility Functions. ADT 2009: 192-202 - [c56]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz:
Planning Games. IJCAI 2009: 73-78 - 2008
- [j24]Ronen I. Brafman, Carmel Domshlak:
Graphically structured value-function compilation. Artif. Intell. 172(2-3): 325-349 (2008) - [j23]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony:
Prioritizing Point-Based POMDP Solvers. IEEE Trans. Syst. Man Cybern. Part B 38(6): 1592-1605 (2008) - [c55]Ronen I. Brafman, Carmel Domshlak:
From One to Many: Planning for Loosely Coupled Multi-Agent Systems. ICAPS 2008: 28-35 - [c54]Guy Shani, Pascal Poupart, Ronen I. Brafman, Solomon Eyal Shimony:
Efficient ADD Operations for Point-Based Algorithms. ICAPS 2008: 330-337 - [c53]Ronen I. Brafman:
Preferences, Planning and Control. KR 2008: 2-5 - [c52]Ronen I. Brafman:
Relational Preference Rules for Control. KR 2008: 552-559 - 2007
- [c51]Samuel Ieong, Nicolas S. Lambert, Yoav Shoham, Ronen I. Brafman:
Near-Optimal Search in Continuous Domains. AAAI 2007: 1158-1163 - [c50]Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shimony, Ajay Mani, Craig Boutilier:
Computing Optimal Subsets. AAAI 2007: 1231-1236 - [c49]Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen I. Brafman:
Scaling Up: Solving POMDPs through Value Based Clustering. AAAI 2007: 1290-1295 - [c48]Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen I. Brafman:
Scaling Up: Solving POMDPs through Value Based Clustering. AAAI 2007: 1910-1911 - [c47]Christian Schröpfer, Maxim Binshtok, Solomon Eyal Shimony, Aviram Dayan, Ronen I. Brafman, Philipp Offermann, Oliver Holschke:
Introducing Preferences over NFPs into Service Selection in SOA. ICSOC Workshops 2007: 68-79 - [c46]Nicolas Meuleau, Ronen I. Brafman:
Hierarchical Heuristic Forward Search in Stochastic Domains. IJCAI 2007: 2542-2549 - [c45]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony:
Forward Search Value Iteration for POMDPs. IJCAI 2007: 2619-2624 - 2006
- [j22]Jörg Hoffmann, Ronen I. Brafman:
Conformant planning via heuristic forward search: A new approach. Artif. Intell. 170(6-7): 507-541 (2006) - [j21]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony:
On Graphical Modeling of Preference and Importance. J. Artif. Intell. Res. 25: 389-424 (2006) - [c44]Ronen I. Brafman, Carmel Domshlak:
Factored Planning: How, When, and When Not. AAAI 2006: 809-814 - [c43]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony, Y. Silver:
Preferences over Sets. AAAI 2006: 1101-1106 - [c42]Jeremy Frank, James Crawford, Lina Khatib, Ronen I. Brafman:
Tractable Optimal Competitive Scheduling. ICAPS 2006: 73-82 - [c41]Nicolas Meuleau, Ronen I. Brafman, Emmanuel Benazera:
Stochastic Over-Subscription Planning Using Hierarchies of MDPs. ICAPS 2006: 121-130 - [c40]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony:
Prioritizing Point-Based POMDP Solvers. ECML 2006: 389-400 - [e1]Gianni Bosi, Ronen I. Brafman, Jan Chomicki, Werner Kießling:
Preferences: Specification, Inference, Applications, 27. June - 2. July 2004. Dagstuhl Seminar Proceedings 04271, IBFI, Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [j20]Guy Shani, David Heckerman, Ronen I. Brafman:
An MDP-Based Recommender System. J. Mach. Learn. Res. 6: 1265-1295 (2005) - [c39]Ronen I. Brafman, Moshe Tennenholtz:
Optimal Efficient Learning Equilibrium: Imperfect Monitoring in Symmetric Games. AAAI 2005: 726-731 - [c38]Jörg Hoffmann, Ronen I. Brafman:
Contingent Planning via Heuristic Forward Search witn Implicit Belief States. ICAPS 2005: 71-80 - [c37]Ronen I. Brafman, Yuri Chernyavsky:
Planning with Goal Preferences and Constraints. ICAPS 2005: 182-191 - [c36]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony:
Model-Based Online Learning of POMDPs. ECML 2005: 353-364 - [c35]Mausam, Emmanuel Benazera, Ronen I. Brafman, Nicolas Meuleau, Eric A. Hansen:
Planning with Continuous Resources in Stochastic Domains. IJCAI 2005: 1244-1251 - 2004
- [j19]Ronen I. Brafman, Moshe Tennenholtz:
Efficient learning equilibrium. Artif. Intell. 159(1-2): 27-47 (2004) - [j18]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) - [j17]Ronen I. Brafman, Yannis Dimopoulos:
Extended Semantics and Optimization Algorithms for CP-Networks. Comput. Intell. 20(2): 218-245 (2004) - [j16]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) - [j15]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) - [j14]Ronen I. Brafman:
A simplifier for propositional formulas with many binary clauses. IEEE Trans. Syst. Man Cybern. Part B 34(1): 52-59 (2004) - [c34]Ronen I. Brafman, Jörg Hoffmann:
Conformant Planning via Heuristic Forward Search: A New Approach. ICAPS 2004: 355-364 - [c33]Avi Bab, Ronen I. Brafman:
An Experimental Study of Different Approaches to Reinforcement Learning in Common Interest Stochastic Games. ECML 2004: 75-86 - [c32]Guy Shani, Ronen I. Brafman:
Resolving Perceptual Aliasing In The Presence Of Noisy Sensors. NIPS 2004: 1249-1256 - [c31]Ronen I. Brafman, Carmel Domshlak, Tanya Kogan:
Compact Value-Function Representations for Qualitative Preferences. UAI 2004: 51-59 - [i3]Gianni Bosi, Ronen I. Brafman, Jan Chomicki, Werner Kießling:
04271 Abstracts Collection - Preferences: Specification, Inference, Applications. Preferences 2004 - [i2]Ronen I. Brafman, Doron A. Friedman:
Adaptive Rich Media Presentations via Preference-Based Constrained Optimization. Preferences 2004 - 2003
- [j13]Ronen I. Brafman, Carmel Domshlak:
Structure and Complexity in Planning with Unary Operators. J. Artif. Intell. Res. 18: 315-349 (2003) - [j12]Ronen I. Brafman, Moshe Tennenholtz:
Learning to Coordinate Efficiently: A Model-based Approach. J. Artif. Intell. Res. 19: 11-23 (2003) - [c30]Ronen I. Brafman, David Heckerman, Guy Shani:
Recommendation as a Stochastic Sequential Decision Problem. ICAPS 2003: 164-173 - [c29]Ronen I. Brafman, Yannis Dimopoulos:
A New Look at the Semantics and Optimization Methods of CP-Networks. IJCAI 2003: 1033-1038 - 2002
- [j11]Ronen I. Brafman, Moshe Tennenholtz:
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. J. Mach. Learn. Res. 3: 213-231 (2002) - [c28]Carmel Domshlak, Ronen I. Brafman:
Structure and Complexity in Planning with Unary Operators. AIPS 2002: 34-43 - [c27]Carmel Domshlak, Ronen I. Brafman:
CP-nets: Reasoning and Consistency Testing. KR 2002: 121-132 - [c26]Ronen I. Brafman, Moshe Tennenholtz:
Efficient Learning Equilibrium. NIPS 2002: 1603-1610 - [c25]Ronen I. Brafman, Carmel Domshlak:
Introducing Variable Importance Tradeoffs into CP-Nets. UAI 2002: 69-76 - [c24]Guy Shani, Ronen I. Brafman, David Heckerman:
An MDP-based Recommender System. UAI 2002: 453-460 - 2001
- [j10]Ronen I. Brafman, Nir Friedman:
On decision-theoretic foundations for defaults. Artif. Intell. 133(1-2): 1-33 (2001) - [j9]Ronen I. Brafman:
On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach. J. Artif. Intell. Res. 14: 1-28 (2001) - [j8]Craig Boutilier, Ronen I. Brafman:
Partial-Order Planning with Concurrent Interacting Actions. J. Artif. Intell. Res. 14: 105-136 (2001) - [c23]Ronen I. Brafman:
A Simplifier for Propositional Formulas with Many Binary Clauses. IJCAI 2001: 515-522 - [c22]Ronen I. Brafman, Moshe Tennenholtz:
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. IJCAI 2001: 953-958 - [c21]Carmel Domshlak, Ronen I. Brafman, Solomon Eyal Shimony:
Preference-Based Configuration of Web Page Content. IJCAI 2001: 1451-1456 - [c20]Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman:
UCP-Networks: A Directed Graphical Representation of Conditional Utilities. UAI 2001: 56-64 - 2000
- [j7]Ronen I. Brafman, Moshe Tennenholtz:
A near-optimal polynomial time algorithm for learning in certain classes of stochastic games. Artif. Intell. 121(1-2): 31-47 (2000) - [j6]Ronen I. Brafman, Moshe Tennenholtz:
An axiomatic treatment of three qualitative decision criteria. J. ACM 47(3): 452-482 (2000) - [c19]Carmel Domshlak, Ronen I. Brafman:
Strucutre and Complexity in Planning with Unary Operators. PuK 2000
1990 – 1999
- 1999
- [c18]Ronen I. Brafman, Moshe Tennenholtz:
A Near-Optimal Poly-Time Algorithm for Learning a class of Stochastic Games. IJCAI 1999: 734-739 - [c17]Ronen I. Brafman:
Reachability, Relevance, Resolution and the Planning as Satisfiability Approach. IJCAI 1999: 976-981 - [c16]Ronen I. Brafman, Holger H. Hoos:
To Encode or Not to Encode - Linear Planning. IJCAI 1999: 988-995 - [c15]Craig Boutilier, Ronen I. Brafman, Holger H. Hoos, David Poole:
Reasoning With Conditional Ceteris Paribus Preference Statements. UAI 1999: 71-80 - 1998
- [j5]Ronen I. Brafman, Joseph Y. Halpern, Yoav Shoham:
On the Knowledge Requirements of Tasks. Artif. Intell. 98(1-2): 317-349 (1998) - [c14]Craig Boutilier, Ronen I. Brafman, Christopher W. Geib:
Structured Reachability Analysis for Markov Decision Processes. UAI 1998: 24-32 - 1997
- [j4]Ronen I. Brafman, Moshe Tennenholtz:
Modeling Agents as Qualitative Decision Makers. Artif. Intell. 94(1-2): 217-268 (1997) - [j3]Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, Yoav Shoham:
Applications of a logic of knowledge to motion planning under uncertainty. J. ACM 44(5): 633-668 (1997) - [j2]Ronen I. Brafman:
A First-Order Conditional Logic with Qualitative Statistical Semantics. J. Log. Comput. 7(6): 777-803 (1997) - [c13]Ronen I. Brafman, Moshe Tennenholtz:
On the Axiomatization of Qualitative Decision Criteria. AAAI/IAAI 1997: 76-81 - [c12]Craig Boutilier, Ronen I. Brafman:
Planning with Concurrent Interacting Actions. AAAI/IAAI 1997: 720-726 - [c11]Ronen I. Brafman:
A Heuristic Variable Grid Solution Method for POMDPs. AAAI/IAAI 1997: 727-733 - [c10]Craig Boutilier, Ronen I. Brafman, Christopher W. Geib:
Prioritized Goal Decomposition of Markov Decision Processes: Toward a Synthesis of Classical and Decision Theoretic Planning. IJCAI 1997: 1156-1162 - 1996
- [b1]Ronen I. Brafman:
Qualitative models of information and decision making: foundations and applications. Stanford University, USA, 1996 - [j1]Ronen I. Brafman, Moshe Tennenholtz:
On Partially Controlled Multi-Agent Systems. J. Artif. Intell. Res. 4: 477-507 (1996) - [c9]Ronen I. Brafman, Moshe Tennenholtz:
On the Foundations of Qualitative Decision Theory. AAAI/IAAI, Vol. 2 1996: 1291-1296 - [c8]Ronen I. Brafman:
"Statistical" First Order Conditionals. KR 1996: 398-409 - [i1]Ronen I. Brafman, Moshe Tennenholtz:
On Partially Controlled Multi-Agent Systems. CoRR cs.AI/9606102 (1996) - 1995
- [c7]Ronen I. Brafman, Yoav Shoham:
Knowledge Considerations in Robotics and Distribution of Robotic Tasks. IJCAI 1995: 96-102 - [c6]Ronen I. Brafman, Nir Friedman:
On Decision-Theoretic Foundations for Defaults. IJCAI 1995: 1458-1465 - [c5]Ronen I. Brafman, Moshe Tennenholtz:
Towards Action Prediction Using a Mental-Level Model. IJCAI 1995: 2010-2016 - [c4]Ronen I. Brafman, Yoav Shoham:
Knowledge Considerations in Robotics. Reasoning with Uncertainty in Robotics 1995: 248-262 - 1994
- [c3]Ronen I. Brafman, Moshe Tennenholtz:
Belief Ascription and Mental-Level Modelling. KR 1994: 87-98 - [c2]Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, Yoav Shoham:
Knowledge as a Tool in Motion Planning and Uncertainty. TARK 1994: 208-224 - 1993
- [c1]Ronen I. Brafman, Jean-Claude Latombe, Yoav Shoham:
Towards Knowledge-Level Analysis of Motion Planning. AAAI 1993: 670-675
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-09-13 00:39 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:
