On the decidability of the termination problem of active database systems
From MaRDI portal
Recommendations
- A dynamic approach to termination analysis for active database rules
- Constraint-based termination analysis for cyclic active database rules
- Refined rules termination analysis through transactions.
- An abstract interpretation framework for termination analysis of active rules
- scientific article; zbMATH DE number 1203021
Cites work
- Active database features in SQL3
- Boundedness is undecidable for datalog programs with a single recursive rule
- Computing with first-order logic
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Procedural languages for database queries and updates
- QRT FIFO automata, breadth-first grammars and their relations
- Semantics and expressiveness issues in active databases
- Undecidable boundedness problems for datalog programs
- Undecidable optimization problems for database logic programs
Cited in
(7)- A dynamic approach to termination analysis for active database rules
- Constraint-based termination analysis for cyclic active database rules
- Invariance, maintenance, and other declarative objectives of triggers -- a formal characterization of active databases
- scientific article; zbMATH DE number 1203021 (Why is no real title available?)
- An abstract interpretation framework for termination analysis of active rules
- Expressiveness issues and decision problems for active database event queries
- Detecting termination of active database rules using symbolic model checking
This page was built for publication: On the decidability of the termination problem of active database systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884939)
