I no longer maintain this page. Please google “dblp Brafman” for an up to date list of publications.
If you cannot download a copy of a publication you are interested in, please contact me (Brafman@cs.bgu.ac.il)
2010 |
|
|||||
bib |
|
link |
|
|||
|
Raz Nissim, Ronen I.
Brafman, Carmel
Domshlak:A General, Fully Distributed
Multi-Agent Planning Algorithm. AAMAS 2010: |
|
||||
2009 |
|
|||||
|
Ronen I. Brafman, Yagil
Engel: Directional Decomposition of Multiattribute Utility Functions. ADT
2009: 192-202 |
|
||||
|
Ronen I. Brafman, Carmel
Domshlak, Yagil
Engel, Moshe Tennenholtz: Planning Games. IJCAI
2009: 73-78 |
|
||||
|
Maxim
Binshtok, Ronen I. Brafman, Carmel
Domshlak, Solomon Eyal Shimony: Generic Preferences over Subsets
of Structured Objects. J.
Artif. Intell. Res. (JAIR) 34: 133-164 (2009) |
|
||||
|
Nicolas
Meuleau, Emmanuel
Benazera, Ronen I. Brafman, Eric
A. Hansen, Mausam: A Heuristic Search Approachto Planning with
Continuous Resources in Stochastic Domains. J.
Artif. Intell. Res. (JAIR) 34: 27-59 (2009) |
|
||||
|
Ronen I. Brafman, Carmel Domshlak: Preference Handling -- An
Introductory Tutorial. AI Magazine 30(1): 58-86 (2009) |
|
||||
2008 |
|
|||||
Ronen I. Brafman, Carmel
Domshlak: From One to Many: Planning for Loosely Coupled Multi-Agent Systems.
ICAPS
2008: 28-35_ ICAPS Distinguished Paper
Award |
|
|||||
Guy
Shani, Pascal
Poupart, Ronen I. Brafman, Solomon Eyal Shimony: Efficient ADD Operations for
Point-Based Algorithms. ICAPS
2008: 330-337 |
|
|||||
Ronen I. Brafman: Relational Preference Rules for Control. KR
2008: 552-559 |
|
|||||
Ronen I. Brafman, Carmel
Domshlak: Graphically structured value-function compilation. Artif.
Intell. 172(2-3): 325-349 (2008) |
|
|||||
Guy
Shani, Ronen I. Brafman, Solomon Eyal Shimony: Prioritizing Point-Based POMDP
Solvers. IEEE
Transactions on Systems, Man, and Cybernetics, Part B 38(6): 1592-1605
(2008) |
|
|||||
2007 |
|
|
|
|||
|
_ |
Samuel
Ieong, Nicholas
Lambert, Yoav
Shoham, Ronen I. Brafman: Near-Optimal Search in
Continuous Domains. AAAI
2007: 1158-1163 |
|
|||
|
_ |
Maxim
Binshtok, Ronen I. Brafman, Solomon
Eyal Shimony, Ajay
Mani, Craig Boutilier: Computing Optimal Subsets. AAAI
2007: 1231-1236 |
|
|||
|
_ |
Yan
Virin, Guy
Shani, Solomon
Eyal Shimony, Ronen I. Brafman: Scaling Up: Solving POMDPs through Value
Based Clustering. AAAI
2007: 1290-1295 |
|
|||
_ |
Nicolas
Meuleau, Ronen I. Brafman: Hierarchical Heuristic Forward Search in
Stochastic Domains. IJCAI
2007: 2542-2549 |
|
||||
_ |
Guy
Shani, Ronen I. Brafman, Solomon Eyal Shimony: Forward Search Value Iteration
for POMDPs. IJCAI
2007: 2619-2624 |
|
||||
2006 |
|
|||||
|
|
Gianni
Bosi, Ronen I. Brafman, Jan
Chomicki, Werner
Kießling: Preferences: Specification, Inference, Applications, 27. June -
2. July 2004 IBFI,
Schloss Dagstuhl, Germany 2006 |
|
|||
|
_ |
Ronen I. Brafman, Carmel
Domshlak: Factored Planning: How, When, and When Not. AAAI
2006 |
|
|||
|
_ |
Ronen I. Brafman, Carmel
Domshlak, Solomon
Eyal Shimony, Y. Silver: Preferences over Sets. AAAI
2006 |
|
|||
|
Guy
Shani, Ronen I. Brafman, Solomon Eyal Shimony: Prioritizing Point-Based POMDP
Solvers. ECML
2006: 389-400 |
|
||||
|
_ |
Nicolas
Meuleau, Ronen I. Brafman, Emmanuel
Benazera: Stochastic Over-Subscription Planning Using Hierarchies of
MDPs. ICAPS
2006: 121-130 |
|
|||
|
|
Jeremy
Frank, James
Crawford, Lina
Khatib, Ronen I. Brafman: Tractable Optimal
Competitive Scheduling. ICAPS
2006: 73-82 |
|
|||
|
Jörg
Hoffmann, Ronen I. Brafman: Conformant planning via heuristic forward
search: A new approach. Artif.
Intell. 170(6-7): 507-541 (2006) |
|
||||
_ |
Ronen I. Brafman, Carmel
Domshlak, Solomon Eyal Shimony: On Graphical Modeling of
Preference and Importance. J.
Artif. Intell. Res. (JAIR) 25: 389-424 (2006) |
|
||||
2005 |
|
|||||
|
|
Ronen I. Brafman, Moshe
Tennenholtz: Optimal Efficient Learning Equilibrium: Imperfect Monitoring
in Symmetric Games. AAAI
2005: 726-731 |
|
|||
|
Guy
Shani, Ronen I. Brafman, Solomon Eyal Shimony: Model-Based Online Learning of
POMDPs. ECML
2005: 353-364 |
|
||||
|
_ |
Ronen I. Brafman, Yuri
Chernyavsky: Planning with Goal Preferences and Constraints. ICAPS
2005: 182-191 |
|
|||
|
_ |
Jörg
Hoffmann, Ronen I. Brafman: Contingent Planning via Heuristic Forward
Search witn Implicit Belief States. ICAPS
2005: 71-80 |
|
|||
_ |
Mausam,
Emmanuel
Benazera, Ronen I. Brafman, Nicolas
Meuleau, Eric A. Hansen: Planning with Continuous Resources in
Stochastic Domains. IJCAI
2005: 1244-1251 |
|
||||
_ |
Guy
Shani, David
Heckerman, Ronen I. Brafman: An MDP-Based
Recommender System. Journal
of Machine Learning Research 6: 1265-1295 (2005) |
|
||||
2004 |
|
|||||
_ |
Avi
Bab, Ronen I. Brafman: An Experimental Study of Different Approaches to
Reinforcement Learning in Common Interest Stochastic Games. ECML
2004: 75-86 |
|
||||
|
|
Ronen I. Brafman, Jörg
Hoffmann: Conformant Planning via Heuristic Forward Search: A New
Approach. ICAPS
2004: 355-364 _ICAPS Distinguished
Paper Award |
|
|||
_ |
Guy
Shani, Ronen I. Brafman: Resolving Perceptual Aliasing In The Presence Of
Noisy Sensors. NIPS
2004 |
|
||||
_ |
Ronen I. Brafman, Doron
A. Friedman: Adaptive Rich Media Presentations via Preference-Based
Constrained Optimization. Preferences
2004 |
|
||||
_ |
Ronen I. Brafman, Carmel
Domshlak, Tanya Kogan: Compact Value-Function Representations
for Qualitative Preferences. UAI
2004: 51-59 |
|
||||
_ |
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) |
|
||||
__ |
Ronen I. Brafman, Moshe
Tennenholtz: Efficient learning equilibrium. Artif.
Intell. 159(1-2): 27-47 (2004) |
|
||||
Ronen I. Brafman: A simplifier for propositional formulas with many
binary clauses. IEEE
Transactions on Systems, Man, and Cybernetics, Part B 34(1): 52-59 (2004) |
|
|||||
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. (JAIR) 21: 135-191 (2004) JAIR-IJCAI_09 Best Paper Award |
|||
2003 |
|
||
|
Ronen I. Brafman, David
Heckerman, Guy Shani: Recommendation as a Stochastic Sequential
Decision Problem. ICAPS
2003: 164-173 |
||
|
Ronen I. Brafman, Yannis
Dimopoulos: A New Look at the Semantics and Optimization Methods of CP-Networks.
IJCAI
2003: 1033-1038 |
||
Ronen I. Brafman, Carmel
Domshlak: Structure and Complexity in Planning with Unary Operators. J.
Artif. Intell. Res. (JAIR) 18: 315-349 (2003) |
|||
__ |
Ronen I. Brafman, Moshe
Tennenholtz: Learning to Coordinate Efficiently: A Model-based Approach. J.
Artif. Intell. Res. (JAIR) 19: 11-23 (2003) |
||
2002 |
|
||
|
Carmel
Domshlak, Ronen I. Brafman: Structure and Complexity in Planning with
Unary Operators. AIPS
2002: 34-43 |
||
|
_ _ |
Carmel
Domshlak, Ronen I. Brafman: CP-nets: Reasoning and Consistency Testing. KR
2002: 121-132 |
|
Ronen I. Brafman, Moshe
Tennenholtz: Efficient Learning Equilibrium. NIPS
2002: 1603-1610 |
|||
|
Guy
Shani, Ronen I. Brafman, David Heckerman: An MDP-based Recommender System. UAI
2002: 453-460 |
||
|
Ronen I. Brafman, Carmel
Domshlak: Introducing Variable Importance Tradeoffs into CP-Nets. UAI
2002: 69-76 |
||
Ronen I. Brafman, Moshe
Tennenholtz: R-MAX - A General Polynomial Time Algorithm for Near-Optimal
Reinforcement Learning. Journal
of Machine Learning Research 3: 213-231 (2002) |
|||
2001 |
|
||
|
Carmel
Domshlak, Ronen I. Brafman, Solomon Eyal Shimony: Preference-Based Configuration
of Web Page Content. IJCAI
2001: 1451-1456 |
||
|
Ronen I. Brafman: A Simplifier
for Propositional Formulas with Many Binary Clauses. IJCAI
2001: 515-522 |
||
|
_ |
Ronen I. Brafman, Moshe
Tennenholtz: R-MAX - A General Polynomial Time Algorithm for Near-Optimal
Reinforcement Learning. IJCAI
2001: 953-958 |
|
Craig
Boutilier, Fahiem
Bacchus, Ronen I. Brafman: UCP-Networks: A Directed Graphical
Representation of Conditional Utilities. UAI
2001: 56-64 |
|||
_ v |
Ronen I. Brafman, Nir
Friedman: On decision-theoretic foundations for defaults. Artif.
Intell. 133(1-2): 1-33 (2001) |
||
Ronen I. Brafman: On
Reachability, Relevance, and Resolution in the Planning as Satisfiability
Approach. J.
Artif. Intell. Res. (JAIR) 14: 1-28 (2001) |
|||
|
Craig
Boutilier, Ronen I. Brafman: Partial-Order Planning with Concurrent
Interacting Actions. J.
Artif. Intell. Res. (JAIR) 14: 105-136 (2001) |
||
2000 |
|
||
_ __ |
Carmel
Domshlak, Ronen I. Brafman: Strucutre and Complexitiy in Planning with
Unary Operators. PuK
2000 |
||
_ v |
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) |
||
_ v |
Ronen I. Brafman, Moshe
Tennenholtz: An axiomatic treatment of three qualitative decision criteria.
J.
ACM 47(3): 452-482 (2000) |
||
1999 |
|
||
|
_ v |
Ronen I. Brafman, Moshe
Tennenholtz: A Near-Optimal Poly-Time Algorithm for Learning a class of
Stochastic Games. IJCAI
1999: 734-739 |
|
|
_ v |
Ronen I. Brafman: Reachability,
Relevance, Resolution and the Planning as Satisfiability Approach. IJCAI
1999: 976-981 |
|
|
_ v |
Ronen I. Brafman, Holger
H. Hoos: To Encode or Not to Encode - Linear Planning. IJCAI
1999: 988-995 |
|
_ v |
Craig
Boutilier, Ronen I. Brafman, Holger
H. Hoos, David Poole: Reasoning With Conditional Ceteris
Paribus Preference Statements. UAI
1999: 71-80 |
||
1998 |
|
||
Craig
Boutilier, Ronen I. Brafman, Christopher W. Geib: Structured Reachability Analysis
for Markov Decision Processes. UAI
1998: 24-32 |
|||
_ v |
Ronen I. Brafman, Joseph
Y. Halpern, Yoav Shoham: On the Knowledge Requirements of Tasks. Artif.
Intell. 98(1-2): 317-349 (1998) |
||
1997 |
|
||
|
Craig
Boutilier, Ronen I. Brafman: Planning with Concurrent Interacting
Actions. AAAI/IAAI
1997: 720-726 |
||
|
_ v |
Ronen I. Brafman: A Heuristic
Variable Grid Solution Method for POMDPs. AAAI/IAAI
1997: 727-733 |
|
|
_ v |
Ronen I. Brafman, Moshe
Tennenholtz: On the Axiomatization of Qualitative Decision Criteria. AAAI/IAAI
1997: 76-81 |
|
|
_ v |
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 |
|
Ronen I. Brafman, Moshe
Tennenholtz: Modeling Agents as Qualitative Decision Makers. Artif.
Intell. 94(1-2): 217-268 (1997) |
|||
_ v |
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) |
||
|
Ronen I. Brafman: A First-Order Conditional
Logic with Qualitative Statistical Semantics. J.
of Logic and Computation 7(6): 777-803 (1997) |
||
1996 |
|
||
|
_ v |
Ronen I. Brafman, Moshe
Tennenholtz: On the Foundations of Qualitative Decision Theory. AAAI/IAAI,
Vol. 2 1996: 1291-1296 |
|
|
|
Ronen I. Brafman:
"Statistical" First Order Conditionals. KR
1996: 398-409 |
|
__v |
Ronen I. Brafman, Moshe
Tennenholtz: On Partially Controlled Multi-Agent Systems. J.
Artif. Intell. Res. (JAIR) 4: 477-507 (1996) |
||
1995 |
|
||
|
Ronen I. Brafman, Nir
Friedman: On Decision-Theoretic Foundations for Defaults. IJCAI
1995: 1458-1465 |
||
|
|
Ronen I. Brafman, Moshe
Tennenholtz: Towards Action Prediction Using a Mental-Level Model. IJCAI
1995: 2010-2016 |
|
|
|
Ronen I. Brafman, Yoav
Shoham: Knowledge Considerations in Robotics and Distribution of Robotic
Tasks. IJCAI
1995: 96-102 |
|
|
|
Ronen I. Brafman, Yoav
Shoham: Knowledge Considerations in Robotics. Reasoning
with Uncertainty in Robotics 1995: 248-262 |
|
1994 |
|
||
|
|
Ronen I. Brafman, Moshe
Tennenholtz: Belief Ascription and Mental-Level Modelling. KR
1994: 87-98 |
|
|
|
Ronen I. Brafman, Jean-Claude
Latombe, Yoram
Moses, Yoav Shoham: Knowledge as a Tool in Motion Planning
and Uncertainty. TARK
1994: 208-224 |
|
1993 |
|
||
|
|
Ronen I. Brafman, Jean-Claude
Latombe, Yoav Shoham: Towards Knowledge-Level Analysis of
Motion Planning. AAAI
1993: 670-675 |