Loading...
Please wait, while we are loading the content...
Similar Documents
Towards inductive generalisation in higher order logic (1992)
| Content Provider | CiteSeerX |
|---|---|
| Author | Feng, Cao Muggleton, Stephen |
| Description | In many cases, higher order (Eorn) clauses are more suited to express certain concepts when relatione between predicates exist. Howevet, to date there has been no appropriate higher order formalism within *hi"h uffi"i"nt inductive generalisation can be carried out. This paper describes inductive generalisation in M ¡- a higher order formalism which not only retains the expressiveness of À-calculus but aleo pre' vides for effective and efficient inductive generalisation. The main strength of Er is lwofold: it is a higher formalism exüension of the (ctausat) first order logic and it cau be mecùanised in a way similar to the first order case in Horn clause form ' For a class of restricted M¡, their least general generalisation (tGG) is unique, and so is their most general unification- Inductive generatisatiãn in Mr is implemented in the algorithm HOIGG. This algorithm has been applied to some interesting induction problems in the induction of higher order rule templates and automatic program transformation. 1 |
| File Format | |
| Language | English |
| Publisher | Morgan Kaufman |
| Publisher Date | 1992-01-01 |
| Publisher Institution | Proceedings of the Ninth International Workshop on Machine Learning |
| Access Restriction | Open |
| Subject Keyword | General Generalisation Many Case Automatic Program Transformation General Unification Inductive Generatisati Main Strength Aleo Pre Certain Concept Hi Uffi Interesting Induction Problem Order Rule Template Order Formalism Efficient Inductive Generalisation Formalism Ex Ension Order Logic Algorithm Hoigg Towards Inductive Generalisation Inductive Generalisation First Order Case Horn Clause Form |
| Content Type | Text |
| Resource Type | Article |
