For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Abstract. We propose a very general syntactical notion of epistemic state and a compact axiomatization for iterated revision when the new information is an epistemic state. We set ...
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...