Sciweavers

4128 search results - page 36 / 826
» Learning and using relational theories
Sort
View
JSYML
2007
75views more  JSYML 2007»
13 years 9 months ago
Stable definability and generic relations
Abstract. An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the φ-definitions of p ...
Byunghan Kim, Rahim Moosa
ACL
2012
12 years 8 days ago
Pattern Learning for Relation Extraction with a Hierarchical Topic Model
We describe the use of a hierarchical topic model for automatically identifying syntactic and lexical patterns that explicitly state ontological relations. We leverage distant sup...
Enrique Alfonseca, Katja Filippova, Jean-Yves Delo...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 3 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
FSTTCS
2001
Springer
14 years 2 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
COLT
2007
Springer
14 years 4 months ago
Property Testing: A Learning Theory Perspective
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
Dana Ron