Sciweavers

1453 search results - page 4 / 291
» Partial Constraint Satisfaction
Sort
View
AAAI
1994
13 years 10 months ago
An Approach to Multiply Segmented Constraint Satisfaction Problems
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
Randall A. Helzerman, Mary P. Harper
AAAI
1998
13 years 10 months ago
Extending GENET to Solve Fuzzy Constraint Satisfaction Problems
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...
Jason H. Y. Wong, Ho-Fung Leung
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 22 days ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
CSR
2008
Springer
13 years 9 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
ICALP
2007
Springer
14 years 3 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson