Searching for "Planning as Satisfiability with Preferences." – sorted by Relevance.
-
CPP: a Constraint Logic Programming based Planner with Preferences
- ’s preference and evaluate its performance. 1 Introduction The problem of finding a plan satisfying
- Cited by 1 (1 self) – Add To MetaCart
-
Planning with Preferences using Logic Programming
- (have coffee). Any plan satisfying this preference requires that Bob stops at the station before going
- Cited by 9 (1 self) – Add To MetaCart
-
Planning with Preferences using Logic Programming
- can write: goal have coffee . Any plan satisfying this preference requires that Bob stops
- Cited by 2 (0 self) – Add To MetaCart
-
Enabling autonomous rover science through dynamic planning and scheduling
- are used to compute plan quality based on how well the plan satisfies these preferences. Optimization
- Cited by 4 (0 self) – Add To MetaCart

