Logic Programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/coinductive soundness of formulae is a challenging task. For example, the existing state-of-the-art algorithms can only semi-decide coinductive soundness of queries in logic programming for regular formulae. Another, less famous, but...

The public discourse on productive aging as a research and policy initiative has just begun in greater China. Two conferences in Mainland China in 2009 and 2011 and subsequent conferences in Taiwan and Hong Kong in 2012 have set it in motion. Because applied social science research has just started in greater China, researchers in Chinese societies will benefit from the experience and rich lite...

This paper provides a new game theoretic model consistent with the premises of contestable markets. Two firms repeatedly compete for a natural monopoly position. The limit price of the incumbent is disciplined by a hit and run strategy of the entrant. In this model, contrarily to the well known Maskin and Tirole model (1988): i) productive efficiency is encouraged, the more efficient firm gets ...

LetG be a finite group and k be a field of characteristic p > 0. A cohomology class ζ ∈ H(G, k) is called productive if it annihilates Ext∗kG(Lζ , Lζ). We consider the chain complexP(ζ) of projective kG-modules which has the homology of an (n−1)-sphere and whose k-invariant is ζ under a certain polarization. We show that ζ is productive if and only if there is a chain map ∆ : P(ζ) → P(ζ) ⊗ P(ζ)...

When learning a new math concept, should learners be first taught the concept and its associated procedures and then solve problems, or solve problems first even if it leads to failure and then be taught the concept and the procedures? Two randomized-controlled studies found that both methods lead to high levels of procedural knowledge. However, students who engaged in problem solving before be...