The most commonly used neural network models are not well suited to direct digital implementations because each node needs to perform a large number of operations between floating point values. Fortunately, the ability to learn from examples and to generalize is not restricted to networks ofthis type. Indeed, networks where each node implements a simple Boolean function (Boolean networks) can be designed in such a way as to exhibit similar properties. Two algorithms that generate Boolean networks from examples are presented. The results show that these algorithms generalize very well in a class of problems that accept compact Boolean network descriptions. The techniques described are general and can be applied to tasks that are not known to have that characteristic. Two examples of applications are presented: image reconstruction and handwritten character recognition.

The most commonly used neural network models are not well suited to direct digital implementations because each node needs to perform alarge number of operations between floating point values. Fortunately, the ability to learn from examples and to generalize is not restricted to networks ofthis type. Indeed, networks where each node implements a simple Boolean function (Boolean networks) can be designed in such a way as to exhibit similar properties. Two algorithms that generate Boolean networks from examples are presented. Theresults show that these algorithms generalize very well in a class of problems that accept compact Boolean network descriptions.

The 1993 International Logic Programming Symposium was held in Vancouver, British Columbia, on 26-29 October. It presented the state of the art in logic programming, emphasizing the deliberate interaction with other fields, in particular, humanistic fields. Topics covered at the symposium included algorithmic analysis, programming methodologies, semantic analysis, deductive databases, and programming language design.

The 1993 International Logic Programming Symposium was held in Vancouver, British Columbia, on 26-29 October. It presented the state of the art in logic programming, emphasizing the deliberate interaction with other fields, in particular, humanistic fields. Topics covered at the symposium included algorithmic analysis, programming methodologies, semantic analysis, deductive databases, and programming language design.

Recent developments have clarified the process of generating partially ordered, partially specified sequences of actions whose execution will achieve an agent's goal. This article summarizes a progression of least commitment planners, starting with one that handles the simple STRIPS representation and ending with UCPOP, a planner that manages actions with disjunctive precondition, conditional effects, and universal quantification over dynamic universes. Along the way, I explain how Chapman's formulation of the modal truth criterion is misleading and why his NP-completeness result for reasoning about plans with conditional effects does not apply to UCPOP.

Navigating through the Frame Problem: Review of Reasoning Agents in a Dynamic World

We recommend doesn't carry the day. The robot swallow something that's not particularly that those inclined to study must be able to use Q to arrive at its savory: a contradiction.

The Association for the Advancement of Artificial Intelligence held its 1993 Fall Symposium Series on October 22-24 in Raleigh, North Carolina. This article contains summaries of the six symposia that were conducted: Automated Deduction in Nonstandard Logics; Games: Planning and Learning; Human-Computer Collaboration: Reconciling Theory, Synthesizing Practice; Instantiating Intelligent Agents; and Machine Learning and Computer Vision: What, Why, and How?

Basic connectionist principles imply that grammars should take the form of systems of parallel soft constraints defining an optimization problem the solutions to which are the well-formed structures in the language. Such Harmonic Grammars have been successfully applied to a number of problems in the theory of natural languages. Here it is shown that formal languages too can be specified by Harmonic Grammars, rather than by conventional serial rewrite rule systems. 1 HARMONIC GRAMMARS In collaboration with Geraldine Legendre, Yoshiro Miyata, and Alan Prince, I have been studying how symbolic computation in human cognition can arise naturally as a higher-level virtual machine realized in appropriately designed lower-level connectionist networks. The basic computational principles of the approach are these: (1) a. \Vhell analyzed at the lower level, mental representations are distributed patterns of connectionist activity; when analyzed at a higher level, these same representations constitute symbolic structures.