Admissible Heuristics for Automated Planning

The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities ...

[1]  Roman Barták.  Integrating Planning into Production Scheduling : A Formal View , 2004 .

[2]  Pär J. Ågerfalk.  Information Systems Actability: Understanding Information Technology as a Tool for Business Action and Communication , 2003 .

[3]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[4]  Patrick Doherty,et al.  TALplanner: A temporal logic based forward chaining planner , 2001, Annals of Mathematics and Artificial Intelligence.

[5]  Magnus Kald.  In the borderland between strategy and management control : theoretical framework and empirical evidence , 2004 .

[6]  Maria Fox,et al.  The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.

[7]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Resultsfor Domain-Independent Planning: A Detailed Analysis , 1998 .

[8]  Austin Tate,et al.  O-Plan2: an Open Architecture for Command, Planning and Control , 2006 .

[9]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[10]  Staffan Bonnier,et al.  A formal basis for horn clause logic with external polymorphic functions , 1992 .

[11]  Yuxiao Zhao,et al.  Standards-based application integration for business-to-business communications , 2005 .

[12]  Joakim Gustafsson,et al.  Extending temporal action logic , 2001 .

[13]  Fahiem Bacchus,et al.  Using temporal logic to control search in a forward chaining planner , 1996 .

[14]  John Gaschnig,et al.  A Problem Similarity Approach to Devising Heuristics: First Results , 1979, IJCAI.

[15]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[16]  Dimiter Driankov,et al.  Towards a many‐valued logic of quantified belief: The information lattice , 1991 .

[17]  Erland Jungert,et al.  Synthesizing database structures from a user oriented data model , 1980 .

[18]  Paul W. H. Chung,et al.  AI planning: solutions for real world problems , 2000, Knowl. Based Syst..

[19]  Armand Prieditis.  Machine discovery of effective admissible heuristics , 2004, Machine Learning.

[20]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

[21]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[22]  Hector Geffner,et al.  Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..

[23]  Zebo Peng.  A formal methodology for automated synthesis of VLSI systems , 1987 .

[24]  Johan Åberg,et al.  Live help systems : an approach to intelligent help for Web information systems , 2002 .

[25]  J. Skåmedal.  Telecommuting's implications on travel and travel patterns , 2004 .

[26]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[27]  David Furcy,et al.  Multiple Pattern Databases , 2004, ICAPS.

[28]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[29]  Diana Szentiványi.  Performance Studies of Fault-Tolerant Middleware , 2005 .

[30]  Ulf Melin.  Koordination och informationssystem i företag och nätverk , 2002 .

[31]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

[32]  Erik Sandewall,et al.  A Representation of Action Structures , 1986, AAAI.

[33]  S. Kambhampati,et al.  Optiplan: Unifying IP-based and Graph-based Planning , 2005, J. Artif. Intell. Res..

[34]  Mikael Kindborg,et al.  Concurrent comics : programming of social agents by children , 2003 .

[35]  Jonas Mellin,et al.  Resource-Predictable and Efficient Monitoring of Events , 2004 .

[36]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[37]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[38]  Richard E. Korf,et al.  Finding Optimal Solutions to the Twenty-Four Puzzle , 1996, AAAI/IAAI, Vol. 2.

[39]  Vanja Josifovski,et al.  Design, implementation and evaluation of a distributed mediator system for data integration , 1999 .

[40]  Ji-Ae Shin,et al.  Processes and continuous change in a SAT-based planner , 2005, Artif. Intell..

[41]  Ulf Nilsson,et al.  Abstract Interpretation & Abstract Machines: Contribution to a Methodology for the Implementation of Logic Programs , 1992 .

[42]  Peter Bunus,et al.  Debugging techniques for equation-based languages , 2004 .

[43]  Claudiu Duma,et al.  Security and trust mechanisms for groups in distributed services , 2005 .

[44]  Erik G. Larsson,et al.  An Integrated System-Level Design for Testability Methodology , 2000 .

[45]  Martin Skold.  Active Database Management Systems for Monitoring and Control , 1997 .

[46]  Osten Oskarsson,et al.  Mechanisms of modifiability in large software systems , 1982 .

[47]  Drew McDermott,et al.  Using Regression-Match Graphs to Control Search in Planning , 1999, Artif. Intell..

[48]  Christer Backstrom,et al.  Computational Complexity of Reasoning about Plans , 1992 .

