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 ...
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...
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, ...
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...
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...