Now showing items 11-20 of 60
`Semantic procedure' is an oxymoron
(Cambridge University Press, 1993)
A Subsumption Architecture for Theorem Proving?
(The Royal Society, 1994-10)
Brooks has criticized traditional approaches to artificial intelligence as too ineffi- cient. In particular, he has singled out techniques involving search as inadequate to achieve the fast reaction times ...
A Recursive Techniques Editor for Prolog
We describe an editor geared to recursive Prolog procedures. It is similar to the structure editors built for many programming languages, except that instead of just ensuring the correctness of the syntax of the procedures ...
Raising the Standard of AI Products
We propose a mechanism for the promotion of high-standards in commercial Artificial Intelligence products, namely an association of companies which would regulate their own membership using a code of practice and the ...
Solving Mechanics Problems Using Meta-Level Inference
In this paper we shall describe a program (MECHO), written in Prolog, which solves a wide range of mechanics problems from statements in both predicate calculus and English. Mecho uses the technique of meta-level ...
Will It Reach the Top? Prediction in the Mechanics World.
We describe an extension of a mechanics problem solving program to the set of “roller coaster” problems, i.e. problems about the motion of a particle on a complex path. The reasoning strategy adopted by the program is ...
AI Bridges and Dreams
This paper is a modified version of my acceptance lecture for the 1986 SPL-Insight Award. It turned into something of a personal credo — describing my view of the nature of AI the potential social benefit of applied ...
Automatic Concept Formation in Pure Mathematics
The HR program forms concepts and makes conjectures in domains of pure mathematics and uses theorem prover OTTER and model generator MACE to prove or disprove the conjectures. HR measures properties of concepts and assesses ...
The New Software Copyright Law
(Oxford University Press, 1994-03)
Turning Eureka Steps into Calculations in Automatic Program Synthesis
A description is given of a technique called middle-out reasoning for the control of search in automatic theorem proving. The authors illustrate it use in the domain of automatic program synthesis. Programs can be synthesised ...