This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, wh...
An ontology is a speci...cation of a conceptualization, a shared understanding of some domain of interest. The paper develops an algorithm that hierarchically groups words together...
In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptio...
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...