Results 1  10
of
3,864
Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples
 In Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory
, 1996
"... We consider the problem of learning a polynomial over an arbitrary field F defined on a set of boolean variables. We present the first provably effective algorithm for exactly identifying such polynomials using membership and equivalence queries. Our algorithm runs in time polynomial in n, the numbe ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
We consider the problem of learning a polynomial over an arbitrary field F defined on a set of boolean variables. We present the first provably effective algorithm for exactly identifying such polynomials using membership and equivalence queries. Our algorithm runs in time polynomial in n
Data Integration: A Theoretical Perspective
 Symposium on Principles of Database Systems
, 2002
"... Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interestin ..."
Abstract

Cited by 944 (45 self)
 Add to MetaCart
: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.
Learning Information Extraction Rules for Semistructured and Free Text
 Machine Learning
, 1999
"... . A wealth of online text information can be made available to automatic processing by information extraction (IE) systems. Each IE application needs a separate set of rules tuned to the domain and writing style. WHISK helps to overcome this knowledgeengineering bottleneck by learning text extract ..."
Abstract

Cited by 428 (9 self)
 Add to MetaCart
. A wealth of online text information can be made available to automatic processing by information extraction (IE) systems. Each IE application needs a separate set of rules tuned to the domain and writing style. WHISK helps to overcome this knowledgeengineering bottleneck by learning text
Learning Multivariate Polynomials from Substitution and Equivalence Queries
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 1996
"... It has been shown in previous recent work that multiplicity automata are predictable from multiplicity and equivalence queries. In this paper we generalize related notions in a matrix representation and obtain a basis for the solution of a number of open problems in learnability theory. Membersh ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
, decision trees with integer variables and less than conditions, multivariate polynomials over a finite field and rational functions over a fixed finite field. We also provide results for the case of infinite or large fields.
A Note on Learning Multivariate Polynomials
"... We present a PACleaming algorithm with membership queries for learning any multivariate polynomial over any finite field f under the uniform distribution. The atgorithm runs in time 1 queries where t is the number of terms in the polynomial, 71is the number of variables and IFl is the field size. ..."
Abstract
 Add to MetaCart
We present a PACleaming algorithm with membership queries for learning any multivariate polynomial over any finite field f under the uniform distribution. The atgorithm runs in time 1 queries where t is the number of terms in the polynomial, 71is the number of variables and IFl is the field size
Logic Programming and Negation: A Survey
 JOURNAL OF LOGIC PROGRAMMING
, 1994
"... We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them. ..."
Abstract

Cited by 274 (8 self)
 Add to MetaCart
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them.
What Does a Conditional Knowledge Base Entail?
 Artificial Intelligence
, 1989
"... This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type if . . . then . . . , represents the explicit defeasible knowledge an agent has abo ..."
Abstract

Cited by 271 (6 self)
 Add to MetaCart
This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type if . . . then . . . , represents the explicit defeasible knowledge an agent has
Learning ReadOnce Formulas with Queries
 J. ACM
, 1989
"... A readonce formula is a boolean formula in which each variable occurs at most once. Such formulas are also called ¯formulas or boolean trees. This paper treats the problem of exactly identifying an unknown readonce formula using specific kinds of queries. The main results are a polynomial time al ..."
Abstract

Cited by 117 (19 self)
 Add to MetaCart
A readonce formula is a boolean formula in which each variable occurs at most once. Such formulas are also called ¯formulas or boolean trees. This paper treats the problem of exactly identifying an unknown readonce formula using specific kinds of queries. The main results are a polynomial time
Results 1  10
of
3,864