Mining approximate interval-based temporal dependencies
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1458810 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Modal Logic for Chopping Intervals
- Algorithms for inferring functional dependencies from relations
- Approximate inference of functional dependencies from relations
- Complete and terminating tableau for the logic of proper subinterval structures over dense orderings
- Encyclopedia of Database Systems
- Interval-based temporal functional dependencies: specification and verification
- Maintaining knowledge about temporal intervals
- Minimal-change integrity maintenance using tuple deletions
- On the complexity of inferring functional dependencies
- Some simplified NP-complete graph problems
- Tableaux for logics of subinterval structures over dense orderings
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- The undecidability of the logic of subintervals
- Why is it hard to obtain a dichotomy for consistent query answering?
Cited in
(6)- Interval-based temporal functional dependencies: specification and verification
- scientific article; zbMATH DE number 6434296 (Why is no real title available?)
- Predictive mining of multi-temporal relations
- Minimal bases of temporal attribute implications
- Evaluation of temporal datasets via interval temporal logic model checking
- Extracting interval temporal logic rules: a first approach
This page was built for publication: Mining approximate interval-based temporal dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329410)
