A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
The implication problem for data dependencies
[chapter]
1981
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we study the implication and the finite implication problems for data dependencies. ...
For non-total dependencies the implication problem is unsolvable, and the finite implication problmm is not even partially solvable. Thus, there can be no formal system for finite implication. ...
The (finite) implication problem of type (C I ; C2), where C I and C 2 are classes of dependencies is the (finite) implication problem for D = C I and d E C 2, That is, for such D,d decide whether D ~( ...
doi:10.1007/3-540-10843-2_7
fatcat:hgnu5bqkg5bcbapm6a4zekxb4q
Constraint-Generating Dependencies
1999
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
problem obtained by reducing the dependency implication problem. ...
The main technical results in the paper are a general decision procedure for the implication and consistency problems for constraint-generating dependencies, and complexity results for speci c classes ...
We wish to acknowledge anonymous referees for several helpful comments. ...
doi:10.1006/jcss.1999.1632
fatcat:5gyv24sctzdpxor525rx4x2cyi
Page 4566 of Mathematical Reviews Vol. , Issue 98G
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Unfortunately, and despite the fact that the implication problem for both classes separately is decidable in linear time, the implication problem for functional and inclusion dependencies combined is known ...
The authors prove that, unlike the implication problem for func- tional and arbitrary inclusion dependencies, the implication prob- lem for null functional and arbitrary null inclusion dependencies is ...
Constraint-generating dependencies
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
decision problem obtained by reducing the dependency implication problem. ...
The main technical results in the paper are a general decision procedure for the implication and consistency problems for constraint-generating dependencies and complexity results for specific classes ...
By Lemma 3.3, the implication problem for typed 2-dependencies coincides with the implication problem over 2-tuple relations. ...
doi:10.1007/3-540-58907-4_25
fatcat:isagkiqduzgqviis2vq563a3mu
Constraint-generating dependencies
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
decision problem obtained by reducing the dependency implication problem. ...
The main technical results in the paper are a general decision procedure for the implication and consistency problems for constraint-generating dependencies and complexity results for specific classes ...
By Lemma 3.3, the implication problem for typed 2-dependencies coincides with the implication problem over 2-tuple relations. ...
doi:10.1007/3-540-58601-6_102
fatcat:o2vbr3k5vngrvf76ia237laene
Independence in Database Relations
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We investigate the implication problem for independence atoms X ⊥ Y of disjoint attribute sets X and Y on database schemata. ...
Our results establish independence atoms as an efficient subclass of embedded multivalued data dependencies which are not axiomatizable by a finite set of Horn rules, and whose implication problem is undecidable ...
This research is supported by the Marsden Fund Council from Government funding, administered by the Royal Society of New Zealand, and grants 264917 and 251557 of the Academy of Finland. ...
doi:10.1007/978-3-642-39992-3_17
fatcat:wnaz3pqabffa3hmfjvdu2lhagm
L'analyse implicative bayésienne : une méthode pour l'étude des dépendances orientées. 2. Modèle logique sur un tableau de contingence
1996
Mathématiques et sciences humaines
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Modèle logique sur un tableau de contingence Bayesian implicative analysis, a method for the study of oriented dependencies. 2. Logical model on a contingency table ...
Mathématiques et sciences humaines Mathematics and social sciences 135 | 1996 Varia L'analyse implicative bayésienne : une méthode pour l'étude des dépendances orientées. 2. ...
Modèle logique sur un tableau de contingence Bayesian implicative analysis, a method for the study of oriented dependencies. ...
doi:10.4000/msh.2734
fatcat:knyu67gkxra4lgvqnbisisge2i
On the Interaction of Functional and Inclusion Dependencies with Independence Atoms
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Infamously, the finite and unrestricted implication problems for the classes of i) functional and inclusion dependencies together, and ii) embedded multivalued dependencies alone are each undecidable. ...
We establish a series of results for implication problems over subclasses of the combined class of functional and inclusion dependencies as well as independence atoms. ...
While the importance of data dependencies continues to hold for new data models, the focus of this article is on the finite and unrestricted implication problems for important classes of data dependencies ...
arXiv:2101.02466v1
fatcat:3ic6kbo7zvdxvmz2yqpmzbhkkm
Dependencies revisited for improving data quality
2008
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Recently there has been renewed interest in dependencies for improving the quality of data. ...
The increasing demand for data quality technology has also motivated revisions of classical dependencies, to capture more inconsistencies in real-life data, and to match, repair and query the inconsistent ...
I thank Philip Bohannon, Floris Geerts, Xibei Jia, Anastasios Kementsietsidis and Shuai Ma, for working with me on data quality. ...
doi:10.1145/1376916.1376940
dblp:conf/pods/Fan08
fatcat:uyfve5cp4vfwfph3i7mfrus3yq
A controller redesign technique to enhance testability of controller-data path circuits
1998
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
A design-for-testability (DFT) technique is developed to redesign the controller such that the implications which may produce conflicts during test pattern generation are eliminated. ...
Since there is a superlinear dependence of CPU time on grid size (approximately O N 1:501:75 in 2-D), the resulting speed up can be significant even in less critical cases where convergence problems are ...
The inhibiting implications for the example controller-data path circuit of the IIR filter are shown marked in the dependency-implication graphs in Fig. 8 . ...
doi:10.1109/43.681265
fatcat:f2n4upaz4jgjhcbrwgksbwuxnu
On Independence Atoms and Keys
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we establish a finite axiomatization for the general implication problem, and show that the finite implication problem does not enjoy a k-ary axiomatization for any k. ...
We show that the finite and the general implication problems are already different for keys and unary independence atoms. ...
One of the core problems studied for approximately 100 different classes of relational data dependencies alone are their associated implication problems [18] . ...
arXiv:1404.4468v1
fatcat:ixzpe6vhubefvf5nblstaw6yoy
Analyses and Validation of Conditional Dependencies with Built-in Predicates
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
(a) One concerns the satisfiability and implication problems for cfd p s and cind p s, taken separately or together. ...
These are important for, e.g., deciding whether data quality rules are dirty themselves, and for removing redundant rules. ...
The satisfiability problem for cfd p s and cind p s is undecidable.2
The Implication Analysis The implication problem is to determine, given a set Σ of dependencies and another dependency φ, whether ...
doi:10.1007/978-3-642-03573-9_48
fatcat:r5lwc2wuqjc4hifwcjsfvwnfim
Satisfaction and Implication of Integrity Constraints in Ontology-based Data Access
2019
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We establish decidability and complexity bounds for all these problems in the case where ontologies are expressed in DL-LiteR and constraints range from functional dependencies to disjunctive tuple-generating ...
We extend ontology-based data access with integrity constraints over both the source and target schemas. ...
Acknowledgements Research supported by the SIRIUS Centre for Scalable Data Access and the EPSRC projects DBOnto, MaSI 3 , and ED 3 . ...
doi:10.24963/ijcai.2019/253
dblp:conf/ijcai/NikolaouGKKH19
fatcat:brspgkoeqrawri3xz22lxcg46m
Some decision and counting problems of the Duquenne–Guigues basis of implications
2008
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we show how implications are reduced to functional dependencies and prove that the problem of determining the size of the stem base is a #P-complete problem. ...
Implications of a formal context obey Armstrong rules, which allows one to define a minimal (in the number of implications) implication basis, called Duquenne-Guigues basis or stem base in the literature ...
Khachiyan on the theory of computational complexity held in the early 1980s at the Computer Center of the USSR Academy of Sciences (Moscow). ...
doi:10.1016/j.dam.2007.04.014
fatcat:lb5vnl4fnfckjpgvvbskirhs6a
Page 417 of Educational and Psychological Measurement Vol. 59, Issue 3
[page]
1999
Educational and Psychological Measurement
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Although the example of absences is used throughout to help demon- strate the implications of this piece for a human resource problem, this work has implications beyond this single domain. ...
This article is intended to contribute to the understanding of the implications of various methodological approaches for analyzing count data. ...
« Previous
Showing results 1 — 15 out of 1,879,676 results