573 search results - page 76 / 115 » Planning as Satisfiability with Preferences |
NIPS
2004
13 years 9 months ago
2004
We investigate an approach for simultaneously committing to multiple activities, each modeled as a temporally extended action in a semi-Markov decision process (SMDP). For each ac...
AAAI
1997
13 years 9 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
PUK
2000
13 years 9 months ago
2000
Scheduling problems are usually treated within single plant environments or within companies with several production locations. Due to the globalization of markets companies can no...
IJCAI
1993
13 years 9 months ago
1993
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
AAAI
1990
13 years 9 months ago
1990
This paper presents a projection algorithm for incremental control rule synthesis. The algorithm synthesizes an initial set of goal-achieving control rules using a combination of ...