To appear in 2nd European Workshop on Planning, Dec 9-11th, 1993 Shieu-Hong...  Home/Search
Context Related
| brown.edu/people/t...nandDeanEWSP94.ps brown.edu/u/tld/po...nandDeanEWSP94.ps brown.edu/pub/pape...WSPLinDean93.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brown.edu/research/ai/publicat... (more) From: brown.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Temporal reasoning with uncertainty about the ordering of events is important in a wide variety of applications. Previous research shows that the associated decision problems are hard even for very restricted cases. In this paper, we investigate using the temporal locality of events and the spatial locality of state spaces to speed inference. We propose a new perspective for representing cause-and-effect relationships based on finite state automata. This perspective exposes the sources of... (Update)
Similar documents based on text: More All
0.0: Alguns elementos sobre Programação Concorrente.. - Baquero (1993) (Correct)
0.0: Introduc~ao - Este Relat'orio Descreve (Correct)
0.0: Comparison of the Brushless Doubly Fed Reluctance Machine and .. - Betz, Jovanovic (1999) (Correct)
BibTeX entry: (Update)
S.-H. Lin and T. Dean. Exploiting locality in temporal reasoning. Technical Report CS-93-24, Dept. of Computer Science, Brown University, 1993. http://citeseer.ist.psu.edu/lin93exploiting.html More
@inproceedings{ lin94exploiting,
author = "Shieu-Hong Lin and Thomas Dean",
title = "Exploiting Locality in Temporal Reasoning",
booktitle = "Current Trends in {AI} Planning: Proceedings of the 2nd European Workshop on Planning ({EWSP}-93)",
publisher = "IOS Press (Amsterdam)",
address = "Vadstena, Sweeden",
editor = "C. B{\"{a}}ckstr{\"{o}}m and E. Sandewell",
isbn = "90-5199-153-3",
pages = "199--212",
year = "1994",
url = "citeseer.ist.psu.edu/lin93exploiting.html" }
Citations (may not include all citations):451 Planning for conjunctive goals (context) - Chapman - 1987
146 Computers and Intractibility: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
89 Complexity results for planning (context) - Bylander - 1991
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1988
57 Learning abstraction hierarchies in problem solving - Knoblock - 1990
44 Localized event-based reasoning for multiagent domains (context) - Lansky - 1988
41 Complexity results for blocks-world planning - Gupta, Nau - 1991
32 the computational complexity of temporal projection - Nebel, Backstrom - 1993
2 Parallel non-binary planning in polynomial time (context) - Backstrom, Klein - 1991
1 Rational reconstruction of localized reasoning (context) - Lin, Dean
Documents on the same site (http://www.cs.brown.edu/research/ai/publications/): More
Acting Optimally in Partially Observable Stochastic Domains - Cassandra, Kaelbling.. (1994) (Correct)
On the Complexity of Solving Markov Decision Problems - Littman, Dean, Kaelbling (1995) (Correct)
Using Goals to Find Plans with High Expected Utility - Jak Kirman (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC