346 search results - page 6 / 70 » Solving quantified constraint satisfaction problems |
97
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
120
click to vote
CCS
2001
ACM
15 years 8 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
124
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
138
click to vote
IJCAI
2003
15 years 4 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
122
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...