Browsing Informatics Publications by Issue Date
Now showing items 120 of 291

Will It Reach the Top? Prediction in the Mechanics World.
(Elsevier, 197804)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 ... 
Solving Mechanics Problems Using MetaLevel Inference
(1979)In this paper we shall describe a program (MECHO), written in Prolog[14], which solves a wide range of mechanics problems from statements in both predicate calculus and English. Mecho uses the technique of metalevel ... 
Solving Symbolic Equations with PRESS
(1982)We outline a program, PRESS (PRolog Equation Solving System) for solving symbolic, transcendental, nondifferential equations. The methods used for solving equations are described, together with the service facilities. The ... 
What Is The WellDressed AI Educator Wearing Now?
(AAAI, 198203)A funny thing happened to me at IJCAI81. I went to a panel on "Education in AI" and stepped back into an argument that I had thought settled several years ago. The debate was between the "scruffies," led by Roger Schank ... 
Intelligent Front Ends
(1984)An intelligent front end is a userfriendly interface to a software package, which uses Artificial Intelligence techniques to enable the user to interact with the computer using his/her own terminology rather than that ... 
A Generalized Interval Package and its Use for Semantic Checking
(Transactions on Mathematical Software, 198412) 
Raising the Standard of AI Products
(1985)We propose a mechanism for the promotion of highstandards in commercial Artificial Intelligence products, namely an association of companies which would regulate their own membership using a code of practice and the ... 
Incidence Calculus: A Mechanism for Probabilistic Reasoning
(D. Reidet Publishing Company, 1985)Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. We argue that a purely numeric mechanism, ... 
Discovery and Reasoning in Mathematics
(1985)We discuss the automation of mathematical reasoning, surveying the abilities displayed by human mathematicians and the computational techniques available for automating these abilities. We argue the importance of the ... 
Correctness criteria of some algorithms for uncertain reasoning using Incidence Calculus
(SpringerLink, 198606)Incidence Calculus is a technique for associating uncertainty values with logical sentences. These uncertainty values are called incidences and they are sets of points, which may be thought of as representing equivalence ... 
Special Purpose, but Domain Independent, Inference Mechanisms
(1987)vie describe a number of special purpose, but domain independent, inference mechanisms. While these rl1echanisms are limited to certain kinds of inference and illference rules, they do not rely ... 
AI Bridges and Dreams
(SpringerLink, 198707)This paper is a modified version of my acceptance lecture for the 1986 SPLInsight Award. It turned into something of a personal credo — describing my view of the nature of AI the potential social benefit of applied ... 
The Use of Explicit Plans to Guide Inductive Proofs
(SpringerLink, 198805)We propose the use of explicit proof plans to guide the search for a proof in automatic theorem proving. By representing proof plans as the specifications of LCFlike tactics, [Gordon et al 79], and by recording these ... 
The Use of Prolog for Improving the Rigour and Accessibility of Ecological Modelling
(Elsevier, 198907)We introduce three concepts that offer considerable benefit to the process of ecological modelling: the descriptive representation of models; the explicit representation of knowledge about how to model; and the development ... 
The ECO Program Construction System: Ways of Increasing its Representational Power and their Effects on the User Interface
(Elsevier, 198907)There is a growing interest in programs which help users with little experience of computing to construct simulation models. Much recent development work on such systems has utilized comparatively simple mathematical methods ... 
Turning Eureka Steps into Calculations in Automatic Program Synthesis
(1990)A description is given of a technique called middleout 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 ... 
Extensions to the RipplingOut Tactic for Guiding Inductive Proofs
(Springer Verlag, 1990)In earlier papers we described a technique for automatically constructing inductive proofs, using a heuristic search control tactic called ripplingout. Further testing on harder examples has shown that the ripplingout ... 
A Semantics for Static Type Inference
(SPRINGER VERLAG, 1991)Curry’s system for Fdeducibility is the basis for static type inference algorithms for programming languages such as ML. If a natural “preservation of types by conversion” rule is added to Curry’s system, it becomes ...