Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Default logic, one of the best known formalisms to express common sense reasoning, does not allow to reason by cases in its standard formulations. We propose a natural and easy way...
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
An approach to exible hyperbase hypertext database support predicated on the notion of extensibility is presented. The extensible hypertext platform Hyperform implements basic hyp...