[49]  Man Lin.  Analysis and synthesis of reactive systems : a generic layered architecture perspective , 1999 .

[50]  Ling Lin,et al.  Management of 1-D Sequence Data- From Discrete to Continuous , 1999 .

[51]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.

[52]  Patrik Haslum,et al.  New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.

[53]  Malte Helmert,et al.  A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.

[54]  Ewa Braf,et al.  Knowledge demanded for action : studies of knowledge mediation in organisations , 2004 .

[55]  Thomas Schiex,et al.  Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.

[56]  Jaak Urmi.  A machine independent LISP compiler and its implications for ideal hardware , 1978 .

[57]  Johan Moe.  Observing the dynamic behaviour of large distributed systems to improve development and testing : an empirical study in software engineering , 2003 .

[58]  Peter Ambjorn Fritzson,et al.  Towards a distributed programming environment based on incremental compilation (debugging, prettyprinting, interactive) , 1984 .

[59]  Marcus Bjäreland.  Model-based execution monitoring , 2001 .

[60]  Daniel S. Weld,et al.  The LPSAT Engine & Its Application to Resource Planning , 1999, IJCAI.

[61]  Rita Kovordanyi,et al.  Modeling and simulating inhibitory mechanisms in mental image reinterpretation : towards cooperative human-computer creativity , 1999 .

[62]  Dan Lawesson.  An Approach to Diagnosability Analysis for Interacting Finite State Systems , 2005 .

[63]  Patrik Haslum,et al.  A Distributed Architecture for Intelligent Unmanned Aerial Vehicle Experimentation , 2004 .

[64]  Jörgen Hansson,et al.  Value-driven multi-class overload management in real-time database systems , 1999 .

[65]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[66]  Arne Jönsson,et al.  Dialogue management for natural language interfaces - an empirical approach , 1993, Linköping studies in science and technology dissertations.

[67]  Bourhane Kadmiry,et al.  Fuzzy gain scheduled visual servoing for an unmanned helicopter , 2005 .

[68]  Anders Haraldsson.  A program manipulation system based on partial evaluation , 1977 .

[69]  Christina Ölvingson,et al.  On development of information systems with GIS functionality in public health informatics : a requirements engineering approach , 2003 .

[70]  Austin Tate,et al.  The Use of Condition Types to Restrict Search in an AI Planner , 1994, AAAI.

[71]  Mattias Arvola,et al.  Shades of Use: The Dynamics of Interaction Design for Sociable Use , 2005 .

[72]  Hans Olsen,et al.  Automatic Verification of Petri Nets in a CLP Framework , 1997 .

[73]  Tom Bylander,et al.  A Probabilistic Analysis of Propositional STRIPS Planning , 1996, Artif. Intell..

[74]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[75]  Ioannis P. Vlahavas,et al.  Multiobjective heuristic state-space planning , 2003, Artif. Intell..

[76]  Malik Ghallab,et al.  Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.

[77]  Rego Granlund,et al.  Monitoring distributed teamwork training , 2002 .

[78]  Bernhard Nebel,et al.  On the Compilability and Expressive Power of Propositional Planning Formalisms , 2000, J. Artif. Intell. Res..

[79]  Hermann Kaindl,et al.  Bidirectional Heuristic Search Reconsidered , 1997, J. Artif. Intell. Res..

[80]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[81]  Alexander Nareyek.  Beyond the Plan-Length Criterion , 2000, Local Search for Planning and Scheduling.

[82]  Zhiping Wang.  Capacity-constrained production-inventory systems : modelling and analysis in both a traditional and an e-business context , 2004 .

[83]  Malte Helmert,et al.  Decidability and Undecidability Results for Planning with Numerical State Variables , 2002, PuK.

[84]  Austin Tate,et al.  O Plan an Open Architecture for Command Planning and Control , 2006 .

[85]  Magnus Bång.  Computing at the speed of paper : ubiquitous computing environments for healthcare professionals , 2004 .

[86]  Anneli Hagdahl,et al.  Development of IT-supported Inter-organisational Collaboration: A Case Study in the Swedish Public Sector , 2002 .

[87]  Choong-ho Yi,et al.  Modelling object-oriented dynamic systems using a logic-based framework , 2002 .

[88]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[89]  Jonathan Schaeffer,et al.  Best-First Fixed-Depth Minimax Algorithms , 1996, J. Int. Comput. Games Assoc..

