A proof system with bounded non-determinism in database transformations

DOI10.1007/978-3-642-23441-5_7MaRDI QIDQ3092325zbMATH OpenOpenAlexFDO

Authors Qing Wang

Publication date 16 September 2011

Published in Semantics in Data and Knowledge Bases (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1885/66915

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15)

Recommendations

• A complete logic for database abstract state machines
• scientific article; zbMATH DE number 5855088
• Towards a Logic for Abstract MetaFinite State Machines
• XML database transformations
• Abstract state machines and computationally complete query languages

Cites work

• Abstract State Machines
• scientific article; zbMATH DE number 5855088 (Why is no real title available?)
• scientific article; zbMATH DE number 408807 (Why is no real title available?)
• scientific article; zbMATH DE number 683369 (Why is no real title available?)
• scientific article; zbMATH DE number 755666 (Why is no real title available?)
• scientific article; zbMATH DE number 1841822 (Why is no real title available?)
• Metafinite model theory
• Sequential abstract-state machines capture sequential algorithms
• Towards a Logic for Abstract MetaFinite State Machines

Cited in

(5)

• XML database transformations
• A Transformational Approach for Proving Properties of the CHR Constraint Store
• A complete logic for database abstract state machines
• Towards a Logic for Abstract MetaFinite State Machines
• Procedural languages for database queries and updates

This page was built for publication: A proof system with bounded non-determinism in database transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092325)