Sciweavers

36 search results - page 4 / 8
» Soft Constraints with Partially Ordered Preferences
Sort
View
LOGCOM
2011
14 years 10 days ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
15 years 3 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 1 months 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
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 9 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
TASE
2007
IEEE
15 years 3 months ago
Constraint-Based Policy Negotiation and Enforcement for Telco Services
Telco services are evolving under several aspects: for instance, services may combine different telecommunication features (messaging, multi-media, etc.) and may be activated and...
Maria Grazia Buscemi, Laura Ferrari, Corrado Moiso...