bluuebunny/crossref_metadata_2025 huggingface dataset:
TITAN
Authors: Sengul Cigdem , Kravets Robin
Published: January 2007

An ad hoc network is a multi-hop wireless network that is established by a group of mobile nodes without depending on any infrastructure. Due to the disconnected nature of such mobile nodes, a fundamental problem in ad hoc networks is energy-efficient operation to extend the lifetime of the nodes and the network. A promising strategy is to reduce the power consumption of the wireless interface since it is a significant contributer to the overall energy consumption. Essentially, while traffic load defines energy consumption by the wireless interface during active communication [1, 2], idle-time energy dissipation dominates total system energy consumption in the presence of low to moderate traffic [3, 4]. To this end, current approaches allow nodes to switch to a power-save mode where they spend most of their time in a low-power sleep state. However, allowing all nodes to operate in power-save mode imposes additional delay on all communication and can severely limit the capacity of the network as load increases [4]. To compensate for these limitations, some nodes can stay in active mode and serve as stable relays in the network to support low delay and high throughput [3, 4, 5]. Since the choice of nodes that remain active determines both energy consumption and communication quality, the main challenge to any idle-time energy conservation protocol is selecting the set of active nodes through which all traffic flows.
Fredkin Match at IJCAI-81
Authors: Berliner Hans
Published: January 2007

The 1981 Fredkin Match was between Belle, the winner of all recent computer chess competitions and Carl Storey, a Canadian Master with a rating of 2204. A master was chosen for the first time in this series of competitions since Belle was clearly in a class by itself and had already beaten more Masters that it had lost to. However, Mr. Storey prepared himself very well for this match, and unlike his predecessors in the 1980 Fredkin Matches proved to be completely dominant.
Practical uses for AI research
Authors: Filsinger Alan E.
Published: January 2007

AI research is sometimes believed to be an area of limited practicality. A discussion of a few applications of AI to practical uses may help some to have a less limited view of the field.
Dialogue project
Authors: Bunt Harry
Published: January 2007

Linguistic, logical, and cognitive aspects of man-computer dialogues in natural language form the subject of an interdisciplinary research project at the Institute for Perception Research (IPO), a joint institute of Philips' Research labs and the Eindhoven University of Technology. At present the project group consists of Harry Bunt, Frank Leopold, Herman Muller, Floris van Nes, and Gemme thoe Schwartzenberg.
Knowledge representation and natural language understanding
Authors: Coulon Daniel
Published: January 2007

It is not necessary and it is even not advisable to translate the sentences into an internal representation [6]. It is preferable to keep them as they are, and to interpret them at variable depth. This concept consists of 3 aspects [4]: progressive description, multiplicity of inference strategies, and evaluation on demand of partial results.
Survey of natural language processing
Authors: Ritchie Graeme
Published: January 2007

The project is an attempt to develop a general linguistic frame-work for writing processing grammars for English (both for parsing and for generating). the techniques used are drawn from both linguistics and AI, but the motivation is largely that of theoretical linguistics - describing how sentence-understanding (and production) works, with the most general, adequate rules possible. The project is a continuation of a line of research which the investigator began some years ago.
Review of "Subjective Understanding, Computer Models of Belief Systems by Jaime G. Carbonell"; UMI Research Press, Ann Arbor Michigan Copyright 1981
Authors: Carlson Gary
Published: January 2007

This is a very interesting and very important book. It is based on Carbonell's 1979 Yale Ph.D. thesis working under Schank and Abelson and others. The book is only 285 pages long but it has a lot of outstanding material in it. It has a very useful discussion of the whole question of subjective understanding. It appears that there are operating programs running on the DEC 10 or DEC 20 though no program listing are given. It would have been helpful if there had been a little more technical information on the program languages used and the amount of memory and machine capacity used.
Game-playing programs
Authors: Bramer M. A.
Published: January 2007

This collection of articles has been brought together to provide SIGART members with an overview of Artificial Intelligence approaches to constructing game-playing programs. Papers on both theory and practice are included.
Maintenance of expert systems
Authors: McCallum John C.
Published: January 2007

It is well known in the business computing community that program and data base maintenance are the largest component of the software system life cycle (Boehm, 1981). Little concern has been raised about the maintenance of knowledge bases of expert systems. The majority of interest in maintenance (which might be classified as being validity over the life cycle of the expert system (Mostow. 1985), and in the maintenance of consistency of a data base (Balzer et al. 1983). One commercial selling strategy of expert systems is that they do not change with time like human knowledge. A person who doesn't change with time however, is not necessarily an intelligent person. An expert system without maintenance is "an old fogey," unable to learn new things. In a preliminary study on now to implement a data base for critical evaluation of atomic and molecular data (Cann and Nicholls, 1980), it was decided to incorporate names of researchers, dates of data added as well as critical notes on methods and recommendations on results. The reasons for this were to be able to compare and update experimental data with time and with new experimental results. But, new results are not always better. Often, older values are obtained through more thorough study then some newer results. There are several different types of errors that can exist in data or knowledge bases.
Reflections on building two Go programs
Authors: Wilcox Bruce
Published: January 2007

From 1972 to 1979 I co-designed and built what became the world's strongest computer Go program, the Reitman-Wilcox Go Program [1]. It took 7 person-years, 8K lines of LISP, 3 megabytes of memory, and an IBM mainframe. Recently I constructed a similar program, called NEMESIS...the Go Master (tm). It has taken 1 person-year, 13.5K lines of C, 146 kilobytes of memory, and an IBM-PC. They play at a similar strength and by similar means. This article discusses both how I went about reengineering the old program and what I learned during this process.
JCIT hosts Israel's first major computer chess tournament
Authors: Newborn Monroe M.
Published: January 2007

At the invitation of the organizers of the Jerusalem Conference on Information Technology and the Israel Chess Association, six chess programs and their programmers gathered in Jerusalem on August 6-8 for a special three round computer chess tournament. The event was won by Tom Truscott's DUCHESS who upset David Slate and Larry Atkin's World Champion program, CHESS 4.6. CHESS 4.6 tied for second place with CHAOS. Also participating were OSTRICH (Canada) TELL (Switzerland) and BS '66 '76 (Netherlands).
Improving Prolog programs
Authors: Creelman Paul
Published: January 2007

Optimizing logic programs written in Prolog is an easy task. The depth first search ensures that rules Ri in the axiom list (global database) are searched from top to bottom of the global axiom list. (For simple implementations such as Robert Wallace's PiL published in the July 1983 issue of the SIGART Newsletter.)
Review of "What Can be Automated by Bruce W. Arden", MIT Press, 1983, ISBN 0-262-51026-x.
Authors: Price Keith
Published: January 2007

What Can be Automated is a massive tome that reports on the Computer Science and Engineering Research Study (COSERS). In about 1K pages, it presents a record of research in computer science with some evaluation of the past results and projections of the future directions for research. The title comes from the fact that most of Computer Science is concerned with the problems of automating various manual tasks, be it numerical computations, database management, weather forecasting, industrial processes, or language understanding.
Reviews of "Machine Learning by Ryszard S. Michalski, Jaime G. Carbonell, and Tom M. Mitchell", Tioga publishing company, 1983, ISBN 0-935382-05-4.
Authors: Norvig Peter
Published: January 2007

Machine Learning is in the enviable yet difficult position of being the first published collection of papers on the subject. By "machine learning" the editors refer to three distinct areas: the engineering of computer systems to learn in particular application areas, the theoretical analysis of learning algorithms, and the simulation of human learning processes. However, there is very little material on the third topic, and almost no mention of neurological models or biological theories of adaptation. The word "machine" is as important as "learning."
Selected AI-related dissertations
Authors: Humphrey Susanne M. , Krovetz Bob
Published: January 2007

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Selected AI-related dissertations
Authors: Humphrey Susanne M. , Krovetz Bob
Published: January 2007

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Errata
Authors: Bledsoe W. W.
Published: January 2007

On page 10 of the February Newsletter we inadvertantly misspelled C. L. Chang's name. Our apologies to him and others so treated.
An algorithm to play the game of mastermind
Authors: Rao T. Mahadeva
Published: January 2007

The game of Mastermind (INVICTA) is played by two persons. It is quite popular and claimed to be quite complex. Recently, we were interested in computerizing this game. This paper summarized the method we discovered and implemented. Our method uses a simple list data structure to represent the knowledge gained. The algorithm was programmed in Pascal on a Burrough B-6800 machine. Some experimental results are presented at the end of the paper.
Turtles and defense
Authors: Sobalvarro Patrick G. , Klotz Leigh L.
Published: January 2007

At Terrapin, we feel that our two main products, the Terrapin Turtle®, and the Terrapin Logo Language
1
for the Apple II, bring together the fields of robotics and AI to provide hours of entertainment for the whole family. We are sure that an enlightened application of our products can uniquely impact the electronic battlefield of the future.
A novel interaction between AI and philosophy
Authors: Trautteur Giuseppe
Published: January 2007

Most philosophical ideas and systems can be regarded as purportedly veridical descriptions of the
status quo
of some particular aspect of reality or of reality
in toto.
Research on planning
Authors: Robinson Ann E.
Published: January 2007

This section of the newsletter contains a collection of summaries of current research on planning. Although the number of projects described is modest, the variety of topics and institutions represented illustrates a healthy and growing interest in this area. In contrast with early research, much of which dealt with "blocks-world" problems, a significant portion of the research described here is confronting so-called "real-world" problems, such as planning with incomplete information, planning with large numbers of constraints, and planning in a non-cooperative environment. The role of planning in communication is also an important topic. Furthermore, in addition to covering a broad range of topics, the research covers the spectrum from quite theoretical to fairly practical.
Review of "The Handbook of Artificial Intelligence, Volume 2 by A. Barr & E. A. Feigenbaum, eds., Volume 3 by P. R. Cohen & E. A. Feigenbaum, eds.".
Authors: Price Keith
Published: January 2007

The Handbook of Artificial Intelligence, Volumes 2 and 3, continue the work started in Volume 1 (see review in
SIGART #81, July 1982
). Volume 2 primarily covers applications oriented work (expert systems) with chapters on programming languages and automatic programming. Volume 3 contains a long chapter on vision and shorter chapters on learning, theorem proving, planning and models of cognition.
Writing a computer program to play Mastermind that appears to be intelligent
Authors: Gyllenskog Joel
Published: January 2007

Writing computer programs to play games is a pleasant avocation. To capitalize on this opportunity it makes sense to use the computer's abilities for computation and storage that human competitors lack. Algorithms that are usable by people in a reasonable amount of time are often poor choices for computerization. I believe that Roa's algorithm to play the game of mastermind as published in the October 1982
SIGART
Newsletter
serves as an example. The algorithm exhibits several fatal flaws:□It is predictable.□It is reproducible.□it performs at the novice level.
A fine adventure
Authors: Paroli Flo
Published: January 2007

I would like to thank Willie Crowther and Don Woods for their efforts. Without their work, this story could never have been written.
Review of "Artificial Intelligence: An MIT Perspective, Volume 1: Expert Problem Solving, Natural Language Understanding, Intelligent Computer Coaches, Representation and Learning by Patrick Henry Winston and Richard Henry Brown"; The MIT Press, Cambridge, Massachusetts, 1979, ISBN 0-262-73058-8.
Authors: Akman Varol
Published: January 2007

Artificial Intelligence: An MIT Perspective consists of two volumes. Volume 1 covers the areas cited in the title of this review. Volume 2 (which will be the subject matter of an upcoming review) has sections on Understanding Vision, Manipulation and Productivity Technology, Computer Design, and Symbol Manipulation.
Review of "The Hedonistic Neuron: A Theory of Memory, Learning, and Intelligence by A. Harry Klopf"; Hemisphere Publishing Corporation, Washington, 1982.
Authors: Smoliar Stephen W.
Published: January 2007

In an age in which verbose obfuscation becomes more fashionable with every new government appointment, one has to appreciate an author who can give a cogent summary of his entire book in the second paragraph of his Preface:The book examines a theory of brain function based on the postulate that neurons "seek" excitation and "avoid" inhibition, this goal being pursued within well-defined limits that preclude an epileptic outcome (except under pathological circumstances that, indeed, we know do arise). In the development of the theory, it will be seen that a plausible adaptive mechanism exists that can account, in mechanistic terms, for the postulated neuronal behavior. Also, the notion of an excitation-seeking, inhibition-avoiding neuron will be shown to be consistent with experimentally observed neuronal behavior. Neuronal and cortical polarization studies, the mirror focus, and epileptic foci appear to be understandable in light of the proposed neuronal model. At a psychological level, habituation, dishabituation, classical and operant conditioning, and extinction can be shown to be straightforward consequences of a goal-seeking neuron like the kind proposed. None of this is to suggest that the validity of the proposed theory is demonstrated here. Far from it. Difficult experiments will have to be performed at the neuronal level to test the theory rigorously. Until these experiments are accomplished, the significance of the theory lies in its offering a fundamentally new view of brain function, a view that suggests alternative, and perhaps more productive, experiments.
Playing mastermind logically
Authors: Shapiro Ehud
Published: January 2007

I was intriqued by Mahadeva Rao's paper in SIGART #82 on an algorithm for playing mastermind, and its Pascal implementation. In this note I suggest a simpler algorithm for playing mastermind, and describe a miniature Prolog implementation of it.
An easy implementation of PiL (Prolog in Lisp)
Authors: Wallace Richard S.
Published: January 2007

Much attention has been drawn to Prolog, the implementation of logic as a programming language. The decision of the Japanese to use Prolog as the core language of the Fifth Generation Computer [Warren, 1982] has given rise to some concern that Prolog may emerge as the chief rival to Lisp in artificial intelligence programming. I [Wallace, 1983] and others [Robinson and Sibert, 1982; Komorowski, 1982] have argued the benefits of extending Lisp to do what Prolog does. Here I present a simple procedure for implementing Prolog in Lisp (PiL), in order to demonstrate that it is easy to extend Lisp to do what Prolog does.
Review of "Artificial Intelligence: An MIT Perspective, Volume 2: Understanding Vision, Manipulation, Computer Design, Symbol Manipulation by Patrick Henry Winston and Richard Henry Brown"; The MIT Press, Cambridge, Massachusetts, Second printing, 1980, ISBN 0-262-23097-6.
Authors: Akman Varol
Published: January 2007

Artificial Intelligence: An MIT Perspective consists of two volumes. In my previous review of Volume I (which has sections on Expert Problem Solving, Natural Language Understanding, Intelligent Computer Coaches, and Representation and Learning) I evaluated this set from a general perspective. For brevity, I will not repeat my comments here. Instead, I refer the reader who has not seen the first part of this article to the preceding issue of the Sigart Newsletter. Nevertheless, for the anxious reader I present my point of view concisely: These two volumes make up an excellent set of references and belong to the library of every serious Al researcher.
Object-centered representation and reasoning
Authors: Barbuceanu Mihai
Published: January 2007

This paper presents an investigation in object-centered representation and problem-solving, carried out in the area of CAD. The goal is the creation of a framework for building expert systems for CAD applications.
The facilities, this framework is composed of, are based on an object-centered representation language. Around this language, two main reasoning activities have been introduced. The first, implements a style of problem-solving by instantiation which develops an instantiation concept comprising of a variety of cognitive activities and which demonstrates high versatility through
its applications to project network building, constraint directed reasoning, and simulation. The second, by means of object-centered modeling of rule representations, easily integrates forward and backward reasoning in a facility used as a powerful tool for understanding and modifying design.A number of important capabilities covering essential aspects of the design process are shown to derive naturally from the cooperative use of the above mentioned reasoning activities.
The problem of a mouse in a maze
Authors: Majocchi Luca , Sechi Giacomo R.
Published: January 2007

In a broader research work about problem-solving methods and techniques, the problem of a mouse in a maze appears to be a fairly good problem to deal with. In fact, it is complex to be described in detail, easily understandable as regards its main features and well-known in order to have other instances of solution a new one can be compared to.
Review of "Artificial Intelligence: Tools, Techniques, and Applications by Marc Eisenstat and Tim O'Shea", Harper and Row, Publishers, Inc., New York, NY.
Authors: Price Keith
Published: January 2007

Artificial Intelligence: Tools, Techniques, and Applications
edited by Eisenstat and O'Shea is derived from an AISB seminar on Al. The book is intended for use in an advanced Al course or for an in depth study of general Al. The title refers to the three major sections of the book.
Tools
include Prolog (both an introduction and an advanced chapter) and LISP (introduction and advanced topics). The
Techniques
section covers some general topics, a review of Cognitive Science and natural language, and specialized methods relating to robotics. It also includes a chapter on how to get a Ph.D. in Al. The final section,
Applications
, covers various areas of applied Al. I will first give an overview of the contents of the book, then present a brief evaluation of the book.
Learning program helps win national fleet wargame tournament
Authors: Lenat Doug
Published: January 2007

During the month of June 1981, the EURISKO program was set the task of exploring the design of naval fleets conforming to a body of (several hundreds of) rules and constraints as set forward in Traveller: The Trillion Credit Squadron. EURISKO designed a fleet of ships suitable for entry in the 1981 Origins national wargame tournament, held at Dunfey's Hotel, in San Mateo, Ca., over July 4 weekend. The Traveller tournament, run by Game Designers Workshop (based in Normal, Illinois), was single elimination, six rounds. EURISKO's fleet won that tournament, thereby becoming the ranking player in the United States (and also an honorary Admiral in the Traveller navy). This win is made more significant by the fact that the program's creator, Professor Douglas Lenat of Stanford University's Heuristic Programming Project, had never played this game before, nor any miniatures battle game of this type.
The RUS parsing system and PSI-KLONE semantic interface
Authors: Bobrow Rusty , Bates Madeleine , Webber Boanie
Published: January 2007

The RUS parsing system provides a practical framework for natural language processing that is as flexible and extensible as a modular syntactic/semantic processor (such as LUNAR) and as efficient as a semantic grammar (such as the SOPHIE parser). RUS combines a large ATN grammar for English (with coverage greater than that of the LUNAR parser) with an interface that permits semantic interpretation to be performed efficiently during the parsing process. The interaction between the parser and the interpreter takes the form of a
cascade
[2] in which the interpreter receives information about syntactic constituents incrementally during the parsing process, and provides immediate feedback to the parser about the semantic acceptability of proposed syntactic structures. This results in an extremely efficient parser that has the advantages of both a syntax-first and a semantics-first approach.
A computational module for spontaneous discourse
Authors: Reichman Rachel
Published: January 2007

Having recently joined the computer science faculty at UCSD, I shall be continuing my work on spontaneous discourse first started a number of years ago while I was at BBN. In this abstract, I review this past work and briefly describe some future plans.
Center for the study of reading
Authors: Bruce Bertram
Published: January 2007

The Center for the Study of Reading (CSR) is a joint project of the University of Illinois at Urbana-Champaign and Bolt Beranek and Newman Inc. It was established in 1976 to study the problems of learning to read, with a special emphasis on the difficulties many children have with reading comprehension. The CSR draws together researchers from a variety of disciplines including artificial intelligence, cognitive psychology, linguistics, anthropology, and education.
Natural Language interfaces to "layered" domains
Authors: Ballard Bruce W.
Published: January 2007

The Natural Language Computer [3,4] provides users with a domain of one or more matrices, displayed on a CRT screen, and interactively operated on by typing a sequence of English commands. Performance studies with NLC have been favorable [5]. However, users are required to formulate all inputs in terms of only matrix operations. Thus, when subjects solving a Gradebook problem (illustrated below) wanted to refer to "Jack's quiz scores", they had to type (say) #entries in the row named Jack and in columns 1 and 2".
Natural Language programming
Authors: Biermann Alan W. , Ballard Bruce W. , Fink Pamela K. , Rodman Robert , Rubin David
Published: January 2007

This project concentrates on the fast, efficient execution of sequences of imperative sentences for a variety of applications. The general strategy assumes that the machine controls a world of interest to the user which can be observed on a computer display screen. The user inputs sentences requesting actions to be performed on the world and observes the result of each command. If the result does not satisfy the user, he or she may request a back-up and rephase the command in clearer language. Most commands are executed in about 2 to 4 seconds making it possible to have a genuine dialog in real time in the solution of real problems.
GLP--The application of a chart-parser to speech understanding
Authors: Goerz Guenther
Published: January 2007

GLP is a general linguistic processor for the analysis and generation of natural language. It will be integrated into a speech understanding system for continuously spoken German language which is currently under development at the Computer Science Department, University of Erlangen-Nuernberg (Hein (1980) and this issue).
Computer understanding of descriptive contexts
Authors: Gomez Fernando
Published: January 2007

I am concerned with the development of a theory of computer comprehension of descriptive contexts. By "descriptive contexts" I refer to the language of scientific books, text books, of this text etc. An important characteristic of these contexts is the predominance of descriptive predicates and verbs (verbs such as "contain", "refer", "Consist of", ...) over action verbs. In the distinction performative vs. declarative, descriptive texts clearly fall in the declarative side. Most of the best work on natural language has dealt with contexts in which the computer understanding depends on the meaning of the action verbs and the human actions (plans, goals) indicated by them. This work has had very little bearing on a theory of computer understanding of descriptive contexts. One of the main tenets of my research is that descriptive contexts call for different theoretical ideas from those proposed for the understanding of human actions, although there are some points of contact.
Research in natural language processing
Authors: Loebner Egon
Published: January 2007

We are carrying out a preliminary investigation of the use of a generalized phrase structure grammar (the formulation of context-free grammars developed in [1] and related works) as the basis for a modular and linguistically robust natural language processor. The grammar. is generated from a kernel set of rules, plus a set of metarulcs that expand the kernel into the full rule set used for processing English. This greatly simplifies the task of testing and modifying the grammar.
Knowledge for communication
Authors: Airenti Gabriella , Bara Bruno G. , Colombetti Marco
Published: January 2007

The aim of our work is to develop a theory of the mental processes underlying the communication activity of a number of subjects in a given relational context. The start point in this direction is the proposal of a knowledge representation based on the distinction between conceptual and episodic knowledge (Airenti, Bara, Colombeti 1980 a, c). Referring to paradigms of mathematical logic one can say that conceptual knowledge plays the role of a theory of the external world: It is constituted by a conceptual system, K-theory, describing entities of the external world with their general properties, mutual relations, transformation rules, etc. The relation of K-theory to the external world may be viewed as that of a theory to one of its models. From a psychological point of view, however, K-theory does not deal with the external world but with a mental representation of it. Such a representation is the actual model of K-theory and constitutes th episodic knowledge, K-model. It contains representations and mutual correlations of individuals, objects and specific facts and events. To represent change in the external world, K-model is structured into a number of temporarily correlated representations.
An intelligent tutor for high school algebra problems
Authors: Bregar W. S. , Farley A. M.
Published: January 2007

This is an ongoing research project whose goal is to build a system for tutoring students to interpret and solve high school algebra level word problems. Until now, the major emphasis has been on the development of a model of problem solving based on protocols between tutors and students. Our model currently consists of four sets of production rules which account for strategies, computations on problem entities, algebraic manipulations, and semantics of the problem statement.
Research at Stanford University
Authors: Kaplan S. Jerrold
Published: January 2007

Support and Personnel:
Research in Computational Linguistics at Stanford is being carried out in the context of the Knowledge Base Management Systems (KBMS) project (Defense Advanced Research Projects Agency contracts MDA903-77-C-0322 and N000-39-80G-0132 Gio Wiederhold, Principal Investigator). The KBMS project is concerned with the application of Artificial Intelligence techniques to the design, performance, and use of database systems. Additional funding is provided by NSF Grant ISTRO-23889. Primary contributors are Jerry Kaplan (Research Associate), and students Jim Davidson, Francisco Corella, and Lena Yesil. Participants on a sub-contract to SRI International are Barbara Grosz, Norman Haas, and Daniel Sagalowicz.
EUFID description
Authors: Templeton Margie
Published: January 2007

EUFID (End User Friendly Interface to Database) is designed to be used as an independent front end to diverse database and data management systems. The main EUFID modules are application and data management system (DMS) independent. The analyzer parses the English question using a dictionary that is specific to the database. The dictionary defines the underlying concept of the English words in terms of the other words in the sentence and the location of the word with respect to the other words. The parsing is done using the semantic dictionary plus English syntax rules which are built into the analyzer. The analyzer builds a concept tree which is sent to the mapper. The mapper maps the concept tree, which contains concepts in the user's view of the database, into the groups and fields of the database. The mapper produces a query in Intermediate Language (IL) which is a relational language. The IL query for any DMS will be identical. A specific translator for a DMS then translates the IL into the query language for the data management system. Currently, translators exist for INGRES, a relational DMS, and WWDMS, a network DMS with procedural queries. Three different applications have been developed, one which runs under WWDMS and two which run under INGRES.
Research at Tartu State University
Authors: Oim Haldur , Sildmae Illo , Litvak Sergei , Roosmaa Tiit , Saluveer Madis
Published: January 2007

There are two natural language processing projects in progress at the AI Laboratory of Tartu State University, both of which belong to the broader context of AI and natural language understanding.
A natural language understanding system for medical applications
Authors: Buchberger Ernst , Steinacker Ingeborg , Trappl Robert , Trost Harald , Leinfellner Elisabeth
Published: January 2007

The system is designed to engage in dialogues in German. Due to our focus of interest in methodology of representation we chose an approach independent of the domain in which the system can be used. Its designated area of application will be medicine.
Research at Xerox PARC
Authors: Kaplan Ronald M.
Published: January 2007

The Xerox Palo Alto Research Center maintains a small, theoretically oriented natural language research program. The principal investigators are Ronald M. Kaplan (Cognitive and Instructional Sciences Group) and Martin Kay (Computer Science Laboratory). For the last several years, we have focussed on linguistic, psycholinguistic, and computational aspects of syntax and morphology.
The Lisp Machine manual
Authors: Weinreb Daniel , Moon David
Published: January 2007

This 471-page, softcover manual describes the programming language and software environment of the Lisp Machine developed at M.I.T.'s Artificial Intelligence Laboratory over the past 8 years. The Lisp Machine is the result of a successful experiment in computer science: a distributed computing system consisting of a network of powerful 32-bit personal computers, implemented with custom hardware and software as complete, interactive graphical workstations. Each machine consists of a 32-bit computer with 64 megabytes of virtual memory, 1 to 16 megabytes of main memory, 80 megabytes (or larger) disk, 800x900 graphics display (color optional), mouse, keyboard, speaker and 4 million bit/second local network interface, which allows connections to other Lisp Machines, primers and file servers.
Reasonable breadth-biased
Authors: Gumb Raymond D.
Published: January 2007

A+ algorithms are A algorithms (as studied by Nilsson) satisfying two additional constraints which magnify the breadth aspect of a graph search. Use of A+ algorithms is perhaps most plausible when it is desirable to generate alternative goal nodes on optimal paths. There are two principal results for A+ algorithms. First, if A
1
and A
2
are A+ algorithms and A
2
is as well informed as A
1
then A
2
expands no more nodes than A1 does. Second, if an A+ algorithm is modified so as to return a set of optimal paths and the monotone condition is satisfied, the A+ algorithm returns a set of solutions consisting of an optimal path to each goal node on an optimal path.
Knowledge-based expert systems
Authors: Rychener Michael D.
Published: January 2007

This research was sponsored by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 3597, monitored by the Air Force Avionics Laboratory Under Contract F33615-78-C-1551. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government.
Approaching problem solving type behavior via the psychological process of instrumental conditioning
Authors: Filsinger Alan E.
Published: January 2007

One approach to the study of AI is to observe how animals and man solve problems requiring some degree of thought and use of intelligence. The psychological models that are then derived, can next be expressed in computer models. In short, this is the "psychological approach to AI."
Special issue on knowledge representation
Authors: Brachman Ronald J. , Smith Brian C.
Published: January 2007

In the fall of 1978 we decided to produce a special issue of the SIGART Newsletter devoted to a survey of current knowledge representation research. We felt that there were twe useful functions such an issue could serve. First, we hoped to elicit a clear picture of how people working in this subdiscipline understand knowledge representation research, to illuminate the issues on which current research is focused, and to catalogue what approaches and techniques are currently being developed. Second -- and this is why we envisaged the issue as a survey of many different groups and projects -- we wanted to provide a document that would enable the reader to acquire at least an approximate sense of how each of the many different research endesvours around the world fit into the field as a whole.It would of course be impossible to produce a final or definitive document accomplishing these goals: rather, we hoped that this survey could initiate a continuing dialogue on issues in representation, a project for which this newsletter seems the ideal forum. It has been many months since our original decision was made, but we are finally able to present the results of that survey. Perhaps more than anything else, it has emerged as a testament to an astounding range and variety of opinions held by many different people in many different places.The following few pages are intended as an introduction to the survey as a whole, and to this issue of the newsletter. We will briefly summarize the form that the survey took, discuss the strategies we followed in analyzing and tabulating responses, briefly review the overall sense we received from the answers that were submitted, and discuss various criticisms which were submitted along with the responses. The remainder of the volume has been designed to be roughly self-explanatory at each point, so that one may dip into it at different places at will. Certain conventions, however, particularly regarding indexing and tabulating, will also be explained in the remainder of this introduction.As editors, we are enormously grateful to the many people who devoted substantial effort to responding to our survey. It is our hope that the material presented here will be interesting and helpful to our readers, and that fruitful discussion of these and other issues will continue energetically and enthusiastically into the future.
A description logic-based configurator on the web
Authors: McGuinness Deborah L. , Isbell Charles , Parker Matt , Patel-Schneider Peter , Resnick Lori Alperin , Welty Chris
Published: January 2007

Description logics have a history of success in configuration applications in major companies including AT&T (mentioned in this paper) and the Ford Motor Company. While we have produced a number of commercial configurators, we find a demonstration application to be the best expository tool for describing how description logics can be leveraged effectively in tasks such as configuration.
Review of "A Reader's Guide to Agent Literacy by Marie A. Bienkowski".
Authors: Bienkowski Marie A.
Published: January 2007

Those of us who are newly arrived on the agent scene have a variety of books available with which to increase our agent vocabulary. In this article, I provide a short review of five books related to agent research. I also discuss several overview papers and the recently published proceedings of the 1997 Autonomous Agents conference. Rather than providing an in-depth, critical analysis of these books (most of which are edited collections of papers), I describe their overall approach, attitude, and quality. These books are not ones that I chose from an exhaustive search of all potentially relevant available books but are those that quality publishers of AI/philosophy texts provided to me for review or those that I purchased for my own education. I have not selected books that treat only one aspect of agent operation in detail (e.g., Rosenschein & Zlotkin, 1994) in order that I may present you with books that significantly expand your agent literacy.
Review of "Discrete Neural Networks: A Theoretical Foundation by Kai-Yeung Siu, Vwani Roychowdhury and Thomas Kailath", Prentice Hall PTR, 1995, ISBN 0-13-300708-1.
Authors: Phoha Vir V.
Published: January 2007

This book is an important addition to the neural networks literature and fills a void by presenting, in one volume, the important computational issues in discrete neural networks. The book deals with the computational complexity of problems being solved by systems of parallel processing elements.
Review of "Proceedings of the 1988 Connectionist Models Summer School by David Touretzky, Geoffrey Hinton and Terrence Sejnowski", Morgan Kaufmann Publishers, 1989.
Authors: McKevitt Paul
Published: January 2007

Here we have a set of papers by a number of researchers (students and faculty) at the time of the revival of connectionism, and some of the students have since made their names in the field (e.g., Bookman, Miikkulainen, and Regier). The proceedings is from the second Connectionist Models Summer School held at Carnegie Mellon University in 1988 and organized by Dave Touretzky with Geoffrey Hinton and Terrence Sejnowski as advisors.
Is the digital computer the right tool for artificial intelligence?
Authors: Kafatou Thalia
Published: January 2007

Since the earliest recorded times, attempts have been made to develop and construct systematic rules of thinking. The field of the Artificial Intelligence was developed towards this objective, and the tool used for this purpose was the digital electronic computer.
INTERLISP
Authors: Teitelman Warren
Published: January 2007

INTERLISP (INTERactive LISP) is a LISP system currently implemented on the DEC PDP-10 under the BBN TENEX time sharing system<*R1>. INTERLISP is designed to provide the user access to the large virtual memory allowed by TENEX, with a relatively small penalty in speed (using special paging techniques described in <*R2>). Additional data types have been added, including strings, arrays, and hash association tables (hash links). The system includes a compatible compiler and interpreter. Machine code can be intermixed with INTERLISP expressions via the assemble directive of the compiler. The compiler also contains a facility for "block compilation" which allows a group of functions to be compiled as a unit, suppressing internal names. Each successive level of computation, from interpreted through compiled, to block-compiled provides greater speed at a cost of debugging ease.
A note on the AI tutorial at the ACM
Authors: Carbonell Jaime
Published: January 2007

At the Los Angeles national ACM conference in November, 1981, SIGART sponsored a two-part All tutorial session. This note reports briefly on that session and outlines some useful pointers for anyone organizing future AI tutorials at ACM conferences. The AI tutorial was divided into two two-hour sessions:
Review of "The Handbook of Artificial Intelligence Vol. 1 by Avron Barr & Edward A. Feigenbaum", William Kaufmann, Inc. 1981
Authors: Price Keith
Published: January 2007

Ten years ago a book of this nature would have been a good textbook for AI, but unfortunately (or fortunately depending on your viewpoint) the field has grown so that three volumes are now required. The three volume series The Handbook of Artificial Intelligence is intended to be an introductory reference book both for researchers within AI and for those outside who need a guide to the uncharted waters of AI research and literature. Under each major topic (Volume 1 includes search, knowledge representation, and language both written and spoken) many different ideas and systems are presented. This should prevent newcomers to the field from deciding that because they have seen one idea they know everything about the field and can now easily solve all problems with one method.
QoS modelling and analysis with UML-statecharts
Authors: Jansen David N. , Hermanns Holger
Published: January 2007

The UML is an influential and widespread notation for high-level modelling of information processing systems. UML statechart diagrams are a graphical language to describe system behaviour. They consitute one of the most intensively-used formalisms comprised by the UML. However, statechart diagrams are lacking concepts for describing real-time, performance, dependability and quality of service (QoS) characteristics at a behavioural level.This note describes a QoS-oriented extension of UML statechart diagrams, called StoCharts. StoCharts enhance the basic statechart formalism with two distinguished features, both simple and easy to understand, yet powerful enough to model a sufficiently rich class of stochastic processes. This is illustrated by a selection of case studies performed using StoCharts. We review the main ingredients of StoCharts and survey tool support and case studies performed with the language, and place StoCharts in the context of other extensions of statechart diagrams.
Towards more accurate separation bounds of empirical polynomials
Authors: Nagasaka Kosaku
Published: January 2007

We study the problem of bounding a polynomial which is absolutely irreducible, away from polynomials which are not absolutely irreducible. These separation bounds are useful for testing whether an empirical polynomial is absolutely irreducible or not, for the given tolerance or error bound of its coefficients. Kaltofen and May studied a method which finds applicable separation bounds using an absolute irreducibility criterion due to Ruppert. In this paper, we study some improvements on their method, by which we are able to find more accurate separation bounds, for bivariate polynomials.
Circuit recognition and verification from bipolar and MOS layout information
Authors: Ablasser I. , Jäger U.
Published: January 2007

The mathematical and technical background information for our highly efficient procedure of circuit recognition and verification from layout information is presented. Completeness and extremely short computing times are the main features. This procedure can be performed for bipolar as well as for MOS technologies and is part of the whole control system LOCATE.
A common data library in an integrated CAD system for electronics
Authors: Tyssø V. , Aas E. J.
Published: January 2007

This paper describes the basic concept, features and implementation of a Common Data Library (CDL) in an integrated CAD/CAM system environment. The work presented is a part of a project called EPOKE, aiming at a totally integrated CAD/CAM system for the Norwegian electronics industry. The EPOKE project is sponsored by the Royal Norwegian Council for Scientific and Industrial Research (NTNF), and is a joint effort between A/S Elektrisk Bureau, A/S Kongsberg Våpenfabrikk, the Central Institute for Industrial Research, and ELAB (The Electronics Research Laboratory at the University of Trondheim).
Review of "Handbook of Design Automation by Steve Sapiro and Robert J. Smith II"; CAE Systems, Inc.
Authors: Baeder D. Scott
Published: January 2007

The material presented in this book covers the whole spectrum of CAE, Computer Aided Engineering, from Design Methodologies to Physical Implementation. The book starts out with a very basic discussion of exactly what CAE is, and how it impacts the design cycle. Chapters two and three cover the design cycle and how different design methodologies, Structured Design vs. LSSD, and physical constraints (Gate Array vs. Standard Cell vs. Full Custom) can affect the design process.
Constraint languages for computer aided design
Authors: Leler Wm
Published: January 2007

In a typical algorithmic language such as Fortran or Pascal a program is a sequence of steps for the language interpreter to follow to achieve a desired result. In a constraint language a program is a set of relationships, called constraints, that describe the desired result. It is up to the language interpreter to determine the steps required to satisfy the constraints and achieve the result.
A minicomputer-based logic circuit fault simulator
Authors: Flomenhoft Mark J. , Csencsits Brenda M.
Published: January 2007

A logic circuit simulator implemented on a mini-computer with 16K core handles 1000 zero- and unit-delay gates. Single "stuck-at-0", "stuck-at-1", and "short-circuit" faults are simulated in parallel seven at a time using a table-driven selective-trace fault-injection algorithm. For a typical 100-gate circuit the simulation rate for the fault-free circuit or for a group of seven faults is about 800 input patterns per minute, and a complete fault simulation run takes about 5 minutes and costs $1.This paper, aimed at simulator program-designers rather than users, describes technical details of the implementation including minicomputer considerations, the data structure, coding three-valued-logic for efficient parallel simulation, the selective-trace algorithm, the recognition and resolution of critical races in flip-flops, the recognition and resolution of circuit oscillations, implicit fault collapsing, and short-circuit fault simulation.
A partitioning technique for LSI chips
Authors: Wang Pao-Tsin
Published: January 2007

A technique for partitioning LSI chips is presented in this paper. This technique is a refinement of the author's previous work [1].