Automated reasoning about key sets

DOI10.1007/978-3-319-94205-6_4MaRDI QIDQ1799066zbMATH OpenOpenAlexFDO

Authors Miika Hannula, Sebastian Link

Publication date 18 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94205-6_4

Mathematics Subject Classification ID

Database theory (68P15) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• On the finite and general implication problems of independence atoms and keys
• Possibilistic keys
• scientific article; zbMATH DE number 4041340
• scientific article; zbMATH DE number 4062653
• scientific article; zbMATH DE number 3913729

Cited in

(3)

• Possibilistic keys
• Integrating ADTs in KeY and their application to history-based reasoning about collection
• Controlling entity integrity with key sets

This page was built for publication: Automated reasoning about key sets

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