955 search results - page 8 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
CCS
2001
ACM
14 years 11 days ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
AAAI
2007
13 years 10 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
IJCAI
2003
13 years 9 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...
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...