An informal workshop on concurrent logic programming, metaprogramming, and open systems was held at Xerox Palo Alto Research Center (PARC) on 8-9 September 1987 with support from the Association for the Advancement of Artificial Intelligence. The 50 workshop participants came from the Japanese Fifth Generation Project (ICOT), the Weizmann Institute of Sci-ence in Israel, Imperial College in London, the Swedish Institute of Computer Science, Stanford University, the Mas-sachusetts Institute of Technology (MIT), Carnegie Mellon University (CMU), Cal Tech, Science University of Tokyo, Melbourne University, Calgary University, University of Wisconsin, Case Western Reserve, University of Oregon, Korea Advanced Institute of Science and Technology (KAIST), Quintus, Symbolics, IBM, and Xerox PARC. No proceedings were generated; instead, participants distributed copies of drafts, slides, and recent papers.

Johnson-Laird In a field choked with seemingly impenetrable jargon, Quick and thorough. Philip Johnson-Laird has done the impossible: written a By mixing forward and backward chaining, goal search book about how the mind works that requires no advance time can be shortenedramatically And, using GURU's knowledge of artificial intelligence, neurophysiology, or multiple rule firing capabilityou can refire rules psychology, providing the single best introduction to cognitive as values change GURU also comes equipped with science available. "Philip Johnson-Laird has that rare gift of being a cognitive seamlessly integrated 4th generation decision support scientist of the first order, yet he addresses himself to capabilitiesuch as data base, spreadsheet, and the deep classical issues in psychology, in the philosophy report generator

An informal workshop on concurrent logic programming, metaprogramming, and open systems was held at Xerox Palo Alto Research Center (PARC) on 8-9 September 1987 with support from the Association for the Advancement of Artificial Intelligence. The 50 workshop participants came from the Japanese Fifth Generation Project (ICOT), the Weizmann Institute of Sci-ence in Israel, Imperial College in London, the Swedish Institute of Computer Science, Stanford University, the Mas-sachusetts Institute of Technology (MIT), Carnegie Mellon University (CMU), Cal Tech, Science University of Tokyo, Melbourne University, Calgary University, University of Wisconsin, Case Western Reserve, University of Oregon, Korea Advanced Institute of Science and Technology (KAIST), Quintus, Symbolics, IBM, and Xerox PARC. No proceedings were generated; instead, participants distributed copies of drafts, slides, and recent papers.

An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic programs by including classical negation, in addition to negation-as-failure. The semantics of such extended programs is based on the method of stable models. The concept of a disjunctive database can be extended in a similar way. We show that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available.

CACM, 31, 38–43.

Did you know your Organization can subscribe to the ACM Digital Library?

We offer a simple mechanism, that of metalingual definition (D. G. Hays, The Meaning of a Term is a Function of the Theory in Which It Occurs, SIGLASH Newsletter, 1973, 6, 4:S-11).

In IJCAI-87, Proc. Tenth Intl. Joint Conference on Artificial Intelligence, Milan, Italy: Morgan Kaufmann, 1987, Vol. 1, pp. 264-270.

This paper describes a domain-independent implementation of explanation-based generalization (EBG) within a logic-programming environment. Explanation is interleaved with generalization, so that as the training instance is proven to be a positive example of the goal concept, the generalization is simultaneously created. All aspects of the EBG task are viewed in logic, which provides a clear semantics for EBG, and allows its integration into the logic-programming system. In this light operationally becomes a property requiring explicit reasoning. Additionally, viewing EBG in logic clarifies the relation of learning search-control to EBG, and suggests solutions for dealing with imperfect domain theories.

This report contains the reading list for the Qualifying Examination in Artificial Intelligence. Areas covered include search, representation, reasoning, planning and problem solving, learning, expert systems, vision, robotics, natural language, perspectives and AI programming. An extensive bibliography is also provided.