86 search results - page 3 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
123
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
174
click to vote
CP
2009
Springer
16 years 8 days ago
2009
Springer
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
86
Voted
DCG
1999
14 years 11 months ago
1999
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
HEURISTICS
2008
14 years 10 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
101
Voted
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...