2845 search results - page 135 / 569 » Constraints over Ontologies |
162
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
162
click to vote
ESOP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
153
click to vote
CAV
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
169
click to vote
EPIA
2001
Springer
15 years 11 months ago
2001
Springer
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
143
click to vote
IJCAI
1997
15 years 7 months ago
1997
We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonlyused propagationrules do n...