Minimal bases of temporal attribute implications

DOI10.1007/s10472-018-9576-zzbMath1448.68412OpenAlexW2791510784MaRDI QIDQ722104

Jan Triska, Vilem Vychodil

Publication date: 20 July 2018

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-018-9576-z

zbMATH Keywords

Galois connectionformal concept analysisattribute implicationnon-redundancyminimal basetemporal data

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (1)

LinCbO: fast algorithm for computation of the Duquenne-Guigues basis

Cites Work

• On the complexity of enumerating pseudo-intents
• Logic of temporal attribute implications
• Inter-transactional association rules for multi-dimensional contexts for prediction and their application to studying meteorological data
• Two Basic Algorithms in Concept Analysis
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Minimum Covers in Relational Database Model
• Functional Dependencies in a Relational Database and Propositional Logic
• Conceptual Structures at Work
• Decomposition of a Data Base and the Theory of Boolean Switching Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal bases of temporal attribute implications