Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
Abstract. ComputationalsystemsareoftenrepresentedbymeansofKripkestructures, and related using simulations. We propose rewriting logic as a flexible and executable framework in whi...
Abstract. Noting that the usual `propositionally' based way of composing retrenchments can yield many `junk' cases, alternative approaches to composition are introduced (...