We make a link between a specialized context free language expressing the rules of variety of card games, called CGDL, and the most known generalpurpose game description language GDL-II. We present a systematic translation from CGDL to GDL-II, prove that the translation is correct, and analyze the complexity of resulting code in both theoretical and empirical way.

Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past solutions, showing that a rich range of techniques is available. We then propose a new algorithm, Cupid...

We propose a long-term memory design for artificial general intelligence based on Solomonoff’s incremental machine learning methods. We introduce four synergistic update algorithms that use a Stochastic Context-Free Grammar as a guiding probability distribution of programs. The update algorithms accomplish adjusting production probabilities, re-using previous solutions, learning programming idi...