Abstract state machines and computationally complete query languages
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1670504
- Abstract state machines and the inquiry process
- scientific article; zbMATH DE number 2172808
- A complete logic for database abstract state machines
- The computable kernel of abstract state machines
- scientific article; zbMATH DE number 1841822
- scientific article; zbMATH DE number 1670503
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- Model checking abstract state machines with answer set programming
Cites work
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- scientific article; zbMATH DE number 3885853 (Why is no real title available?)
- scientific article; zbMATH DE number 3142195 (Why is no real title available?)
- scientific article; zbMATH DE number 8772 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Choiceless polynomial time
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Infinitary logics and 0-1 laws
- Object identity as a query language primitive
- On the completeness of object-creating database transformation languages
- Procedural languages for database queries and updates
- The expressive power of complex values in object-based data models
Cited in
(10)- Query Completeness of Skolem Machine Computations
- The computable kernel of abstract state machines
- scientific article; zbMATH DE number 2172808 (Why is no real title available?)
- Database Theory, Yuri, and Me
- An abstract machine for efficiently computing queries to well-founded models
- scientific article; zbMATH DE number 7533347 (Why is no real title available?)
- Finite-State Map-Reduce Computation and Relational Algebra Queries
- scientific article; zbMATH DE number 1670504 (Why is no real title available?)
- Why Sets?
- A proof system with bounded non-determinism in database transformations
This page was built for publication: Abstract state machines and computationally complete query languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854519)