Abstract. A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are i...
In this paper, we comparatively analyze some mainstream calculi for mobility and distribution, together with some of their variants: asynchronous -calculus, distributed -calculus,...
Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtai...
This paper presents a survey of the use of resolution in propositional satisfiability, and some preliminary results from the implementation of a hybrid resolution and search algor...