Sciweavers

1421 search results - page 56 / 285
» Satisfying KBO Constraints
Sort
View
IWSAS
2001
Springer
15 years 4 months ago
Constraint-Guided Self-adaptation
We present an approach to self-adaptive systems utilizing explicit models of the design-space of the application. The design-space is captured by allowing the specification of alte...
Sandeep Neema, Ákos Lédeczi
BPM
2006
Springer
115views Business» more  BPM 2006»
15 years 3 months ago
Modeling, Matching and Ranking Services Based on Constraint Hardness
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
Claudia d'Amato, Steffen Staab
AAAI
2006
15 years 1 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi
AAAI
2004
15 years 1 months ago
Logic Programs with Abstract Constraint Atoms
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Victor W. Marek, Miroslaw Truszczynski

Book
357views
16 years 10 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang