Dexter Kozen: Computational complexity, program logic and semantics, computational algebra.
This technique allows reducing power consumption, delay and area of digital circuits, while maintaining low complexity of logic design.
My primary research interests lie in complexity theory, logic and program security, but I maintain a working interest in category theory and combinatorial geometry.
However, this would be impractical because it would lead to two clock domains in equipment that require blanking intervals, and this would cause unnecessary complexity in logic design.
This paper presents the design of an energy management strategy based on a low complexity Fuzzy Logic Control (FLC) for grid power profile smoothing of a residential grid-connected microgrid including Renewable Energy Sources RESS) and battery Energy Storage System (ESS).
In this work, we propose a deterministic approach based on the currently known lower and upper bounds of multiplicative complexity for logic minimization problems with not more than five inputs.
Kozen's citation is for "pioneering and seminal work in fields as diverse as complexity theory, logics of programs, algebra, computer algebra and probabilistic semantics".
His research interests are in the fields of modal logics, hybrid logics, decidability, and computational complexity of non-classical logics, tableau calculi, and applications of logics in modeling human interactions.
In the context of descriptive complexity theory, a logic \(\mathcal{L}\) is taken to be an extension of the language of first-order logic with one or more classes of additional expressions such as higher-order quantifiers or fixed-point operators.
