5 search results - page 1 / 1 » Lemma Reusing for SAT based Planning and Scheduling |
AIPS
2006
13 years 8 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
AAAI
1998
13 years 8 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
AIPS
2009
13 years 8 months ago
2009
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...