4128 search results - page 36 / 826 » Learning and using relational theories |
145
Voted
JSYML
2007
15 years 5 months ago
2007
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 ...
182
click to vote
ACL
2012
13 years 8 months ago
2012
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...
146
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
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...
149
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
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...
157
click to vote
COLT
2007
Springer
15 years 12 months ago
2007
Springer
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...