Prof. Ronen Brafman

brafman foto Professor

Contacts

Email:
Homepage:
Office: 209 in 37 building
Phone number: 08-6428041
Fax number: 08-6477650
Box number: 41
Office hours: Wed 10:30-12:00

Teaching

Fall 2014-2015 20225551 Research Seminar
Fall 2014-2015 20212011 Automata and Formal Languages
Fall 2014-2015 20214251 Topics in Artificial Intelligence
Fall 2014-2015 20214001 Project Course
Fall 2013-2014 20212011 Automata and Formal Languages
Fall 2013-2014 20225551 Research Seminar
Spring 2014 20225171 Artificial Intelligence Planning and Decision Making
Spring 2014 20012011 Automata and Formal Languages for IAF
Fall 2012-2013 20221551 Advanced Seminar in Intelligent Systems
Fall 2012-2013 20212011 Automata and Formal Languages
Spring 2013 20225171 Artificial Intelligence Planning and Decision Making
Fall 2011-2012 20225551 Research Seminar
Fall 2011-2012 20212011 Automata and Formal Languages
Spring 2012 20214063 Topics in Reactice System Programming
Spring 2012 20225171 Artificial Intelligence Planning and Decision Making
Spring 2012 20012011 Automata and Formal Languages for IAF
Fall 2010-2011 20212011 Automata and Formal Languages
Spring 2011 20215461 Topics in the Frontiers of Computer Science for Honor Students
Spring 2011 20225171 Artificial Intelligence Planning and Decision Making
Fall 2009-2010 20215331 Introduction to AI Planning
Fall 2009-2010 20212011 Automata and Formal Languages
Spring 2010 20221171 Advanced Topics in AI Planning
Spring 2010 22222 Questionnaire
Fall 2008-2009 20212011 Automata and Formal Languages
Spring 2009 20221171 Advanced Topics in AI Planning
Spring 2009 20215331 Introduction to AI Planning
Fall 2007-2008 20212011 Automata and Formal Languages
Fall 2007-2008 20225171 Artificial Intelligence Planning and Decision Making
Spring 2008 20225461 Introduction to Machine Learning
Fall 2006-2007 20212011 Automata and Formal Languages
Fall 2006-2007 20214251 Topics in Artificial Intelligence
Spring 2007 20225171 Artificial Intelligence Planning and Decision Making
Spring 2007 20225551 Research Seminar

Research groups

Artificial Intelligence
Learning
Planning and reasoning

Selected publications all BibTex

 
Articles
Efficient Learning Equilibrium. Artificial Intelligence, 159(1-2):27-47, 2004.
C. Boutilier R. I. Brafman C. Domshlak H. H. Hoos and D. Poole. Preference-Based Constrained Optimization with CP-nets. Computational Intelligence, 20(2):137-157, 2004.
R. Brafman C. Domshlak and E. S. Shimony. Qualitative Decision Making in Adaptive Presentation of Structured Information. ACM Transaction on Information Systems, 22(4):503-539, 2004.
C. Boutilier R. I. Brafman C. Domshlak H. H. Hoos and D. Poole. CP-Nets: A Tool for Representing and Reasoning with Conditional \emphCeteris Paribus Preference Statements. Journal of Artificial Intelligence Research (JAIR), 21, 2004.
Ronen I. Brafman. A Simplifier for Propositional Formulas with Many Binary Clauses. IEEE Transactions on Systems, Man, and Cybernetics - B, 34(1):52-59, 2004.
R. I. Brafman and Y. Dimopolous. Extended Semantics and Optimization Algorithms for CP-Networks. Computational Intelligence, 20(2):218-245, 2004.
Ronen I. Brafman and Moshe Tennenholtz. Learning to Coordinate Efficiently: A Model-based Approach.. Journal of Artificial Intelligence Research (JAIR), 19:11-23, 2003.
Ronen I. Brafman and Carmel Domshlak. Structure and Complexity in Planning with Unary Operators.. Journal of Artificial Intelligence Research (JAIR), 18:315-349, 2003.
R. I. Brafman and M. Tennenholtz. R-max - A general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3:213-231, 2002.
Ronen I. Brafman and Nir Friedman. On decision-theoretic foundations for defaults.. Artificial Intelligence, 133(1-2):1-33, 2001.
R. I. Brafman. On Reachability, Relevance, and Resolution in the Planning as Satisfiabilty Approach. Journal of Artificial Intelligence Research, 14:1-28, 2001.
C. Boutilier and R. I. Brafman. Planing with Concurrent Interacting Actions. Journal of Artificial Intelligence Research, 14:105-136, 2001.
R. I. Brafman and M. Tennenholtz. An Axiomatic Treatment of Three Qualitative Decision Criteria. Journal of the ACM, 47(3), March 2000.
R. I. Brafman and M. Tennenholtz. A Near Optimal Polynomial Time Algorithm for Learning in Certain Classes of Stochastic Games. Artificial Intelligence, 47(3):452-482, 2000.
R. I. Brafman J. Halpern and Y. Shoham. On the Knowledge Requirements of Tasks. Artificial Intelligence, 98(1-2):317-350, 1998.
R. I. Brafman. A First-order Conditional Logic with Qualitative Statistical Semantics. Journal of Logic and Computation, 7(6):777-803, December 1997.
R. I. Brafman J. C. Latombe Y. Moses and Y. Shoham. Applications of a Logic of Knowledge to Motion Planning under Uncertainty. Journal of the ACM, September 1997.
R. I. Brafman and M. Tennenholtz. Modeling Agents as Qualitative Decision Makers. Artificial Intelligence, 94:217-268, 1997.
R. I. Brafman and M. Tennenholtz. On Partially Controlled Multi-Agent Systems. Journal of Artificial Intelligence Research, 4:477-503, 1996.
 