[90]  Mikael Lind,et al.  Från system till process kriterier för processbestämning vid verksamhetsanalys , 2001 .

[91]  Paul W. H. Chung,et al.  AI Planning in a Chemical Plant Domain , 1998, ECAI.

[92]  Bernhard Nebel,et al.  In Defense of PDDL Axioms , 2003, IJCAI.

[93]  James F. Allen,et al.  Planning Using a Temporal World Model , 1983, IJCAI.

[94]  Lars Degerstedt,et al.  Tabulation-based Logic Programming : A Multi-level View of Query Answering , 1996 .

[95]  Blai Bonet,et al.  An Algorithm Better than AO*? , 2005, AAAI.

[96]  Stefan Holgersson,et al.  Yrke: POLIS : Yrkeskunskap, motivation, IT-system och andra förutsättningar för polisarbete , 2005 .

[97]  Bengt Johnsson,et al.  The human-computer interface in commercial systems : Investigations of dialogue design factors and usability with alphanumeric display terminals , 1981 .

[98]  Patrik Haslum,et al.  Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition , 2011, J. Artif. Intell. Res..

[99]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[100]  James A. Hendler,et al.  HTN Planning: Complexity and Expressivity , 1994, AAAI.

[101]  Steven A. Vere,et al.  Planning in Time: Windows and Durations for Activities and Goals , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[102]  Patrik Haslum.  Improving Heuristics Through Search , 2004, ECAI.

[103]  Jorg Homann.  A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm , 2000 .

[104]  Pär Emanuelson,et al.  Performance enhancement in a well-structured pattern matcher through partial evaluation , 1980 .

[105]  Jonathan Schaeffer,et al.  Sokoban: Enhancing general single-agent search methods using domain knowledge , 2001, Artif. Intell..

[106]  Lin Padgham,et al.  Non-monotonic inheritance for an object-oriented knowledge-base , 1989 .

[107]  Tristan Cazenave.  Iterative Widening , 2001, IJCAI.

[108]  Patrik Haslum,et al.  Domain Knowledge in Planning : Representation and Use , 2003 .

[109]  Olof Johansson.  Development environments for complex product models , 1996 .

[110]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[111]  Sorin Manolache,et al.  Analysis and Optimisation of Real-Time Systems with Stochastic Behaviour , 2005 .

[112]  Robert C. Holte,et al.  Hierarchical A*: Searching Abstraction Hierarchies Efficiently , 1996, AAAI/IAAI, Vol. 1.

[113]  S. Kambhampati.  Appears in the working notes of AAAI-94 Workshop on Comparative Analysis of Planning Systems Comparing Partial Order Planning and Task Reduction Planning : A preliminary report , 1994 .

[114]  Sofie Pilemalm,et al.  Information Technology for Non-Profit Organisations: Extended Participatory Design of an Information System for Trade Union Shop Stewards , 2002 .

[115]  Paul Pop,et al.  Analysis and Synthesis of Communication-Intensive Heterogeneous Real-Time Systems , 2003 .

[116]  Zohar Manna,et al.  How to clear a block: A theory of plans , 2004, Journal of Automated Reasoning.

[117]  Asmus Pandikow,et al.  A Generic Principle for Enabling Interoperability of Structured and Object-Oriented Analysis and Design Tools , 2002 .

[118]  Albert N. Badre,et al.  Designing the Human-Computer Interface , 1982, CHI '82.

[119]  Magnus Merkel,et al.  Understanding and enhancing translation by parallel text processing , 1999 .

[120]  Malin Nordström,et al.  Styrbar systemförvaltning : att organisera systemförvaltningsverksamhet med hjälp av effektiva förvaltningsobjekt , 2005 .

[121]  Sture Hägglund,et al.  Contributions to the development of methods and tools for interactive design of applications software , 1980 .

[122]  Robert C. Holte,et al.  Experiments with Automatically Created Memory-Based Heuristics , 2000, SARA.

[123]  Linda Askenäs,et al.  The roles of IT : studies of organising when implementing and using enterprise systems , 2004 .

[124]  Anthony Barrett,et al.  Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.

[125]  Edwin P. D. Pednault,et al.  Synthesizing plans that contain actions with context‐dependent effects 1 , 1988, Comput. Intell..

[126]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[127]  Aseel Berglund,et al.  Augmenting the Remote Control: Studies in Complex Information Navigation for Digital TV , 2004 .

