Back Article

1Allen J.F. and Koomen J.A. (1983) “Planning Using a Temporal World Model”, IJCAI-83, pp 741–747, Karlsruhe, West Germany. (TIMELOGIC)

[2]Appelt D.E. (1985) “Planning English Referring Expressions”, Artificial Intelligence, 26, pp 1–33. (KAMP)

3Bell C.E. and Tate A. (1985) “Using Temporal Constraints to Restrict Search in a Planner” Proceedings of the Third Workshop of the Alvey IKBS Programme Planning Special Interest Group, Sunningdale, Oxfordshire, UK, April 1985. Available through the Institute of Electrical Engineers, London, UK (O-PLAN)

4Bresina J.L. (1981) “An Interactive Planner that Creates a Structured Annotated Trace of its Operation”, Rutgers University, Computer Science Research Laboratory, Report CBM-TR-123. (PLANX-10)

[5]Corkill D.D. (1979) “Hierarchical Planning in a Distributed Environment”, IJCAI-79, pp 168–756, Tokyo, Japan.

[6]Corkill D.D. and Lesser V.R. (1983) “The Use of Meta-level Control for Coordination in a Distributed Problem Solving Network”, IJCAI-83, pp 748–756, Karlsruhe, West Germany.

7Daniel L. (1983). “Planning and Operations Research”, in “Artificial Intelligence: Tools, Techniques and Applications”, Harper and Row, New York. (NONLIN)

[8]Davis R. and Smith R. (1983) “Negotiation as a Metaphor for distributed problem solving”, Artificial Intelligence, 20, pp 63–109.

9Davis P.R. and Chien R.T. (1977) “Using and Re-using Partial Plans”, IJCAI-77, Cambridge, Mass., USA.

10Dean T. (1985) “Temporal Reasoning Involving Counterfactuals and Disjunctions”, IJCAI-85, Los Angeles, Calif. (TNMS)

[11]Dershowitz N. “Synthetic programming”, Artificial Intelligence, 25, pp 323–373.

12Doran J.E. and Michie D. (1966) “Experiments with the Graph Traverser Program” Proceedings of the Royal Society, A, pp 235–259. (GRAPH TRAVERSER)

13Doran J.E. and Trayner C. (1985) “Distributed planning and Execution — Teamwork 1”, Computer Science Technical Report, University of Essex, UK (TEAMWORK)

[14]Doyle J. (1979) “A Truth maintenance System” Artificial Intelligence, 12, pp 231–272.

15Drummond M.E. (1985) “Refining and Extending the Procedural Net” IJCAI-85, Los Angeles, Calif.

16Duffay P. and Latombe J-C (1983) “An Approach to Automatic Robot Programming Based on Inductive Learning” IMAG, Grenoble, France. (TROPIC)

17Erman L.D., Hayes-Roth F., Lesser V.R. and Reddy D.R. (1980) “The HEARSAY-II speech-understanding system: Integrating Knowledge to Resolve Uncertainty” ACM Computing Surveys, 12, No. 2.

[18]Fahlman S.E. (1974) “A Planning System for Robot Construction Tasks” Artificial Intelligence, 5, pp 1–49.

19Faletti J. (1982) “PANDORA — A Program for Doing Commonsense Reasoning Planning in Complex Situations” AAAI-82, Pittsburgh, Pa., USA, 08, 1982. (PANDORA)

[20]Fikes R.E. (1970) “REF-ARF: A System for solving problems stated as Procedures” Artificial Intelligence”, 1, pp 27–120.

[21]Fikes R.E. (1982) “A Commitment-based Framework for Describing Informal Cooperative Work”, Cognitive Science, 6, pp 331–347.

[22]Fikes R.E. and Nilsson N.J. (1971) “STRIPS: a New Approach to the Application of Theorem Proving to Problem Solving”, Artificial Intelligence, 2, pp 189–208. (STRIPS)

[23]Fikes R.E., Hart P.E. and Nilsson N.J. (1972a) “Learning and Executing Generalised Robot Plans”, Artificial Intelligence, 3. (STRIPS/PLANEX)

24Fikes R.E., Hart P.E. and Nilsson N.J. (1972b) “Some New Directions in Robot Problem Solving”, in “Machine Intelligence7”, Meltzer B. and Michie D., eds., Edinburgh University Press. (STRIPS)

25Fox M.S., Allen B. and Strohm G. (1981) “Job Shop Scheduling: an Investigation in Constraint-based Reasoning”, IJCAI-81, Vancouver, British Columbia, Canada, 081981. (ISIS.II)

26Georgeff M. (1982) “Communication and Interaction in Multiagent Planning Systems”, AAAI-3.

27Georgeff M. and Lansky A. (1985) “A Procedural Logic”, IJCAI-85, Los Angeles, Calif., 081985.

28Green C.C. (1969) “Theorem Proving by Resolution as basis for Question Answering” in Machine Intelligence, 4, eds. Meltzer B. and Michie D., Edinburgh University Press.

