Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11889/2438
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sayrafi, Bassem | |
dc.date.accessioned | 2016-10-13T05:28:14Z | |
dc.date.available | 2016-10-13T05:28:14Z | |
dc.date.issued | 2005-6 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11889/2438 | |
dc.description.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 | |
dc.language.iso | en | en_US |
dc.publisher | Robert Shuman Center for Advances Studies | en_US |
dc.subject.lcsh | Constraints (Artificial intelligence) | |
dc.subject.lcsh | Differential equations | |
dc.subject.lcsh | Interval analysis (Mathematics) | |
dc.title | Differential Constraints | en_US |
dc.type | Reports | en_US |
newfileds.item-access-type | open_access | en_US |
newfileds.general-subject | Law and Judiciary | en_US |
item.grantfulltext | open | - |
item.languageiso639-1 | other | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Fulltext Publications |
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.