250 search results - page 3 / 50 » The complexity of temporal constraint satisfaction problems |
AAAI
1997
14 years 11 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
COCO
2004
Springer
15 years 2 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
98
Voted
EAAI
2008
14 years 9 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
ICTAI
2002
IEEE
15 years 2 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...