Research Publications
All 2008 | |
| Narrow your search | 10 result(s) |
By Type By Year By Research Group | In SAT-based planning, optimality can be traded for efficiency and scalability. One approach to this is to plan using a relaxed encoding of the corresponding decision problems. Another approach is to adopt a sub-optimal query strategy – e.g. avoid solving... Although clause weighting local search algorithms have produced some of the best results on a range of challenging satisfiability (SAT) benchmarks, this performance is dependent on the careful hand-tuning of sensitive parameters. When such hand-tuning is ... The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding strategies typically equate to blind (breadth-first) search. They do not ... We describe a restricted class of planning problems and polynomial time membership and plan existence decision algorithms for this class. The definition of the problem class is based on a graph representation of planning problems, similar to Petri nets... In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel plan. These developments have been towards: (1) Query strategies that ... Recent times have seen the development of planners that exploit advances in SAT(isfiability) solving technology to achieve good performance. In that spirit we develop the approximate contingent planner PSLSPLAN. Our approach is based on local search for ... Despite significant improvements over the last two decades, local search techniques still struggle to compete with the best systematic methods when solving highly structured real-world satisfiability (SAT) problems. Recent work has successfully employed a... In this paper we describe a stochastic local search (SLS) procedure for finding \Omit{satisfying }models of satisfiable propositional formulae. This new algorithm, gNovelty$^+$, draws on the features of two other WalkSAT family algorithms: AdaptNovelty... |