[128]  Anders Arpteg,et al.  Intelligent Semi-Structured Information Extraction , 2005 .

[129]  Nils J. Nilsson,et al.  Searching problem-solving and game-playing trees for minimal cost solutions , 1968, IFIP Congress.

[130]  Subbarao Kambhampati,et al.  Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..

[131]  Henryk Jan Komorowski,et al.  A specification of an abstract Prolog machine and its application to partial evaluation , 1981 .

[132]  Eva L. Ragnemalm,et al.  Student modelling based on collaborative dialogue with a learning companion , 1999 .

[133]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

[134]  Ivan Serina,et al.  LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.

[135]  Maria Fox,et al.  The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..

[136]  Eric A. Hansen,et al.  BFHSP : A Breadth-First Heuristic Search Planner , 2004 .

[137]  Vivian Vimarlund,et al.  An economic perspective on the analysis of impacts of information technology : from case studies in health-care towards general models and theories , 1999 .

[138]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

[139]  David E. Smith,et al.  Compiling Planning into Scheduling: A Sketch , 2004 .

[140]  Paul Scerri,et al.  Designing agents for systems with adjustable autonomy , 2001 .

[141]  Vadim Engelson,et al.  Tools for design, interactive simulation, and visualization of object-oriented models in scientific computing , 2000 .

[142]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[143]  Giovanni Manzini,et al.  BIDA: An Improved Perimeter Search Algorithm , 1995, Artif. Intell..

[144]  Jonas Hallberg,et al.  Timing issues in high-level synthesis , 1998 .

[145]  Anette Moberg.  Närhet och distans : studier av kommunikationsmönster i satellitkontor och flexibla kontor , 1997 .

[146]  Philippe Laborie.  IxTeT : une approche intégrée pour la gestion de ressources et la synthèse de plans , 1995 .

[147]  Mark A. Peot,et al.  Threat-Removal Strategies for Partial-Order Planning , 1993, AAAI.

[148]  Cedwall Mats.  Semantisk analys av processbeskrivningar i naturligt språk , 1977 .

[149]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[150]  Michael Beetz.  Plan Representation for Robotic Agents , 2002, AIPS.

[151]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[152]  Jaime Villegas,et al.  Simulation supported industrial training from an organisational learning perspective : development and evaluation of the SSIT method , 1996 .

[153]  C. Levcopoulos.  Heuristics for minimum decompositions of polygons , 1987 .

[154]  Richard E. Korf,et al.  Additive Pattern Database Heuristics , 2004, J. Artif. Intell. Res..

[155]  Nahid Shahmehri,et al.  Generalized algorithmic debugging , 1991 .

[156]  Ulf Seigerroth,et al.  Att förstå och förändra systemutvecklingsverksamheter en taxonomi för metautveckling , 2003 .

[157]  Tobias Ritzau,et al.  Memory Efficient Hard Real-Time Garbage Collection , 2003 .

[158]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[159]  Håkan L. S. Younes,et al.  On the Role of Ground Actions in Refinement Planning , 2002, AIPS.

[160]  Karin Axelsson.  Metodisk systemstrukturering : att skapa samstämmighet mellan informationssystemarkitektur och verksamhet , 1998 .

[161]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[162]  Stefan Edelkamp,et al.  Automated Planning: Theory and Practice , 2007, Künstliche Intell..

[163]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[164]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[165]  Pernilla Qvarfordt,et al.  Eyes on multimodal interaction , 2004 .

[166]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[167]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.

[168]  Steve Hanks,et al.  Optimal Planning with a Goal-directed Utility Model , 1994, AIPS.

[169]  Henrik Nilsson,et al.  Declarative debugging for lazy functional languages , 1998 .

[170]  John K. Slaney,et al.  Blocks World revisited , 2001, Artif. Intell..

[171]  Matthew L. Ginsberg,et al.  Iterative Broadening , 1990, Artif. Intell..

[172]  Alex Fukunaga,et al.  ASPEN: A Framework for Automated Planning and Scheduling of Spacecraft Control and Operations , 1997 .

[173]  Carl-Johan Petri,et al.  Organizational information provision : managing mandatory and discretionary utilization of information technology , 2001 .

[174]  Karin Hedström,et al.  Spår av datoriseringens värden: Effekter av IT i äldreomsorg , 2004 .

[175]  Romain Trinquart.  Analyzing Reachability within Plan Space , 2003 .

