Sciweavers

601 search results - page 10 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
AAAI
1994
14 years 10 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
AMAI
1999
Springer
14 years 9 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
127
Voted
IJCAI
1989
14 years 10 months ago
Constraint Satisfaction with Delayed Evaluation
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
Monte Zweben, Megan Eskey
AAAI
2000
14 years 10 months ago
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems
We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of non-binary constraint satisfaction pro...
Barbara M. Smith, Kostas Stergiou, Toby Walsh
IAT
2003
IEEE
15 years 2 months ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings