Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fado...
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Abstract--A method for the computation of nonlinear digital filter networks containing delay-free loops is proposed. By preserving the topology of the network this method permits t...
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...