Conference Articles
Ronen I. Brafman and Moshe Tennenholtz. Optimal Efficient Learning Equilibrium: Imperfect Monitoring in Symmetric Games. In AAAI, 2005.
Mausam E. Benezera R. I. Brafman N. Mealeau and E. Hansen. Planning with Continuous Resources in Stochastic Domains. In IJCAI, 2005.
Joerg Hoffmann and Ronen I. Brafman. Contingent Planning via Heuristic Forward Search with Implicit Belief States. In ICAPS, 2005.
Ronen I. Brafman and Yuri Chernyavsky. Planning with Goal Preferences and Constraints. In ICAPS, 2005.
Ronen I. Brafman and Jörg Hoffmann. Conformant Planning via Heuristic Forward Search: A New Approach.. In ICAPS, pages 355-364, 2004.
Guy Shani and Ronen I. Brafman. Resolving Perceptual Aliasing in the Presence of Noisy Sensors. In NIPS, 2004.
Ronen I. Brafman Carmel Domshlak and Tanya Kogan. Compact Value-Function Representations for Qualitative Preferences. In UAI, 2004.
Avi Bab and Ronen I. Brafman. An Experimental Study of Different Approaches to Reinforcement Learning in Common Interest Stochastic Games.. In ECML, pages 75-86, 2004.
R. I. Brafman and Y. Dimopoulos. A New Look at the Semantics and Optimization Methods of CP-Networks. In Proceedings of of the Eighteenth International Joint Conference on Artificial Intelligence, pages 1033-1038, 2003.
Ronen I. Brafman David Heckerman and Guy Shani. Recommendation as a Stochastic Sequential Decision Problem.. In ICAPS, pages 164-173, 2003.
R. Brafman and C. Domshlak. Introducing Variable Importance Tradeoffs into CP-Nets. In Workshop on Planning and Scheduling with Multiple Criteria, April 2002.
R. Brafman and C. Domshlak. TCP-nets for Preference-based Product Configuration. In Proceedings of the Fifth Workshop on Configuration, ECAI-2002, July 2002.
Carmel Domshlak and Ronen I. Brafman. Structure and Complexity in Planning with Unary Operators.. In AIPS, pages 34-43, 2002.
G. Shani R. I. Brafman and D. Heckerman. An MDP-Based Recommender System. In 18th Conference on Uncertainty in AI UAI`02, pages 453-460, 2002.
Ronen I. Brafman and Moshe Tennenholtz. Efficient Learning Equilibrium.. In NIPS, pages 1603-1610, 2002.
R. Brafman and C. Domshlak. Introducing Variable Importance Tradeoffs into CP-Nets. In Proc. 18th Conf. on Uncertainty in AI (UAI`02), 2002.
C. Domshlak and R. I. Brafman. CP-nets - Reasoning and Consistency Testing. In Proc. 8th Int. Conf. on KR&R, pages 121-132, 2002.
R. Brafman and C. Domshlak. CP-networks for Preference-based CSP. , pages 31-42, December 2001. Proceedings of the Workshop on Modelling and Solving Problems with Soft Constraints (in CP-01).
R. I. Brafman and M. Tennenholtz. R-max - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. In IJCAI`01, 2001.
C. Domshlak R. I. Brafman and E. S. Shimony. Preference-Based Configuration of Web Page Content. In Proc. 17th International Joint Conference on AI (IJCAI`01), pages 1451-1456, 2001.
Ronen I. Brafman. A Simplifier for Propositional Formulas with Many Binary Clauses.. In IJCAI, pages 515-522, 2001.
Craig Boutilier Fahiem Bacchus and Ronen I. Brafman. UCP-Networks: A Directed Graphical Representation of Conditional Utilities.. In UAI, pages 56-64, 2001.
Igor Razgon and Ronen I. Brafman. A Forward Search Planning Algorithm with a Goal Ordering Heuristic. In Proc. European Conference on Planning (ECP), pages 25-36, 2001.
C. Domshlak and R. Brafman. Structure and Complexity in Planning with Unary Operators - Preliminary Report. In Proceedings of 14th Workshop "New Results in Planning Scheduling and Design",, pages 11-15, August 2000.
Carmel Domshlak Samir Genaim and Ronen Brafman. Preference-based Configuration of Web Page Content. In Proceedings of 3rd Workshop on Configuration, ECAI-2000, pages 19-22, August 2000.
Carmel Domshlak and Ronen Brafman. Structure and Complexity in Planning with Unary Operators. In Proceedings of 14th Workshop "New Results in Planning Scheduling and Design",, pages 11-15, August 2000.
C. Domshlak S. Genaim and R. Brafman. Preference-based Configuration of Web Page Content - Preliminary Report. In Proceedings of 3rd Workshop on Configuration, ECAI-2000, pages 19-22, August 2000.
R. I. Brafman and M. Tennenholtz. A near-optimal poly-time algorithm for learning in a class of stochastic games. In IJCAI`99, pages 734-739, 1999.
Ronen I. Brafman and Moshe Tennenholtz. A Near-Optimal Poly-Time Algorithm for Learning a class of Stochastic Games.. In IJCAI, pages 734-739, 1999.
Ronen I. Brafman. Reachability, Relevance, Resolution and the Planning as Satisfiability Approach.. In IJCAI, pages 976-981, 1999.
C. Boutilier R. I. Brafman H. H. Hoos and D. Poole. Reasoning with Conditional Ceteris Paribus Preference Statements. In UAI`99, pages 71-80, 1999.
R. I. Brafman and H. H. Hoos. To encode or not to encode - I: linear planning. In IJCAI`99, pages 988-993, 1999.
R. I. Brafman. Reachability, Relevance, Resolution, and the planning as satisfiability approach. In IJCAI`99, pages 976-981, 1999.
Craig Boutilier Ronen I. Brafman and Christopher W. Geib. Structured Reachability Analysis for Markov Decision Processes.. In UAI, pages 24-32, 1998.
R. I. Brafman H. H. Hoos and C. Boutilier. LPSP - A linear plan-level stochastic planner. In Proceedings of the 17th Workshop of the UK Planning and Scheduling Special Interest Group, pages 3-16, 1998.
C. Boutilier R. I. Brafman and C. Geib. Structured Reachability Analysis for Markov Decision Processes. In Proc. of 14th Conference on Uncertainty in AI, pages 24-32, 1998.
R. I. Brafman and Moshe Tennenholtz. On the foundations of qualitative decision theory. In Proc.of the 14th National Conference on AI (AAAI `97), pages 76-81, 1997.
C. Boutilier and R. I. Brafman. Planning with Concurrent Interacting Actions. In Proc. of the 14th National Conference on AI (AAAI `97), pages 720-726, 1997.
R. I. Brafman and Moshe Tennenholtz. On the Axiomatization of Qualitative Decision Criteria. In AAAI Spring Symposium on Qualitative Preferences in Deliberation and Practical Reasoning, 1997.
C. Boutilier R. I. Brafman and C. Geib. Prioritized Goal Decomposition of Markov Decision Processes: Toward a Synthesis of Classical and Decision Theoretic Planning. In Proc. of 15th International Joint Conference on Artificial Intelligence (IJCAI `97), 1997.
C. Boutilier R. I. Brafman C. Geib and D. Poole. Reasoning with Ceteris Paribus Preference Statements. In AAAI Spring Symposium on Qualitative Preferences in Deliberation and Practical Reasoning, 1997.
R. I. Brafman. A Heuristic Variable Grid Solution Method for POMDPs. In Proc. of the 14th National Conference on AI (AAAI `97), pages 727-733, 1997.
R. I. Brafman and Moshe Tennenholtz. On the foundations of qualitative decision theory. In Proc.of the 13th National Conference on AI (AAAI `96), pages 1291-1296, 1996.
Ronen I. Brafman. statistical" First-order Conditionals. In Proc. of the 5th Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR`96), 1996.
R. I. Brafman and M. Tennenholtz. Action Prediction using a Mental-level model. In Proc. of the AAAI Spring Symposium on Representing Mental States and Mechanisms, 1995.
R. I. Brafman and Y. Shoham. Knowledge considerations in Robotics and distribution of robotic tasks. In ijcai95, 1995.
R. I. Brafman and M. Tennenholtz. Towards Action Prediction using a Mental-level model. In Proc. Fourteenth International Joint Conference on AI, 1995.
R. I. Brafman and N. Friedman. On decision-theoretic foundations for defaults. In ijcai95, 1995.
R. I. Brafman J. C. Latombe Y. Moses and Y. Shoham. Knowledge as a tool in motion planning under uncertainty. In TARK, Proc. of the 5th Conf., R. Fagin editor, pages 208-224, Morgan Kaufmann, 1994.
R. I. Brafman and M. Tennenholtz. Belief Ascription and Mental-level Modelling. In Proc. of Fourth Intl. Conf. on Principles of Knowledge Representation and Reasoning, J. Doyle E. Sandewall P. Torasso editor, pages 87-98, 1994.
R. I. Brafman J. C. Latombe and Y. Shoham. Towards knowledge-level analysis of motion planning. In Proc. of the Eleventh National Conf. on AI, pages 670-675, 1993.
 
Master Thesis
R. I. Brafman. A Logic of Normality: Predicate Calculus Incorporating Assertions. , 1991, Hebrew University of Jerusalem.
 
Phd Thesis
R. I. Brafman. Qualitative Models of Information and Decision Making: Foundations and Applications. , March 1996, Stanford University.