Tom Dean is a full-time research scientist at Google in Mountain View, California. From 1993 to 2007 he was Professor of Computer Science and Cognitive and Linguistic Sciences at Brown University. He still considers Brown his academic home and remains associated with the university through his Adjunct Professor position in Computer Science. He received his B.A. in mathematics from Virginia Polytechnic Institute & State University in 1982 and his M.Sc. and Ph.D. in computer science from Yale University in 1984 and 1986 respectively. His research interests include automated planning and control, computational biology, machine learning, neural modeling, probabilistic inference, robotics and spatial and temporal reasoning.
Dean was named a fellow of AAAI in 1994 and an ACM fellow in 2009. He served as the Deputy Provost of Brown University from 2003 to 2005, as the chair of Brown's Computer Science Department from 1997 until 2002, and as the Acting Vice President for Computing and Information Services from 2001 until 2002. He was a founding member of the Academic Alliance of the National Center for Women and Information Technology and a former member of the IJCAI Inc. Board of Trustees. He has served on the Executive Council of AAAI and the Computing Research Association Board of Directors. He was a recipient of an NSF Presidential Young Investigator Award in 1989. He served as program co-chair for the 1991 National Conference on Artificial Intelligence and the program chair for the 1999 International Joint Conference on Artificial Intelligence held in Stockholm.
Dean is co-author with Mike Wellman of the Morgan-Kaufmann text entitled Planning and Control which ties together techniques from artificial intelligence, operations research, control theory, and the decision sciences. He is co-author with James Allen and John Aloimonos of Artificial Intelligence: Theory and Practice, an introductory text in Artificial Intelligence. His latest book Talking With Computers is published by Cambridge University Press and examines a wide range of topics from digital logic and machine language to artificial intelligence and searching the web.
“Graphical Models of the Visual Cortex”, Thomas Dean, Heuristics, Probability and Causality, 2010, pp. 121-142.
[search]
“Sparse Spatiotemporal Coding for Activity Recognition”, Thomas Dean, Greg Corrado, Rich Washington, 2010.
[abstract] [cs.brown.edu] [search]
“On the Prospects for Building a Working Model of the Visual Cortex”, Thomas Dean, Glenn Carroll, Richard Washington, Proceedings of AAAI-07, 2007, pp. 1597-1600.
[search]
“Learning Invariant Features Using Inertial Priors”, Thomas Dean, Annals of Mathematics and Artificial Intelligence, vol. 47 (2006), pp. 223-250.
[search]
“Scalable Inference in Hierarchical Generative Models”, Thomas Dean, Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics, 2006.
[search]
“A Computational Model of the Cerebral Cortex”, Thomas Dean, Proceedings of AAAI-05, 2005, pp. 938-943.
[search]
“A Computational Model of the Cerebral Cortex”, Thomas Dean, AAAI, 2005, pp. 938-943.
[search]
Talking With Computers, Thomas Dean, 2005.
[search]
“Equivalence Notions and Model Minimization in Markov Decision Processes”, Robert Givan, Thomas Dean, Matthew Greig, Artificial Intelligence, vol. 147 (2003), pp. 163-223.
[search]
“Exploiting Locality in Searching the Web”, Joel Young, Thomas Dean, Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI-03), 2003, pp. 608-615.
[search]
“Exploiting Locality in Searching the Web”, Joel Young, Thomas Dean, UAI, 2003, pp. 608-615.
[search]
“Solving Factored Markov Decision Processes Using Non-homogeneous Partitions”, Kee-Eung Kim, Thomas Dean, Artificial Intelligence, vol. 147 (2003), pp. 225-251.
[search]
“Solving factored MDPs using non-homogeneous partitions”, Kee-Eung Kim, Thomas Dean, Artif. Intell., vol. 147 (2003), pp. 225-251.
[doi] [search]
“Solving Factored MDPs with Large Action Spaces Using Algebraic Decision Diagrams”, Kee-Eung Kim, Thomas Dean, Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence (PRICAI-02), 2002, pp. 80-89.
[search]
“Solving Factored MDPs using Non-Homogeneous Partitions”, Kee-Eung Kim, Thomas Dean, Proceedings IJCAI-01, 2001, pp. 683-689.
[search]
“Approximate Solutions to Factored Markov Decision Processes via Greedy Search in the Space of Finite State Controllers”, Kee-Eung Kim, Nicolas Meuleau, Thomas Dean, Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (ICAPS-2000, pp. 323-330.
[search]
“Bounded Parameter Markov Decision Processes”, Robert Givan, Sonia Leach, Thomas Dean, Artificial Intelligence, vol. 122 (2000), pp. 71-109.
[search]
“Decision Theoretic Planning: Structural Assumptions and Computational Leverage”, Craig Boutilier, Thomas Dean, Steve Hanks, Journal of Artificial Intelligence Research, vol. 11 (1999), pp. 1-94.
[search]
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99, Stockholm, Sweden, Thomas Dean, 1999.
[search]
“A Conditional Scheduling Approach to Designing Real-Time Systems”, Lloyd Greenwald, Thomas Dean, AIPS, 1998, pp. 224-231.
[search]
“A conditional scheduling approach to designing real-time systems”, Lloyd Greenwald, Thomas Dean, Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (ICAPS-98), 1998, pp. 224-231.
[search]
“Hierarchical Solution of Markov Decision Processes using Macro-actions”, Milos Hauskrecht, Nicolas Meuleau, Leslie Pack Kaelbling, Thomas Dean, Craig Boutilier, UAI, 1998, pp. 220-229.
[rome.exp.sis.pitt.edu] [search]
“Hierarchical solution of Markov decision processes using macro-actions”, Milos Hauskrecht, Nicolas Meuleau, Craig Boutilier, Leslie Pack Kaelbling, Thomas Dean, Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), 1998, pp. 220-229.
[search]
“Solving Planning Problems with Large State and Action Spaces”, Thomas Dean, Robert Givan, Kee-Eung Kim, Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (ICAPS-98), 1998, pp. 102-110.
[search]
“Solving Stochastic Planning Problems with Large State and Action Spaces”, Thomas Dean, Robert Givan, Kee-Eung Kim, AIPS, 1998, pp. 102-110.
[search]
“Solving Very Large Weakly Coupled Markov Decision Processes”, Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, Leonid Peshkin, Leslie Pack Kaelbling, Thomas Dean, Craig Boutilier, AAAI/IAAI, 1998, pp. 165-172.
[search]
“Solving very large weakly coupled Markov decision processes”, Nicolas Meuleau, Craig Boutilier, Milos Hauskrecht, Leslie Kaelbling, Kee-Eung Kim, Leonid Peshkin, Thomas Dean, Proceedings AAAI-98, 1998, pp. 165-172.
[search]
“A Retrospective of the AAAI Robot Competitions”, R. Peter Bonasso, Thomas Dean, AI Magazine, vol. 18 (1997), pp. 11-23.
[search]
“Bounded Parameter Markov Decision Processes”, Robert Givan, Sonia M. Leach, Thomas Dean, ECP, 1997, pp. 234-246.
[search]
“Coping with Uncertainty in Map Learning”, Kenneth Basye, Thomas Dean, Jeffrey Scott Vitter, Machine Learning, vol. 29 (1997), pp. 65-88.
[search]
“Model Minimization in Markov Decision Processes”, Thomas Dean, Robert Givan, AAAI/IAAI, 1997, pp. 106-111.
[search]
“Model Minimization, Regression, and Propositional STRIPS Planning”, Robert Givan, Thomas Dean, IJCAI, 1997, pp. 1163-1168.
[search]
“Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes”, Thomas Dean, Robert Givan, Sonia M. Leach, UAI, 1997, pp. 124-131.
[rome.exp.sis.pitt.edu] [search]
“Planning and Scheduling”, Thomas Dean, Subbarao Kambhampati, The Computer Science and Engineering Handbook, 1997, pp. 614-636.
[search]
“Strategic Directions in Artificial Intelligence (Reprint)”, Jon Doyle, Thomas Dean, AI Magazine, vol. 18 (1997), pp. 87-101.
[search]
“A Framework for the Development of Multiagent Architectures”, Moises Lejter, Thomas Dean, IEEE Expert, vol. 11 (1996), pp. 47-59.
[csdl.computer.org] [search]
“Automated Planning”, Thomas Dean, ACM Comput. Surv., vol. 28 (1996), pp. 85-87.
[search]
“Challenge Problems for Artificial Intelligence (Panel Statements)”, Bart Selman, Rodney A. Brooks, Thomas Dean, Eric Horvitz, Tom M. Mitchell, Nils J. Nilsson, AAAI/IAAI, Vol. 2, 1996, pp. 1340-1345.
[search]
“Challenge Problems for Artificial Intelligence (Panel Statements)”, Bart Selman, Rodney A. Brooks, Thomas Dean, Eric Horvitz, Tom M. Mitchell, Nils J. Nilsson, Proceedings of AAAI-96, 1996, pp. 1340-1345.
[search]
“Context-Dependent Computational Components”, Thomas Dean, SIGART Bulletin, vol. 7 (1996), pp. 3-6.
[search]
“Integrating Theory and Practice in Planning”, Thomas Dean, ACM Comput. Surv., vol. 28 (1996), pp. 2.
[search]
“Localized Temporal Reasoning Using Subgoals and Abstract Events”, Shieu-Hong Lin, Thomas Dean, Computational Intelligence, vol. 12 (1996), pp. 423-449.
[search]
“Package Routing in Transportation Networks with Fixed Vehicle Schedules: Formulation, Complexity Results and Approximation Algorithms”, Lloyd Greenwald, Thomas Dean, Networks, vol. 27 (1996), pp. 81-93.
[search]
“Package routing in transportation networks with fixed vehicle schedules”, Lloyd Greenwald, Thomas Dean, Networks, vol. 27 (1996), pp. 81-93.
[doi] [search]
“Robots With AI: A Retrospective on the AAAI Robot Competitions and Exhibitions”, R. Peter Bonasso, Thomas Dean, AAAI/IAAI, Vol. 2, 1996, pp. 1321.
[search]
“Anticipating Computational Demands when Solving Time-Critical Decision-Making Problems”, Lloyd Greenwald, Thomas Dean, The Algorithmic Foundations of Robotics, 1995.
[search]
Artificial Intelligence: Theory and Practice, Thomas Dean, James Allen, Yiannis Aloimonos, 1995.
[search]
“Decomposition Techniques for Planning in Stochastic Domains”, Thomas Dean, Shieu-Hong Lin, Proceedings IJCAI-95, 1995, pp. 1121-1127.
[search]
“Generating Optimal Policies for High-Level Plans with Conditional Branches and Loops”, Shieu-Hong Lin, Thomas Dean, Proceedings of the 3rd European Workshop on Planning, 1995, pp. 205-218.
[search]
“Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning”, Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron, Machine Learning, vol. 18 (1995), pp. 81-108.
[search]
“Learning Dynamics: System Identification for Perceptually Challenged Agents”, Kenneth Basye, Thomas Dean, Leslie Kaelbling, Artificial Intelligence, vol. 72 (1995), pp. 139-171.
[search]
“On the Complexity of Solving Markov Decision Problems”, Michael Littman, Thomas Dean, Leslie Kaelbling, Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, 1995, pp. 394-402.
[search]
“Planning Under Time Constraints in Stochastic Domains”, Thomas Dean, Leslie Kaelbling, Jak Kirman, Ann Nicholson, Artificial Intelligence, vol. 76 (1995), pp. 35-74.
[search]
“Planning Under Uncertainty: Structural Assumptions and Computational Leverage”, Craig Boutilier, Thomas Dean, Steve Hanks, Proceedings of the 3rd European Workshop on Planning, 1995.
[search]
“Review: AI Scheduling Methods”, Thomas Dean, IEEE Expert, vol. 10 (1995), pp. 76-77.
[computer.org] [search]
“Decision-Theoretic Deliberation Scheduling for Problem Solving in Time-Constrained Environments”, Mark Boddy, Thomas Dean, Artificial Intelligence, vol. 67 (1994), pp. 245-286.
[search]
“Deliberation Scheduling for Problem Solving in Time-Constrained Environments”, Mark S. Boddy, Thomas Dean, Artif. Intell., vol. 67 (1994), pp. 245-285.
[search]
“Exploiting Locality in Temporal Reasoning”, Shieu-Hong Lin, Thomas Dean, Current Trends in AI Planning, 1994.
[search]
“Localized Temporal Reasoning: A State-Based Approach”, Shieu-Hong Lin, Thomas Dean, TIME, 1994, pp. 3-12.
[ftp.cs.uregina.ca] [search]
“Meditations on Time and Space: Expediting Temporal Reasoning by Exploiting Time and Space (Abstract)”, Thomas Dean, Proceedings of the First International Workshop on Temporal Representation and Reasoning (TIME-94), 1994, pp. 3-12.
[search]
“Monte Carlo Simulation and Bottleneck-Centered Heuristics for Time-critical Scheduling in Stochastic Domains”, Lloyd Greenwald, Thomas Dean, ARPI Planning Initiative Workshop, 1994.
[search]
“Solving Time-Critical Decision-Making Problems with Predictable Computational Demands”, Lloyd Greenwald, Thomas Dean, Proceedings of the 2nd International Conference on AI Planning Systems (ICAPS-94), 1994, pp. 25-30.
[search]
“Solving Time-critical Decision-making Problems with Predictable Computational Demands”, Thomas Dean, Lloyd Greenwald, AIPS, 1994, pp. 25-30.
[search]
“Temporal Reasoning: A State-based approach”, Shieu-Hong Lin, Thomas Dean, Proceedings of the First International Workshop on Temporal Representation and Reasoning (TIME-94), 1994, pp. 3-12.
[search]
“Time-Critical Scheduling in Stochastic Domains”, Lloyd Greenwald, Thomas Dean, AAAI, 1994, pp. 1452.
[search]
“Using Goals to Find Plans with High Expected Utility”, Jak Kirman, Ann Nicholson, Moises Lejter, Thomas Dean, Eugene Santos Jr., Current Trends in AI Planning, 1994.
[search]
“1992 AAAI Robot Exhibition and Competition”, Thomas Dean, R. Peter Bonasso, AI Magazine, vol. 14 (1993), pp. 35-48.
[search]
“Deliberation Scheduling for Time-Critical Sequential Decision Making”, Thomas Dean, Leslie Kaelbling, Jak Kirman, Ann Nicholson, Proceedings of the 9th Conference on Uncertainty in Artificial Intelligence, 1993, pp. 309-316.
[search]
“Planning With Deadlines in Stochastic Domains”, Thomas Dean, Leslie Kaelbling, Jak Kirman, Ann Nicholson, Proceedings AAAI-93, 1993, pp. 574-579.
[search]
“Planning and Selective Perception for Mobile Robot Object Retrieval Tasks”, Theodore Camus, Jonathan Monsarrat, Thomas Dean, Proceedings of the DARPA Image Understanding Workshop, 1993.
[search]
“A Decision-Theoretic Approach to Planning, Perception, and Control”, Kenneth Basye, Thomas Dean, Jak Kirman, Moises Lejter, IEEE Expert, vol. 7 (1992), pp. 58-65.
[csdl.computer.org] [search]
“Anticipating Tomorrow's Technology Needs”, Thomas Dean, Omni Magazine (1992).
[search]
“Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning”, Thomas Dean, Dana Angluin, Kenneth Basye, Sean Engelson, Leslie Kaelbling, Evangelos Kokkevis, Oded Maron, Proceedings AAAI-92, 1992, pp. 208-214.
[search]
“Learning Labelled Graphs from Noisy Data”, Leslie Kaelbling, Kenneth Basye, Thomas Dean, Proceedings of the 7th Yale Workshop on Adaptive and Learning Systems, 1992, pp. 149-154.
[search]
“Reinforcement Learning for Planning and Control”, Thomas Dean, Ken Basye, John Shewchuk, Machine Learning Methods for Planning and Scheduling, 1992.
[search]
“Representation Issues in Bayesian Decision Theory for Planning and Active Perception”, Thomas Dean, Jak Kirman, Proceedings of the DARPA Image Understanding Workshop, 1992, pp. 763-768.
[search]
“Uncertainty in Graph-based Map Learning”, Thomas Dean, Ken Basye, Leslie Kaelbling, Robot Learning, 1992.
[search]
“Decision-Theoretic Control of Inference for Time-Critical Applications”, Thomas Dean, International Journal Intelligent Systems, vol. 6 (1991), pp. 417-441.
[search]
Planning and Control, Thomas Dean, Michael Wellman, 1991.
[search]
Proceedings of the Ninth National Conference on Artificial Intelligence, AAAI-91, Anaheim, California, Thomas Dean, Kathy McKeown, 1991.
[search]
“Sensor Abstractions for Control of Navigation”, Jak Kirman, Kenneth Basye, Thomas Dean, Proceedings of the IEEE International Conference on Robotics and Automation, 1991, pp. 2812-2817.
[search]
“An Approach to Reasoning About Continuous Change for Applications in Planning”, Thomas Dean, Greg Siegle, Proceedings AAAI-90, 1990, pp. 132-137.
[search]
“Coping with Uncertainty in a Control System for Navigation and Exploration”, Thomas Dean, Kenneth Basye, Robert Chekaluk, Seungseok Hyun, Moises Lejter, Margaret Randazza, Proceedings AAAI-90, 1990, pp. 1010-1015.
[search]
“Planning and Active Perception”, Thomas Dean, Kenneth Basye, Moises Lejter, Proceedings of the DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control, 1990, pp. 271-276.
[search]
“Prediction, Observation, and Estimation in Planning and Control”, Thomas Dean, Keiji Kanazawa, John Shewchuk, Proceedings of the 5th IEEE International Symposium on Intelligent Control, 1990, pp. 645-650.
[search]
“Sequential Decision Making for Active Perception”, Thomas Dean, Theodore Camus, Jak Kirman, Proceedings of the DARPA Image Understanding Workshop, 1990, pp. 889-894.
[search]
“Towards Learning Time-Varying Functions With High Input Dimensionality”, John Shewchuk, Thomas Dean, Proceedings of the 5th IEEE International Symposium on Intelligent Control, 1990, pp. 383-388.
[search]
“A Model for Projection and Action”, Keiji Kanazawa, Thomas Dean, Proceedings IJCAI-89, 1989, pp. 985-990.
[search]
“A Model for Reasoning About Persistence and Causation”, Thomas Dean, Keiji Kanazawa, Computational Intelligence Journal, vol. 5 (1989), pp. 142-150.
[search]
“Approximation Algorithms for Planning and Control”, Mark Boddy, Thomas Dean, Proceedings of the NASA Conference on Telerobotics, 1989.
[search]
“Coping With Uncertainty in Map Learning”, Kenneth Basye, Thomas Dean, Jeffrey Scott Vitter, Proceedings IJCAI-89, 1989, pp. 663-668.
[search]
“Map Learning With Indistinguishable Locations”, Kenneth Basye, Thomas Dean, Proceedings of the NASA Conference on Telerobotics, 1989.
[search]
“On the Value of Goals”, Thomas Dean, Michael Wellman, Proceedings from the Rochester Planning Workshop: From Formal Systems to Practical Systems, 1989, pp. 129-140.
[search]
“Persistence and Probabilistic Inference”, Thomas Dean, Keiji Kanazawa, IEEE Transactions on Systems, Man, and Cybernetics, vol. 19 (1989), pp. 574-585.
[search]
“Solving Time-Dependent Planning Problems”, Mark Boddy, Thomas Dean, Proceedings IJCAI-89, 1989, pp. 979-984.
[search]
“Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases”, Thomas Dean, Journal of the ACM, vol. 36 (1989), pp. 687-718.
[search]
“An Analysis of Time-Dependent Planning”, Thomas Dean, Mark Boddy, Proceedings AAAI-88, 1988, pp. 49-54.
[search]
“An Approach to Reasoning About the Effects of Actions for Automated Planning Systems”, Thomas Dean, Annals of Operations Research, vol. 12 (1988), pp. 147-167.
[search]
“Hierarchical planning involving deadlines, travel time, and resources”, Thomas Dean, R. James Firby, David Miller, Computational Intelligence, vol. 4 (1988), pp. 381-398.
[search]
“Locating a Mobile Robot Using Local Observations and a Global Satellite Map”, Akira Hayahsi, Thomas Dean, Proceedings of the 3rd IEEE International Symposium on Intelligent Control, 1988, pp. 135-140.
[search]
“On the Complexity of Integrating Spatial Measurements”, Thomas Dean, Proceedings of the SPIE Conference on Advances in Intelligent Robotic Systems, 1988.
[search]
“Planning Paradigms”, Thomas Dean, Proceedings of the DARPA Knowledge-Based Planning Workshop (also appeared in the Proceedings of the 3rd Annual Workshop of Israel Association for Artificial Intelligence, and in the AI Magazine, Fall 1988).
[search]
“Probabilistic Causal Reasoning”, Thomas Dean, Keiji Kanazawa, Proceedings of the Canadian Society for Computational Studies of Intelligence, 1988, pp. 125-132.
[search]
“Probabilistic Temporal Reasoning”, Thomas Dean, Keiji Kanazawa, Proceedings AAAI-88, 1988, pp. 524-528.
[search]
“Reasoning About Partially Ordered Events”, Thomas Dean, Mark Boddy, Artificial Intelligence, vol. 36 (1988), pp. 375-399.
[search]
“Benchmarks for Research in Planning”, Thomas Dean, Proceedings of the 2nd Workshop on AI and Simulation, 1987.
[search]
“Experiments in Planning and Control”, Thomas Dean, Proceedings of the AAAI-87 Workshop on Planning for Autonomous Mobile Robots, 1987.
[search]
“High-Level Planning and Low-Level Control”, Thomas Dean, Proceedings of the SPIE Conference on Advances in Intelligent Robotic Systems, 1987, pp. 496-501.
[search]
“Incremental Causal Reasoning”, Thomas Dean, Mark S. Boddy, AAAI, 1987, pp. 196-201.
[search]
“Incremental Causal Reasoning”, Thomas Dean, Mark Boddy, Proceedings AAAI-87, 1987, pp. 196-201.
[search]
“Large-Scale Temporal Data Bases for Planning in Complex Domains”, Thomas Dean, IJCAI, 1987, pp. 860-866.
[search]
“Planning, Execution, and Control”, Thomas Dean, Proceedings of the DARPA Knowledge-Based Planning Workshop, 1987, 29:1-10.
[search]
“Temporal Data Base Management”, Thomas Dean, Drew V. McDermott, Artif. Intell., vol. 32 (1987), pp. 1-55.
[search]
“Temporal Data Base Management”, Thomas Dean, Drew V. McDermott, Artificial Intelligence, vol. 32 (1987), pp. 1-55.
[search]
“Decision Support for Coordinated Multi-Agent Planning”, Thomas Dean, Proceedings of the 3rd International ACM Conference on Office Information Systems, 1986.
[search]
“Handling Shared Resources in a Temporal Database Management System”, Thomas Dean, Decision Support Systems, vol. 2 (1986), pp. 135-143.
[search]
“Intractability and Time-Dependent Planning”, Thomas Dean, Reasoning About Actions and Plans, 1986, pp. 245-266.
[search]
“Deadlines, Travel Time, and Robot Problem Solving”, David P. Miller, R. James Firby, Thomas Dean, IJCAI, 1985, pp. 1052-1054.
[search]
“Efficient Robot Planning with Deadlines and Travel Time”, R. James Firby, Thomas L. Dean, David P. Miller, Proceedings of the 6th International Symposium on Robotics and Automation, 1985.
[search]
Temporal Imagery: An Approach to Reasoning about Time for Planning and Problem Solving, Thomas Dean, 1985.
[search]
“Temporal Notation and Causal Terminology”, Yoav Shoham, Thomas Dean, Proceedings 7th Annual Conference of the Cognitive Science Society, 1985, pp. 90-99.
[search]
“Temporal Reasoning Involving Counterfactuals and Disjunctions”, Thomas Dean, IJCAI, 1985, pp. 1060-1062.
[search]
“Managing Time Maps”, Thomas Dean, Proceedings of the Canadian Society for Computational Studies of Intelligence, 1984.
[search]
“Planning and Temporal Reasoning under Uncertainty”, Thomas Dean, Proceedings of the IEEE Workshop on Principles of Knowledge-Based Systems, 1984, pp. 131-138.
[search]