[176]  Anders Avdic,et al.  Användare och utvecklare : om anveckling med kalkylprogram , 2001 .

[177]  Tore Risch,et al.  Compilation of multiple file queries in a meta-database system , 1978 .

[178]  Mikael Cäker,et al.  Management accounting as constructing and opposing customer focus : three case studies on management accounting and customer relations , 2005 .

[179]  Hector Geffner,et al.  Branching Matters: Alternative Branching in Graphplan , 2003, ICAPS.

[180]  Stefan Holmlid,et al.  Adapting users : towards a theory of use quality , 2002 .

[181]  Ulrich Scholz.  Extracting State Constraints from PDDL-like Planning Domains , 2000 .

[182]  Jj Org Hoomann.  A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm , 2000 .

[183]  P. Doherty.  NML3 : a non-monotonic formalism with explicit defaults , 1991 .

[184]  Ola Angelsmark.  Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications , 2005 .

[185]  Stefan Edelkamp,et al.  Towards Realistic Benchmarks for Planning: the Domains Used in the Classical Part of IPC-4 , 2004 .

[186]  Tim Heyer,et al.  Semantic Inspection of Software Artifacts From Theory to Practice , 2001 .

[187]  Fredrik Karlsson,et al.  Method configuration: method and computerized tool support , 2005 .

[188]  Jörgen Lindström,et al.  Does distance matter? On geographical dispersion in organisations , 1999 .

[189]  Stephen F. Smith,et al.  Mixed-Initiative Resource Management: The AMC Barrel Allocator , 2000, AIPS.

[190]  Fredrik Nilsson.  Strategi och ekonomisk styrning : en studie av hur ekonomiska styrsystem utformas och används efter företagsförvärv , 1997 .

[191]  Daniel S. Weld,et al.  Temporal Planning with Continuous Change , 1994, AAAI.

[192]  Niklas Hallberg,et al.  Incorporating user values in the design of information systems and services in the public sector : a methods approach , 1999 .

[193]  David E. Wilkins,et al.  Representation in a Domain-Independent Planner , 1983, IJCAI.

[194]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

[195]  David Furcy,et al.  Speeding up the calculation of heuristics for heuristic search-based planning , 2002, AAAI/IAAI.

[196]  René Reboh.  Knowledge engineering techniques and tools for expert systems , 1981 .

[197]  Owen Eriksson.  Kommunikationskvalitet hos informationssystem och affärsprocesser , 2000 .

[198]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[199]  James A. Hendler,et al.  AI Planning: Systems and Techniques , 1990, AI Mag..

[200]  Johan Fagerström,et al.  A paradigm and system for design of distributed systems , 1988 .

[201]  Mathias Broxvall,et al.  A Study in the Computational Complexity of Temporal Reasoning , 2002 .

[202]  Annika Flycht-Eriksson,et al.  Design and use of ontologies in information-providing dialogue systems , 2004 .

[203]  Richard E. Korf,et al.  Compressing Pattern Databases , 2004, AAAI.

[204]  Subbarao Kambhampati,et al.  Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.

[205]  Jimmy Tjäder,et al.  Systemimplementering i praktiken : en studie av logiker i fyra projekt , 1999 .

[206]  Federico Barber,et al.  Integrating planning and scheduling , 2001, Appl. Artif. Intell..

[207]  Simin Nadjm-Tehrani,et al.  Algorithms and Complexity for Temporal and Spatial Formalisms , 2007 .

[208]  Mikael Ronström,et al.  Design and Modelling of a Parallel Data Server for Telecom Applications , 2004 .

[209]  Nicola Muscettola,et al.  Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[210]  Gert Jervan,et al.  Hybrid Built-In Self-Test and Test Generation Techniques for Digital Systems , 2005 .

[211]  Mikael Lindvall,et al.  An Empirical Study of Requirements-Driven Impact Analysis in Object-Oriented Software Evolution , 1997 .

[212]  Mikael Pettersson,et al.  Compiling Natural Semantics , 1999, Lecture Notes in Computer Science.

[213]  ComplexityPeter Jonsson,et al.  Studies in Action Planning Algorithms and Complexity , 2007 .

[214]  Michael Grüninger,et al.  A generic enterprise resource ontology , 1994, Proceedings of 3rd IEEE Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises.

[215]  Jana Koehler,et al.  Handling of Inertia in a Planning System , 1999 .

[216]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[217]  Stefan Edelkamp,et al.  Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.

