We describe work on a project aimed at producing an interactive program for the construction of project networks (e.g. for house building tasks). To do this we have developed a planner which can form plans epresented as a partiQlly ordered netwo k of actions. A formalism (TF) is given for describing a domain in a hierarchic fashion. The representation of plans and the planner (NONLIN) are fully explained. During this work, a general technique was developed for answering queries about Q situation when the informQtion about the world is stored as a partiQlly ordered network of alterations made to some initial situation. We give a general procedure for recognizing and correcting for interactions between actions in the network. This is based on an analysis of the goal structure of the problem. The work is compared to that of Sacerdoti (l975a) who pioneered the techniques of planning using plans represented as partially ordered networks of actions.

Abstract: A data base system that supports natural language queries is not really natural if it requires the user to know how the data are represented. This paper defines a formalism, called conceptual graphs, that can describe data according to the user’s view and access data according to the system’s view. In addition, the graphs can represent functional dependencies in the data base and support inferences and computations that are not explicit in the initial query.IBM Journal of Research and Development 20:4, pp. 336-357.

Browse Author Title: Author(s): Date: Publisher: Pages: Subject: !! Call #: Subject: !! Call #: !! Speech , Pattern recognition !! QA80:N35 Take a Virtual Look at the Shelves Subject: Call #: !! Availability: !! Speech , Pattern recognition QA80:N35 Take a Virtual Look at the Shelves !! OUT Reques...

New York: North-Holland

However, in their conventional form, networks are rather clumsy constructs for the representation of quantification.

This paper presents a functional overview of the features and capabilities of QLISP, one of the newest of the current generation of very high level languages developed for use in Artificial Intelligence (AI) research.QLISP is both a programming language and an interactive programming environment. It embeds an extended version of QA4, an earlier AI language, in INTERLISP, a widely available version of LISP with a variety of sophisticated programming aids.The language features provided by QLISP include a variety of useful data types, an associative data base for the storage and retrieval of expressions, the ability to associate property lists with arbitrary expressions, a powerful pattern matcher based on a unification algorithm, pattern-directed function invocation, "teams" of pattern invoked functions, a sophisticated mechanism for breaking a data base into contexts, generators for associative data retrieval, and easy extensibility.System features available in QLISP include a very smooth interaction with the underlying INTERLISP language, a facility for aggregating multiple pattern matches, and features for interactive control of programs.A number of applications to which QLISP has been put are briefly discussed, and some directions for future development are presented. SRI Tech.Note 120, AI Center, SRI International, Inc., Menlo Park, Calif.

'Projects AgenCy of the Department of Defense and monitored Cooperation ---- How to avoid duSlication Sf'effoft. ' choosing what to do Sext .; ' - '"1 ""1 'JiStSract effectively V they are :tSSiSrovidegfmutual' assistance in y: IS"SécePted as occurring*'l the: Ifl1fipUt whén they ar e not really there, fl'STSSQ.'

Gruber T and Cohen P 1989, The design of an automated assistant for acquiring strategic knowledge, ACM SIGART Bulletin:108, (147-151), Online publication date: 1-Apr-1989 .

Boitet, C. 1977 Where Does GETA Stand at the Beginning of Brinkmann, K.-H.

In L. Steels (Ed.), Advances in natural language processing. Antwerp, Belgium: University of Antwerp.