We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
Many sensor network applications monitor continuous phenomena by sampling, and fit time-varying models that capture the phenomena's behaviors. We introduce Pulse, a framework...
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...