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

Generalizing the relaxed planning heuristic to non-linear tasksEDELKAMP, Stefan.Lecture notes in computer science. 2004, pp 198-212, issn 0302-9743, isbn 3-540-23166-8, 15 p.Conference 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

Exhibiting knowledge in planning problems to minimize state encoding lengthEDELKAMP, S; HELMERT, M.Lecture notes in computer science. 2000, pp 135-147, 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

KI 2004 : advances in artificial intelligence (Ulm, 20-24 September 2004)Biundo, Susanne; Frühwirth, Thom; Palm, Günther et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23166-8, XI, 465 p, isbn 3-540-23166-8Conference Proceedings

Action constraints for planningSCHOLZ, U.Lecture notes in computer science. 2000, pp 148-158, 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

Machine learning for autonomous robotsRIEDMILLER, Martin.Lecture notes in computer science. 2004, pp 52-55, issn 0302-9743, isbn 3-540-23166-8, 4 p.Conference Paper

Default reasoning over domains and concept hierarchiesHITZLER, Pascal.Lecture notes in computer science. 2004, pp 351-365, issn 0302-9743, isbn 3-540-23166-8, 15 p.Conference 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

Generation of sentence parse trees using parts of speechGÜNGÖR, Tunga.Lecture notes in computer science. 2004, pp 56-66, issn 0302-9743, isbn 3-540-23166-8, 11 p.Conference 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

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

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

An overview of planning technology in roboticsGHALLAB, Malik.Lecture notes in computer science. 2004, pp 29-49, issn 0302-9743, isbn 3-540-23166-8, 21 p.Conference Paper

Automated reasoning tools for molecular biologyFAGES, Francois.Lecture notes in computer science. 2004, pp 1-2, issn 0302-9743, isbn 3-540-23166-8, 2 p.Conference Paper

Integration of statistical and neural methods to design classifiers in case of unequal covariance matricesRAUDYS, Sarunas.Lecture notes in computer science. 2004, pp 270-280, issn 0302-9743, isbn 3-540-23166-8, 11 p.Conference 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

GRT : A domain independent heuristic for STRIPS worlds based on Greedy Regression TablesREFANIDIS, I; VLAHAVAS, I.Lecture notes in computer science. 2000, pp 347-359, issn 0302-9743, isbn 3-540-67866-2Conference Paper