29Hayes P.J. (1975) “A Representation for Robot Plans”, Advance papers of IJCAI-75, Tbilisi, USSR.

30Hayes-Roth B. and Hayes-Roth F. (1979) “A Cognitive Model of Planning”, Cognitive Science, pp 275–310. (OPM)

31Hayes-Roth B. (1983a) “The Blackboard Architecture: A General Framework for Problem Solving?”, Heuristic Programming Project Report No. HPP-83–30. Stanford University. 051983.

32Hayes-Roth B. (1983b) “A Blackboard Model of Control”, Heuristic Programming Project Report No. HPP-83–38. Stanford University. 061983. (OPM)

[33]Hendrix G. (1973) “Modelling Simultaneous Actions and Continuous Processes”, Artificial Intelligence, 4, pp 145–180.

[34]Kahn K. and Gorry G.A. (1977) “Mechanizing Temporal Knowledge” Artificial Intelligence, 9, pp 87–108.

35Konolige K. (1983) “A Deductive Model of belief”, IJCAI-83, pp 377–381, Karlsruhe, West Germany, 081983.

36Konolige K. and Nilsson N.J. (1980) “Multi-agent Planning Systems”, AAAI-1, pp 38–142, Stanford, Ca., USA.

37Kornfeld W.A. (1979) “ETHER: a Parallel Problem Solving System” IJCAI-79 pp 490–492, Tokyo, Japan.

38Lansky A. (1985) “Behavioral Planning for Multi-Agent Plans”, SRI AI Center Report.

39Latombe J-C. (1976) “Artificial Intelligence in Computer-aided Design — The TROPIC System”, Stanford Research Institute AI Center Technical Note 125, Menlo Park, Ca., USA.

40Lermat D.B. (1975) “BEINGS: Knowledge as Interacting Experts”, IJCAI-75, pp 126–133, Tbilisi, USSR.

41London P. (1977) “A Dependency-based Modelling Mechanism for problem solving”, Dept of Computer Science, University of Maryland, Memo. TR-589.

42Luckham D.C. and Buchanan J.R. (1974) “Automatic Generation of Programs Containing Conditional Statements”, AISB Summer Conference, University of Sussex, UK, pp 102–126, 071974.

43Masui S., McDermott J. and Sobel A. (1983) “Decision-making in Time Critical Situations”, IJCAI-83, pp 233–235, Karlsruhe, West Germany, 08, 1983. (AIRPLAN)

44McCarthy J. and Hayes P.J. (1969) “Some Philosophical Problems from the standpoint of Artificial Intelligence”, in Machine Intelligence4, ed. Meltzer B. and Michie D., Edinburgh University Press.

45McDermott D.V. (1978) “Planning and Acting”, Cognitive Science, 2.

[46]McDermott D.V. (1982) “A Temporal Logic for Reasoning about Processes and plans”, Cognitive Science, 6, pp 101–155.

47McDermott D.V. and Doyle J. (1979) “An Introduction to Nonmonotonic Logic”, IJCAI-79 pp 562–567, Tokyo, Japan.

48Mellish C.S. (1984) “Towards Top-down Generation of Multi-paragraph Text”, Proceedings of the Sixth European Conference on Artificial Intelligence, pp 229, Pisa,Italy, 091984.

49Moore R. (1980) “Reasoning about Knowledge and Action”, SRI AI Center Report No. 191.

50Mostow D.J. (1983) “A Problem Solver for Making Advice Operational”, Proc. AAAI 3, pp 179–283

51Newell A. and Simon H.A. (1963) “GPS: a Program that Simulates Human Thought”, in Feigenbaum E.A. and Feldman J. eds Comuters and Thought (McGraw-Hill, New York, 1963). (GPS)

52Reiger C. and London P. (1977) “Subgoal Protection and Unravelling During Plan Synthesis”, IJCAI-77, Cambridge, Mass., USA.

53Rich C. (1981) “A Formal Representation for Plans in the Programmer's Apprentice”, IJCAI-81 pp 1044–1052, Vancouver, British Columbia, Canada.

54Rich C., Shrobe H.E. and Waters R.C. (1979) “Overview of the Programmer's Apprentice”, IJCAI-79, pp 827–828, Tokyo, Japan.

55Rosenschein S.J. (1980) “Synchronisation of Multi-agent Plans”, AAAI-2.

56Rosenschein S.J. (1981) “Plan Synthesis; A Logical Perspective”, IJCAI-81, Vancouver, British Columbia, Canada.

57Sacerdoti E.D. (1973) “Planning in a Hierarchy of Abstraction Spaces”, Advance papers of IJCAI-73, Palo Alto, Ca., USA. (ABSTRIPS)

58Sacerdoti E.D. (1975) “The Non-linear Nature of Plans”, Advance papers of IJCAI-75, Tbilisi, USSR. (NOAH)

