138 search results - page 18 / 28 » Domain Transmutation in Constraint Satisfaction Problems |
AAAI
2006
13 years 9 months ago
2006
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
CP
2003
Springer
14 years 27 days ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
CP
2000
Springer
14 years 4 hour ago
2000
Springer
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...