DBScholar

Back to papers

Differential Constraints

Summary: Define differential constraints—finite-difference equations on functions 2^U→R; characterize implication via lattice decompositions, give a sound and complete inference system, and prove coNP-completeness. Apply to concise frequent-itemset representations (disjunctive rules) and connect to positive boolean dependencies in relational DBs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h8590a928165cdbb4
Venue
PODS
Year
2005
Pagerank
4.9793485e-05
Overall Rank
13,016 | 12.49%
DOI
10.1145/1065167.1065213

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{sayrafi_pods05,
        address = {New York, NY, USA},
        series = {{PODS} '05},
        title = {{Differential Constraints}},
        url = {https://dl.acm.org/doi/10.1145/1065167.1065213},
        doi = {10.1145/1065167.1065213},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Sayrafi, Bassem and Van Gucht, Dirk},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
29 Fast Algorithms for Mining Association Rules 1994 VLDB 0.0005121339
1,710 A Normal Form for XML Documents 2002 PODS 9.8199787e-05
3,190 Information Dependencies 2000 PODS 7.5524237e-05
8,718 Computational Complexity of Itemset Frequency Satisfiability 2004 PODS 5.2905577e-05
8,719 Multi-valued Dependencies in the Presence of Lists 2004 PODS 5.2905577e-05
8,724 A Condensed Representation to Find Frequent Patterns 2001 PODS 5.2905577e-05
Previous Page 1 / 1 Next

Semantically Similar Papers