Minimal bases of temporal attribute implications
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73588550" target="_blank" >RIV/61989592:15310/18:73588550 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/content/pdf/10.1007%2Fs10472-018-9576-z.pdf" target="_blank" >https://link.springer.com/content/pdf/10.1007%2Fs10472-018-9576-z.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10472-018-9576-z" target="_blank" >10.1007/s10472-018-9576-z</a>
Alternative languages
Result language
angličtina
Original language name
Minimal bases of temporal attribute implications
Original language description
We deal with dependencies in object-attribute data which is recorded at separate points in time. The data is formalized by finitely many tables encoding the relationship between objects and attributes and each table can be seen as single formal context observed at separate point in time. Given such data, we are interested in concise ways of characterizing all if-then dependencies between attributes that hold in the data and are preserved in all time points. In order to formalize the dependencies, we use particular if-then rules called attribute implications annotated by time points which can be seen as particular formulas of linear temporal logic. We introduce non-redundant bases of dependencies from data as non-redundant sets entailing exactly all dependencies that hold in the data. In addition, we investigate minimality of bases as stronger form of non-redundancy. For given data, we present description of minimal bases using the notion of pseudo-intents generalized in the temporal setting. The present paper is a continuation of our previous paper on entailment of attribute implications annotated by time points.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA14-11585S" target="_blank" >GA14-11585S: Relational Similarity-Based Databases</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
ISSN
1012-2443
e-ISSN
—
Volume of the periodical
83
Issue of the periodical within the volume
1
Country of publishing house
CH - SWITZERLAND
Number of pages
25
Pages from-to
73-97
UT code for WoS article
000434143900003
EID of the result in the Scopus database
2-s2.0-85045036731