7 search results - page 1 / 2 » Modeling Disjunctive Constraints with a Logarithmic Number o... |
IPCO
2008
13 years 6 months ago
2008
AAAI
2000
13 years 6 months ago
2000
We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of non-binary constraint satisfaction pro...
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
COCOS
2003
Springer
13 years 10 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
ISSTA
1998
ACM
13 years 9 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...