Sciweavers

67 search results - page 12 / 14
» On the Compilation of Plan Constraints and Preferences
Sort
View
CP
1998
Springer
15 years 3 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
JAIR
2010
130views more  JAIR 2010»
14 years 6 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
CSCLP
2008
Springer
15 years 1 months ago
Robust Solutions in Unstable Optimization Problems
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
CPAIOR
2009
Springer
15 years 6 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
NLE
2008
77views more  NLE 2008»
14 years 11 months ago
Generating basic skills reports for low-skilled readers
We describe SkillSum, a Natural Language Generation (NLG) system that generates a personalised feedback report for someone who has just completed a screening assessment of their b...
Sandra Williams, Ehud Reiter