Results 1 
6 of
6
Knowledge Representation, Computation, and Learning in Higherorder Logic
 In preparation
, 2001
"... This paper contains a systematic study of the foundations of knowledge representation, computation, and learning in higherorder logic. First, a polymorphicallytyped higherorder logic, whose origins can be traced back to Church's simple theory of types, is presented. A model theory and proof theor ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
This paper contains a systematic study of the foundations of knowledge representation, computation, and learning in higherorder logic. First, a polymorphicallytyped higherorder logic, whose origins can be traced back to Church's simple theory of types, is presented. A model theory and proof theory for this logic are developed and basic theorems relating these two are given. A metric space of certain closed terms, which provides a rich language for representing individuals, is then studied. Also a method of systematically constructing predicates on such individuals is given. The technique of programming with abstractions is illustrated. Major applications of the logic to declarative programming languages and machine learning are indicated. 1
Agnostic) PAC learning concepts in higherorder logic
 In: Proc. 17th European Conference on Machine Learning (ECML 2006). Springer, LNAI 4212 (2006) 711–718
, 2006
"... Abstract. This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higherorder logic setting introduced by Lloyd et al. In particular, it is shown that the similarity between learning in higherorder logic and traditional attributevalue learning ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higherorder logic setting introduced by Lloyd et al. In particular, it is shown that the similarity between learning in higherorder logic and traditional attributevalue learning allows many results from computational learning theory to be ‘ported ’ to the logical setting with ease. As a direct consequence, a number of nontrivial results in the higherorder setting can be established with straightforward proofs. Our satisfyingly simple analysis provides another case for a more indepth study and wider uptake of the proposed higherorder logic approach to symbolic machine learning. 1
Predicate selection for structural decision trees
 Proceedings of the 15th International Conference on Inductive Logic Programming, LNAI3625
, 2005
"... Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in classification learning, where we reconsider the use of accuracy as a predicate selection function and show that, on practi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in classification learning, where we reconsider the use of accuracy as a predicate selection function and show that, on practical grounds, it is a better alternative to other commonly used functions. The second is in regression learning, where we consider the standard mean squared error measure and give a predicate pruning result for it. 1
Predictive Toxicology using a Decisiontree Learner
"... Introduction This extended abstract outlines a submission to The Predictive Toxicology Challenge for 20002001 [PTC]. The Challenge is to obtain models that predict the outcome of biological tests for the toxicity of chemicals using information related to chemical structure only. The models reported ..."
Abstract
 Add to MetaCart
Introduction This extended abstract outlines a submission to The Predictive Toxicology Challenge for 20002001 [PTC]. The Challenge is to obtain models that predict the outcome of biological tests for the toxicity of chemicals using information related to chemical structure only. The models reported here are based on the approach outlined in [BGCL00]. (Much more detail is given in [BGCL01].) In essence, the learning system is a decisiontree system. However, it is rather more general than conventional decisiontree learners in that it allows the individuals that are to be classified to be represented as certain terms in a higherorder logic rather than as simple feature vectors. The logic allows the use of sets, multisets, lists, graphs and so on, to represent individuals, thereby capturing complex structural information about the individuals [Llo01]. This information is highly relevant to the main aim of the Challenge, which is to predict toxicity from the chemical structure
Alkemy: A Learning System based on an . . .
, 2004
"... This paper describes the design and analysis of a system developed to learn comprehensible theories from structured data. The underlying knowledge representation formalism is a polymorphicallytyped higherorder logic. To model structured data, a class of terms suitable for representing a wide ran ..."
Abstract
 Add to MetaCart
This paper describes the design and analysis of a system developed to learn comprehensible theories from structured data. The underlying knowledge representation formalism is a polymorphicallytyped higherorder logic. To model structured data, a class of terms suitable for representing a wide range of data is identified. To encode structural boolean features, a class of predicates that can be built up by composition of simple functions is introduced. For any particular application, we give a mechanism to define and enumerate a set of relevant predicates. To construct comprehensible theories, we adopt the family of decisiontree algorithms, which include the standard topdown induction algorithm for learning decision trees, and the covering algorithm for learning decision lists. We show how these algorithms can be extended to work with structured data and complex predicates in both the batch and online settings. Using classical learningtheoretic results, we analyse the generalisation performance of our algorithms. The utility of the system is demonstrated with applications in the areas of bioinformatics and intelligent agents.