Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11889/2438
Title: | Differential Constraints | Authors: | Sayrafi, Bassem | Issue Date: | Jun-2005 | Publisher: | Robert Shuman Center for Advances Studies | 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 | URI: | http://hdl.handle.net/20.500.11889/2438 |
Appears in Collections: | Fulltext Publications |
Show full item record
Page view(s)
124
Last Week
0
0
Last month
2
2
checked on Apr 14, 2024
Download(s)
59
checked on Apr 14, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.