Recent advances in AI planning (Durham, 8-10 September 1999)Biundo, Susanne; Fox, Maria.Lecture notes in computer science. 2000, issn 0302-9743, isbn 3-540-67866-2, 372 p., isbn 3-540-67866-2Conference Proceedings

Action constraints for planningSCHOLZ, U.Lecture notes in computer science. 2000, pp 148-158, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Deductive synthesis of recursive plans in linear logicCRESSWELL, S; SMAILL, A; RICHARDSON, J et al.Lecture notes in computer science. 2000, pp 252-264, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Planning as heuristic search : New resultsBONET, B; GEFFNER, H.Lecture notes in computer science. 2000, pp 360-372, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Scaleability in planningLIATSOS, V; RICHARDS, B.Lecture notes in computer science. 2000, pp 49-61, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Planning as Model CheckingGIUNCHIGLIA, F; TRAVERSO, P.Lecture notes in computer science. 2000, pp 1-20, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Hierarchical task network planning as satisfiabilityAMOL DATTATRAYA MALI.Lecture notes in computer science. 2000, pp 122-134, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Exploiting competitive planner performanceHOWE, A. E; DAHLMAN, E; HANSEN, C et al.Lecture notes in computer science. 2000, pp 62-72, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Integer programs and valid inequalities for planning problemsBOCKMAYR, A; DIMOPOULOS, Y.Lecture notes in computer science. 2000, pp 239-251, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Least commitment on variable binding in presence of incomplete knowledgeBARRUFFI, R; LAMMA, E; MELLO, P et al.Lecture notes in computer science. 2000, pp 159-171, issn 0302-9743, isbn 3-540-67866-2Conference Paper

SAT-based procedures for temporal reasoningARMANDO, A; CASTELLINI, C; GIUNCHIGLIA, E et al.Lecture notes in computer science. 2000, pp 97-108, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Sensor planning with non-linear utility functionsKOENIG, S; YAXIN LIU.Lecture notes in computer science. 2000, pp 265-277, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Strong cyclic planning revisitedDANIELE, M; TRAVERSO, P; VARDI, M. Y et al.Lecture notes in computer science. 2000, pp 35-48, issn 0302-9743, isbn 3-540-67866-2Conference Paper

What is the expressive power of disjunctive preconditions?NEBEL, B.Lecture notes in computer science. 2000, pp 294-307, issn 0302-9743, isbn 3-540-67866-2Conference Paper

A parallel algorithm for POMDP solutionPYEATT, L. D; HOWE, A. E.Lecture notes in computer science. 2000, pp 73-83, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Making Graphplan goal-directedPARKER, E.Lecture notes in computer science. 2000, pp 333-346, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Greedy algorithms for the multi-capacitated Metric Scheduling problemCESTA, A; ODDI, A; SMITH, S. F et al.Lecture notes in computer science. 2000, pp 213-225, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Probabilistic planning in the Graphplan frameworkBLUM, A. L; LANGFORD, J. C.Lecture notes in computer science. 2000, pp 319-332, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Automata-theoretic approach to planning for temporally extended goalsDE GIACOMO, G; VARDI, M. Y.Lecture notes in computer science. 2000, pp 226-238, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Plan merging & plan reuse as satisfiabilityAMOL DATTATRAYA MALI.Lecture notes in computer science. 2000, pp 84-96, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Conformant planning via model checkingCIMATTI, A; ROVERI, M.Lecture notes in computer science. 2000, pp 21-34, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Scaling up planning by teasing out resource schedulingSRIVASTAVA, B; KAMBHAMPATI, S.Lecture notes in computer science. 2000, pp 172-186, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Some results on the complexity of Planning with incomplete informationHASLUM, P; JONSSON, P.Lecture notes in computer science. 2000, pp 308-318, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Numeric state variables in constraint-based planningRINTANEN, J; JUNGHOLT, H.Lecture notes in computer science. 2000, pp 109-121, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Task decomposition support to reactive schedulingDRABBLE, B.Lecture notes in computer science. 2000, pp 200-212, issn 0302-9743, isbn 3-540-67866-2Conference Paper