A conditional term rewriting system is called logical if it has the same logical strength as the underlying conditional equational system. In this paper we summarize known logicality results and we present new suucient conditions for logicality of the important class of oriented conditional term rewriting systems.
This report accounts for some of the main results obtained by the author during a short research visit at the Saarland University, in Germany. 1 In this work, we deal with the question of modeling programming exercises for novices pointing to an e-Learning scenario. Our purpose is to identify basic requirements, raise some key questions and propose… (More)