4117 search results - page 15 / 824 » On the Satisfiability of Complex Constraints |
LATA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
TCS
2008
14 years 9 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
PODS
2004
ACM
15 years 9 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
COCO
1994
Springer
15 years 1 months ago
1994
Springer