Sciweavers

AIPS
2009
14 years 19 days ago
SAT-Based Parallel Planning Using a Split Representation of Actions
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
CP
2007
Springer
14 years 5 months ago
Towards Robust CNF Encodings of Cardinality Constraints
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
João P. Marques Silva, Inês Lynce