We describe two uses of meta-level inference: to control the search for a proof; and to derive new control information, and illustrate them in the domain of algebraic equation solving. The derivation of control information is the main focus of the paper. It involves the proving of theorems in the Meta-Theory of Algebra. These proofs are guided by meta-meta-level inference. We are developing a meta-meta-language to describe formulae, and proof plans, and have built a program, IMPRESS, which uses these plans to build a proof. We describe one such proof plan in detail. IMPRESS will form part of a self-improving algebra system
In the first section, five major attempts to solve the problem of induction and their failures are d...
A theory system is a collection of interdependent theories, some if which stand in a meta/object rel...
Proof assistants and the programming languages that implement them need to deal with a range of expr...
We describe two uses of meta-level inference: to control the search for aproof, and to derive new co...
In [Bundy and Sterling 81] we described how meta-level inference was useful for controlling search a...
In this thesis we will be concerned with a particular type of architecture for reasoning systems, k...
Abstract. Formal verification is increasingly used in industry. A pop-ular technique is interactive ...
A compiler-based meta-level system for MetaProlog language is presented. Since MetaProlog is a meta-...
this paper: 1. To clarify the concept of meta-level reasoning (MLR). This concept has been discussed...
The reasoning power of human-oriented plan-based reasoning systems is primarilyderived from their do...
The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their d...
AbstractWe describe a proof dedicated meta-language, called L tac, in the context of t...
AbstractInformal mathematical reasoning has a strong metamathematical component, which is used to ex...
Meta-explaining is useful to a human or an artificial researcher in order to learn how to use its kn...
In this paper, mathematical proofs are conceived as a form of (guided) intentional reasoning. In a p...
In the first section, five major attempts to solve the problem of induction and their failures are d...
A theory system is a collection of interdependent theories, some if which stand in a meta/object rel...
Proof assistants and the programming languages that implement them need to deal with a range of expr...
We describe two uses of meta-level inference: to control the search for aproof, and to derive new co...
In [Bundy and Sterling 81] we described how meta-level inference was useful for controlling search a...
In this thesis we will be concerned with a particular type of architecture for reasoning systems, k...
Abstract. Formal verification is increasingly used in industry. A pop-ular technique is interactive ...
A compiler-based meta-level system for MetaProlog language is presented. Since MetaProlog is a meta-...
this paper: 1. To clarify the concept of meta-level reasoning (MLR). This concept has been discussed...
The reasoning power of human-oriented plan-based reasoning systems is primarilyderived from their do...
The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their d...
AbstractWe describe a proof dedicated meta-language, called L tac, in the context of t...
AbstractInformal mathematical reasoning has a strong metamathematical component, which is used to ex...
Meta-explaining is useful to a human or an artificial researcher in order to learn how to use its kn...
In this paper, mathematical proofs are conceived as a form of (guided) intentional reasoning. In a p...
In the first section, five major attempts to solve the problem of induction and their failures are d...
A theory system is a collection of interdependent theories, some if which stand in a meta/object rel...
Proof assistants and the programming languages that implement them need to deal with a range of expr...