Differential constraints

Authors:
Bassem Sayrafi;Dirk Van Gucht
Affiliations:
Indiana University, Bloomington, IN;Indiana University, Bloomington, IN
Venue:
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2005

Citing 16
Cited 5

Statistical treatment of the information content of a database

Information Systems
Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”

Journal of the ACM (JACM)
An Infornation-Theoretic Analysis of Relational Databases Part I: Data Dependencies and Information Metric

IEEE Transactions on Software Engineering
Elements of relational database theory

Handbook of theoretical computer science (vol. B)
Functional dependencies in relational databases: a lattice point of view

Discrete Applied Mathematics - Special issue on combinatorial problems in databases
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic

Journal of the ACM (JACM)
Information dependencies

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A condensed representation to find frequent patterns

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A normal form for XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mining All Non-derivable Frequent Itemsets

PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators

PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Reasoning about Uncertainty

Reasoning about Uncertainty
Computational complexity of itemset frequency satisfiability

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Multi-valued dependencies in the presence of lists

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Characterization and armstrong relations for degenerate multivalued dependencies using formal concept analysis

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis

On the effectiveness and efficiency of computing bounds on the support of item-sets in the frequent item-sets mining problem

Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
The implication problem for measure-based constraints

Information Systems
Itemset frequency satisfiability: Complexity and axiomatization

Theoretical Computer Science
Logical inference algorithms and matrix representations for probabilistic conditional independence

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Logical and algorithmic properties of stable conditional independence

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Differential constraints are a class of finite difference equations specified over functions from the powerset of a finite set into the reals. We characterize the implication problem for such constraints in terms of lattice decompositions, and give a sound and complete set of inference rules. We relate differential constraints to a subclass of propositional logic formulas, allowing us to show that the implication problem is coNP-complete. Furthermore, we apply the theory of differential constraints to the problem of concise representations in the frequent itemset problem by linking differential constraints to disjunctive rules. We also establish a connection to relational databases by associating differential constraints to positive boolean dependencies.