59Sacerdoti E.D. (1977) “A Structure for plans and Behaviour”, Elsevier-North Holland. (NOAH)

60Sacerdoti E.D. (1979) “Problem solving Tactics”, IJCAI-79, Tokyo, Japan.

61Sathi A., Fox M.S. and Greenberg M. (1985) “Representation of Activity Knowledge for Project Management” IEEE Special Issue of Transactions on Pattern Analysis and Machine Intelligence, 07, 1985. (CALLISTO)

62Schank R.C. and Abelson R.P. (1977) “Scripts, Plans, Goals and Understanding”, Lawrence Erlbaum Press, Hillsdale, New Jersey, USA.

63Siklossy L. and Roach J. (1973) “Proving the Impossible is Impossible is Possible: Disproofs based on Hereditary Partitions”, IJCAI-73, Palo Alto, Calif. (DISPROVER/LAWALY)

64Siklossy L. and Dreussi J. (1975) “An Efficient Robot Planner that Generates its own Procedures”, IJCAI-73 Palo Alto, Ca., USA. (LAWALY)

65Smith R.G. (1977) “The Contract Net: a Formalism for the Control of Distributed Problem Solving”, IJCAI-77 pp 472 Cambridge, Mass, USA.

66Smith R.G. (1979) “A Framework for Distributed Problem Solving”, IJCAI-79, Tokyo, Japan.

[67]Stallman R.M. and Sussman G.J. (1977) “Forward Reasoning and Dependency Directed Backtracking”, Artificial Intelligence, 9, pp 135–196.

68Steele G.L. and Sussman G.J. (1978) “Constraints”, MIT AI Lab Memo 502.

[69]Stefik M.J. (1981a) “Planning with Constraints”, Artificial Intelligence, 16, pp 111–140. (MOLGEN)

[70]Stefik M.J. (1981b) “Planning and Meta-planning”, Artificial Intelligence, 16, pp 141–169. (MOLGEN)

71Sussman G.A. (1973) “A Computational Model of Skill Acquisition”, M.I.T. AI Lab. memo no. AI-TR-297. (HACKER)

72Tate A. (1975) “Interacting Goals and Their Use”, IJCAI-75, pp 215–218, Tbilisi, USSR. (INTERPLAN)

73Tate A. (1976) “Project Planning Using a Hierarchical Non-linear Planner”, Dept. of Artificial Intelligence Report 25, Edinburgh University. (NONLIN)

74Tate A. (1977) “Generating Project Networks”, IJCAI-77, Boston, Ma., USA. (NONLIN)

75Tate A. (1984a) “Planning and Condition Monitoring in a FMS”, International Conference on Flexible Automation Systems”,Institute of Electrical Engineers,London, UKJuly 1984. (NONLIN)

76Tate A. (1984b) “Goal Stucture: Capturing the Intent of Plans”, European Conference on Artificial Intelligence,Pisa,Italy,September 1984. (NONLIN)

77Tate A. and Whiter A.M. (1984) “Planning with Multiple Resource Constraints and an Application to a Naval Planning Problem”, First Conference on the Applications of Artificial Intelligence,Denver,Colorado, USA.December 1984. (NONLIN)

78Vere S. (1983) “Planning in Time: Windows and Durations for Activities and Goals”, IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-5, No. 3, pp. 246–267, 051983. (DEVISER)

79Vilain M.B. (1980) “A System for Reasoning about Time”, AAAI-2.

80Waldinger R. (1975) “Achieving Several Goals Simultaneously”, SRI AI Center Technical Note 107, SRI, Menlo Park, Ca., USA.

81Warren D.H.D. (1974) “WARPLAN: a System for Generating Plans”, Dept. of Computational Logic Memo 76. Artificial Intelligence, Edinburgh University. (WARPLAN)

82Warren D.H.D. (1976) “Generating conditional plans and programs”, Proceedings of the AISB Summer Conference, pp 344–354, University of Edinburgh,UK,July 1976. (WARPLAN-C)

83Wilensky R. (1978) “Understanding Goal-based Stories”, Dept. of Computer Science, Yale Unviersity, Research Report No. 140.

[84]Wilensky R. (1981a) “Meta-planning: Representing and Using Knowledge about planning in Problem Solving and Natural Language understanding”, Cognitive Science, 5, pp 197–233.

85Wilensky R. (1981b) “A Model for Planning in Complex Situations”, Electronics Research Lab. Memo. No. UCB/ERL M81/49, University of California, Berkeley, Ca., USA.

86Wilensky R. (1983) “Planning and Understanding”, Addison-Wesley, Reading, Mass.

87Wilkins D.E. and Robinson A.E. (1981) “An Interactive Planning System”, SRI Technical Note 245. (SIPE)

88Wilkins D.E. (1983) “Representation in a Domain-Independent Planner”, IJCAI-83, pp 733–740, Karlsruhe, West Germany. (SIPE)