Goto

Collaborating Authors

 Logic & Formal Reasoning


Logical Versus Analogical or Symbolic Versus Connectionist or Neat Versus Scruffy

AI Magazine

Engineering and scientific education condition us to expect everything, including intelligence, to have a simple, compact explanation. Accordingly, when people new to AI ask "What's AI all about," they seem to expect an answer that defines AI in terms of a few basic mathematical laws. Today, some researchers who seek a simple, compact explanation hope that systems modeled on neural nets or some other connectionist idea will quickly overtake more traditional systems based on symbol manipulation. Others believe that symbol manipulation, with a history that goes back millennia, remains the only viable approach. Marvin Minsky subscribes to neither of these extremist views. Instead, he argues that AI must use many approaches. AI is not like circuit theory and electromagnetism. There is nothing wonderfully unifying like Kirchhoff's laws are to circuit theory or Maxwell's equations are to electromagnetism. Instead of looking for a "right way," the time has come to build systems out of diverse components, some connectionist and some symbolic, each with its own diverse justification." - Patrick Winston


Letters to the Editor

AI Magazine

Dr. Northrup Fowler III Rome Laboratory Recently I circulated the Waltz taxonomy MVL theorem proving taxonomy, I wonder if AAAI system available by anonymous ftp might not consider a broader review from Stanford. Systems architectures and thereby gain some sense 2. Loop detection and recursion control of current relative interest and, over in the underlying theorem prover. Featuring applications in: of the discipline as a whole relative 4. A fast unifier that includes an Banking and Finance a valuable service to those who serve sequence variables. Published by I'm surprised in a way that AAAI t.stanford.edu, AAAI Press hasn't already undertaken this effort, "anonymous" as your user name, followed as do other professional organizations by any password you wish.



Experiments with Proof Plans for Induction

Classics

Abstraction, in contrast to meta-level inference, works with a degenerate version of the object-level space in which some essential detail is thrown away. Because abstract plans are strongly tied to the object-level space, they are limited in their expressive power.




The First International Workshop on Human and Machine Cognition, Pensacola, Florida. Topic: The Frame Problem

AI Magazine

In 1877 the Italian astronomer number of inferences about what has Program co-chairpersons are Dr. Robin Giovanni Schiaparaelli announced not changed as the result of performing Cohen of the University of Waterloo, the existence of canali on Mars: a network some action A while allowing the Bob Kass of the EDS Center for of straight and curved lines running small number of inferences about Machine Intelligence, and Cecile Paris across the planet. Canali, meaning what has changed as a result of A. of the Information Sciences Institute.


Thoughts and Afterthoughts on the 1988 Workshop on Principles of Hybrid Reasoning

AI Magazine

The 1988 Workshop on Principles of Hybrid Reasoning, a one-day AAAI-sponsored workshop, was held in St. Paul, Minnesota on August 21, 1988, in conjunction with the National Conference on Artificial Intelligence. This article reports on the workshop and presents some of our afterthoughts based upon prolonged discussion of the issues that arose during the workshop.


Workshop on Defeasible Reasoning with Specificity and Multiple Inheritance

AI Magazine

A workshop on defeasible reasoning with specificity was held under the arch in St. Louis during April 1989, with support from AAAI and McDonnell Douglas, and the assistance of Rockwell Science Center Palo Alto and the Department of Computer Science of Washington University.


A Bibliography on Hybrid Reasoning

AI Magazine

In Daniel G. Bobrow and Alan Model of Computation Based on a Calculus University of New York at Albany, 1986. On the of many sorted interpolation theorems. An investigation [Höhfeld and Smolka, 1988] Markus Höhfeld in Expert Systems III, pages 184-194, into inference with restricted and G. Smolka. A many-sorted resolution based Levesque, and Raymond Reiter, editors, 2(3):142-150, 1986. An overview in a topically organized semantic of the HORNE logic programming system.