On the feasibility of checking temporal integrity constraints
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
The imperative future: principles of executable temporal logic
The imperative future: principles of executable temporal logic
Temporal Triggers in Active Databases
IEEE Transactions on Knowledge and Data Engineering
On the presence of periodic configurations in Turing machines and in counter machines
Theoretical Computer Science
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Temporal Logic with Predicate "-Abstraction
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Computation: finite and infinite machines
Computation: finite and infinite machines
Hi-index | 0.00 |
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic data interchange. John McCarthy in his Elephant programming language proposal suggested exploiting the referring to the past as the main programming primitive. In this paper we study the computational power of such primitive. In order to do that we propose a refined formal model, History Dependent Machine (HDM), which uses querying the history as its sole computational primitive. Our main result may be spelled in general terms as: a model with a single agent wandering around a pool of resources and having ability to check its own history for simple temporal properties has a universal computational power. Moreover, HDM can simulate any multicounter machine in real time. Then we show that the computations of HDM may be specified in the extension of propositional linear temporal logic by flexible constants, the abstraction operator and equality. We use then universality of HDM model to show that the above extension with a single flexible constant is not recursively axiomatizable.