[218]  Erik Anders Tengvald,et al.  The design of expert planning systems: an experimental operations planning system for turning , 1984 .

[219]  Erik Berglund,et al.  Library Communication Among Programmers Worldwide , 2002 .

[220]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[221]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[222]  Björn Johansson.  Joint control in dynamic situations , 2005 .

[223]  Maria Fox,et al.  Utilizing Automatically Inferred Invariants in Graph Construction and Search , 2000, AIPS.

[224]  Lenhart K. Schubert,et al.  Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.

[225]  Tom Bylander,et al.  Complexity Results for Planning , 1991, IJCAI.

[226]  Stephen F. Smith,et al.  An Ontology for Constructing Scheduling Systems , 1997 .

[227]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[228]  Dana S. Nau,et al.  On the Complexity of Blocks-World Planning , 1992, Artif. Intell..

[229]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

[230]  Luis Alejandro Cortés,et al.  Verification and Scheduling Techniques for Real-Time Embedded Systems , 2005 .

[231]  Kjell Orsborn,et al.  On Extensible and Object-Relational Database Technology for Finite Element Analysis Applications , 1996 .

[232]  Juha Takkinen,et al.  From information management to task management in electronic mail , 2002 .

[233]  Pawel Pietrzak,et al.  A type-based framework for locating errors in constraint logic programs , 2002 .

[234]  C. Curescu,et al.  Utility-based Optimisation of Resource Allocation for Wireless Networks , 2005 .

[235]  Stefan Cronholm,et al.  Metodverktyg och användbarhet : en studie av datorstödd metodbaserad systemutveckling , 1998 .

[236]  Anders Lindström,et al.  English and other foreign linguistic elements in spoken Swedish : studies of productive processes and their modelling using finite-state tools , 2004 .

[237]  Alexander Reinefeld,et al.  Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[238]  Peter C. Nelson,et al.  Perimeter Search , 1994, Artif. Intell..

[239]  Jonas Kvarnström,et al.  TALplanner and Other Extensions to Temporal Action Logic , 2005 .

[240]  David E. Wilkins,et al.  Can AI planners solve practical problems? , 1990, Comput. Intell..

[241]  Erik Herzog,et al.  An approach to systems engineering tool data representation and exchange , 2004 .

[242]  Amedeo Cesta,et al.  Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.

[243]  Subbarao Kambhampati,et al.  Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..

[244]  Silvia Coradeschi,et al.  Anchoring symbols to sensory data , 1999 .

[245]  Jonathan Schaeffer,et al.  Best-First Fixed-Depth Minimax Algorithms , 1996, J. Int. Comput. Games Assoc..

[246]  David E. Wilkins,et al.  A Call for Knowledge-Based Planning , 2001, AI Mag..

[247]  Ioannis P. Vlahavas,et al.  GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables , 1999, ECP.

[248]  Jussi Rintanen,et al.  A Planning Algorithm not based on Directional Search , 1998, KR.

[249]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[250]  Joachim Karlsson,et al.  A systematic approach for prioritizing software requirements , 1998 .

[251]  Mikael Ericsson,et al.  Supporting the use of design knowledge : an assessment of commenting agents , 1999 .

[252]  Pär Carlshamre,et al.  A usability perspective on requirements engineering : from methodology to product development , 2001 .

[253]  Marco Valtorta,et al.  A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm , 1983, IJCAI.

[254]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.

[255]  Wheeler Ruml,et al.  On-line Planning and Scheduling for High-speed Manufacturing , 2005, ICAPS.

[256]  Mariam Kamkar,et al.  Interprocedural dynamic slicing with applications to debugging and testing , 1993, Linköping studies in science and technology dissertations.

[257]  Per-Arne Persson,et al.  Bringing power and knowledge together: information systems design for autonomy and control in command work , 2000 .

[258]  Jonathan Schaeffer,et al.  Dual Lookups in Pattern Databases , 2005, IJCAI.

[259]  Subbarao Kambhampati,et al.  Scaling up Planning by Teasing out Resource Scheduling , 1999, ECP.

[260]  Jonathan Schaeffer,et al.  Searching with Pattern Databases , 1996, Canadian Conference on AI.

[261]  Lars Taxén,et al.  A Framework for the Coordination of Complex Systems' Development , 2003 .

[262]  Johan Jenvald.  Methods and tools in computer-supported taskforce training , 1999 .