Sciweavers

565 search results - page 41 / 113
» Heuristics for Planning with SAT
Sort
View
JOLLI
2007
128views more  JOLLI 2007»
13 years 8 months ago
Linear temporal logic as an executable semantics for planning languages
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...
CL
2000
Springer
14 years 13 days ago
Proof Planning with Multiple Strategies
The control in multi-strategy proof planning goes beyond the control in other automated theorem proving approaches: not only the selection of the inference and the facts for the n...
Erica Melis, Andreas Meier
EVOW
2009
Springer
13 years 12 months ago
Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies
The current paper uses a scenario from logistics to show that modern heuristics, and in particular particle swarm optimization (PSO) can significantly add to the improvement of sta...
Volker Nissen, Maik Günther
JAIR
2006
71views more  JAIR 2006»
13 years 8 months ago
Engineering a Conformant Probabilistic Planner
We present a partial-order, conformant, probabilistic planner, Probapop which competed in the blind track of the Probabilistic Planning Competition in IPC-4. We explain how we ada...
Nilufer Onder, G. C. Whelan, Li Li
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 5 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...