250 search results - page 38 / 50 » The complexity of temporal constraint satisfaction problems |
SAC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
133
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
115
Voted
AAAI
2000
15 years 1 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
AAAI
2006
15 years 1 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
117
click to vote
AIPS
2010
15 years 24 days ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...