Results 1  10
of
4,861
Learning FirstOrder Definitions of Functions
 Journal of Artificial Intelligence Research
, 1996
"... Firstorder learning involves finding a clauseform definition of a relation from examples of the relation and relevant background information. In this paper, a particular firstorder learning system is modified to customize it for finding definitions of functional relations. This restriction leads ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
Firstorder learning involves finding a clauseform definition of a relation from examples of the relation and relevant background information. In this paper, a particular firstorder learning system is modified to customize it for finding definitions of functional relations. This restriction leads
Uniform firstorder definitions in finitely generated fields
, 2005
"... We prove that there is a firstorder sentence in the language of rings that is true for all finitely generated fields of characteristic 0 and false for all fields of characteristic> 0. We also prove that for each n ∈ N, there is a firstorder formula ψn(x1,..., xn) that when interpreted in a fi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove that there is a firstorder sentence in the language of rings that is true for all finitely generated fields of characteristic 0 and false for all fields of characteristic> 0. We also prove that for each n ∈ N, there is a firstorder formula ψn(x1,..., xn) that when interpreted in a
Learning FirstOrder Definite Theories via ObjectBased Queries
"... Abstract. We study the problem of exact learning of firstorder definite theories via queries, toward the goal of allowing humans to more efficiently teach firstorder concepts to computers. Prior work has shown that first order Horn theories can be learned using a polynomial number of membership an ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We study the problem of exact learning of firstorder definite theories via queries, toward the goal of allowing humans to more efficiently teach firstorder concepts to computers. Prior work has shown that first order Horn theories can be learned using a polynomial number of membership
Learning logical definitions from relations
 MACHINE LEARNING
, 1990
"... This paper describes FOIL, a system that learns Horn clauses from data expressed as relations. FOIL is based on ideas that have proved effective in attributevalue learning systems, but extends them to a firstorder formalism. This new system has been applied successfully to several tasks taken fro ..."
Abstract

Cited by 935 (8 self)
 Add to MetaCart
This paper describes FOIL, a system that learns Horn clauses from data expressed as relations. FOIL is based on ideas that have proved effective in attributevalue learning systems, but extends them to a firstorder formalism. This new system has been applied successfully to several tasks taken
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1194 (81 self)
 Add to MetaCart
Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder
Knowledge Interchange Format Version 3.0 Reference Manual
, 1992
"... : Knowledge Interchange Format (KIF) is a computeroriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); ..."
Abstract

Cited by 484 (14 self)
 Add to MetaCart
); it is logically comprehensive (i.e. it provides for the expression of arbitrary sentences in the firstorder predicate calculus); it provides for the representation of knowledge about the representation of knowledge; it provides for the representation of nonmonotonic reasoning rules; and it provides
The ordinal numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem and oth ..."
Abstract

Cited by 731 (68 self)
 Add to MetaCart
Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem
The pyramid match kernel: Discriminative classification with sets of image features
 IN ICCV
, 2005
"... Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve for correspondenc ..."
Abstract

Cited by 544 (29 self)
 Add to MetaCart
in the number of features, and it implicitly finds correspondences based on the finest resolution histogram cell where a matched pair first appears. Since the kernel does not penalize the presence of extra features, it is robust to clutter. We show the kernel function is positivedefinite, making it valid
FirstOrder Atom Definitions Extended
, 2001
"... We extend the notion of atom definitions in firstorder formulae by guards. These are conditions restricting the atom definition in a form that frequently occurs in many application areas of automated theorem proving. We give a sufficient and complete criterion for a formula to contain such a defini ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We extend the notion of atom definitions in firstorder formulae by guards. These are conditions restricting the atom definition in a form that frequently occurs in many application areas of automated theorem proving. We give a sufficient and complete criterion for a formula to contain such a
Results 1  10
of
4,861