When you lose a game of chess to a computer then don't pretend that you didn't think at the game.

This paper describes some work on automatically generating finite counterexamples in topology, and the use of counterexamples to speed up proof discovery in intermediate analysis, and gives some examples theorems where human provers are aided in proof discovery by the use of examples.

In recent years there has been a great deal of interest in the commercial applications of knowledge-based (KB) systems (commonly called expert systems). Interest in KB systems was spurred on by the development of programs that can solve complex tasks at an expert level.

Current subprojects include applications of the program Gerring.

Palladio is an experimental system for designing very lame scale integrated (VLSI) circuits.

Scientific Dateline Heuristic Programming Project May 1983 Report No. HPP-83-1 5 (Revised June 1983)

OMEN is an object-oriented programming system designed for use in a FRANI LISP or other similar programming environment. OMEN stands for OHiccr MANIPULATION ENVIRONNIFN r, and consists of a set of functions to be loaded on top of a!ASP system running MRS. The user can the use the functions provided by OMEN to create classes of objects, instances of those classes, and functions that operate on those objects, and to send messages to those objects. OMEN is similar in design and operation to the flavors system of Lisp Machine lisp and the LOOPS system for the Xerox Dolphin. OMEN was originally designed as a programming eny ironmcnt for an objectoriemed graphics system, but the system should be useful for many different applications. OMEN is not a programming language. It is a way of abstracting the data structures a program must use and the functions that operate on those data structures.

Overview of GLISP GLISP is a LISP-based language which provides high-level language features not found in ordinary LISP. The GLISP language is implemented by means of a compiler which accepts GLISP as input and produces ordinary LISP as output; this output can be further compiled to machine code by the LISP compiler. The goal of GLISP is to allow structured objects to be reft-trenced in a convenient, succinct language, and to allow the structures of objects to be changed without changing the code which references the objects. The syntax of many GLISP constructs is English-like; much of the power and brevity of GLISP derive from the compiler features necessary to support the relatively informal.

This article is concerned with the general question of how to represent biological knowledge in computers such that it may be used in multiple problem solving tasks. In particular, I present a model of a bacterial gene regulation system that is used by a program that simulates gene regulation experiments, and by a second program that formulates hypotheses to account for errors in predicted experiment outcomes. This article focuses on the issues of representation and simulation; for more information on the hypothesis formation task see (Karp, 1989; Karp, 1990). The bacterial gene regulation system of interest is the tryptophan (trp) operon of E. coli (Yanofsky, 1981). The genes that it contains code for enzymes that synthesize the amino acid tryptophan.

An early expression of this difficulty is the socalled might be stated that Socrates's birthplace was Athens.