Jussi Rintanen  Home/Search
Context Related
| asu.edu/paparchive/rintanencp.ps informatik.uniulm...Rintanen98cplan.ps Cached: 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.
PS.gz PS Image Update HelpFrom: asu.edu/planningclass (more) From: informatik.uniulm...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the plans operate on. Without these assumptions the sequences of operations that achieve the goals depend on the initial state and the outcomes of nondeterministic changes in the system. This setting raises the questions of how to represent the plans and how to perform plan search. The answers are quite different from those... (Update)
Cited by: More
Fault Tolerance Analysis of Distributed.. - Feldmann, Haubelt.. (2003) (Correct)
On Computing Belief Change Operations Using Quantified.. - Delgrande, Schaub, al. (Correct)
On Quantified Weighted MAX-SAT - Mali (Correct)
Active bibliography (related documents): More All
0.1: Constructing Conditional Plans by a Theorem-Prover - Rintanen (1999) (Correct)
0.0: A Logic Programming Approach to Knowledge-State Planning: . . . - Eiter, Faber, al. (2001) (Correct)
0.0: Linear Time Logic, Conditioned Models and Planning with.. - Mayer, Limongelli (Correct)
Similar documents based on text: More All
0.4: Reconfigurable Interconnect Synthesis via.. - Siva, Vemuri.. (2002) (Correct)
0.3: Complexity of Planning with Partial Observability - Rintanen (2004) (Correct)
0.2: Polynomial-Length Planning Spans the Polynomial Hierarchy - Turner (2001) (Correct)
Related documents from co-citation: More All
17: Conformant graphplan (context) - Smith, Weld - 1998
15: Conformant planning via symbolic model checking - Cimatti, Roveri - 2000
14: Conditional nonlinear planning - Peot, Smith - 1992
BibTeX entry: (Update)
J Rintanen. Constructing conditional plans by a theorem prover. Journal of AI research (submitted), 1999. http://citeseer.ist.psu.edu/article/rintanen99constructing.html More
@article{ rintanen99constructing,
author = "Jussi Rintanen",
title = "Constructing Conditional Plans by a Theorem-Prover",
journal = "Journal of Artificial Intelligence Research",
volume = "10",
pages = "323-352",
year = "1999",
url = "citeseer.ist.psu.edu/article/rintanen99constructing.html" }
Citations (may not include all citations):510 Symbolic Boolean manipulation with ordered binary decision d.. - Bryant - 1992
390 A machine program for theorem proving (context) - Davis, Logemann et al. - 1962
376 Fast planning through planning graph analysis - Blum, Furst - 1997
272 Pushing the envelope: planning - Kautz, Selman - 1996
226 Systematic nonlinear planning - McAllester, Rosenblitt - 1991
167 Structural Complexity (context) - Balc'azar, D'iaz et al. - 1995
163 Application of theorem-proving to problem solving (context) - Green - 1969
145 Planning as satisfiability - Kautz, Selman - 1992
140 Conditional nonlinear planning - Peot, Smith - 1992
72 Heuristics based on unit propagation for satisfiability prob.. - Li, Anbulagan - 1997
64 Planning for contingencies: A decision-based approach - Pryor, Collins - 1996
51 Automatic OBDD-based generation of universal plans in non-de.. - Cimatti, Roveri et al. - 1998
44 Conformant Graphplan (context) - Smith, Weld - 1998
42 Plan synthesis: A logical perspective (context) - Rosenschein - 1981
35 Improvements to the evaluation of quantified Boolean formula.. - Rintanen - 1999
31 Complexity results for SAS + planning (context) - Backstrom, Nebel - 1995
1 Improvements to Propositional Satisfiability Search Algorith.. (context) - the, -- - 1995
1 An algorithm to evaluate quantified Boolean formulae (context) - Intelligence, -- et al. - 1998
1 Inferring state constraints for domain-independent planning (context) - thesis, Pennsylvania et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://rakaposhi.eas.asu.edu/planning-class.html): More
A Heuristic Estimator for Means-Ends Analysis in Planning - Drew McDermott (1996) (Correct)
Encoding Plans in Propositional Logic - Kautz, McAllester, Selman (1996) (Correct)
Using CSP Look-Back Techniques to Solve Real-World SAT Instances - Bayardo, Schrag (1997) (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