601 search results - page 37 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
100
click to vote
AAAI
2007
15 years 3 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
120
click to vote
IJDMB
2010
14 years 10 months ago
2010
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
125
click to vote
CSCLP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
100
click to vote
TPLP
2008
15 years 1 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...