removing SATPlan and adding conda and sypet

[Benchmarks_CSolver.git] / satPlan2006 / include / Examples / logistics-strips / README

diff --git a/satPlan2006/include/Examples/logistics-strips/README b/satPlan2006/include/Examples/logistics-strips/README
deleted file mode 100644 (file)
index 02fba0a..0000000
--- a/satPlan2006/include/Examples/logistics-strips/README
+++ /dev/null
@@ -1,45 +0,0 @@
-Domain: logistics\r
-Version: logistics-strips\r
-\r
-This directory contains a collection of logistics\r
-problems. This domain was originally developed by\r
-Manuela Veloso.\r
-\r
-We use the pure strips style encoding (no equality,\r
-no types). See domain01.pddl for operators. Original\r
-operator file is by Dan Weld. We made some minor\r
-fixes. See file header.\r
-\r
-prob001 --- prob009 are based on instances\r
-       reported in the literature, including:\r
-\r
-               Henry Kautz and Bart Selman, "Pushing the Envelope:\r
-               Planning, Propositional Logic, and Stochastic Search",\r
-               Proc. AAAI-96.\r
-\r
-               Henry Kautz and Bart Selman, "The Role of\r
-               Domain-Specific Knowledge in the Planning as Satisfiability Framework",\r
-               Proc. AIPS-98, Pittsburgh, PA, 1998.\r
-       \r
-prob009 --- prob030 are generated using GenLogStrips.c.\r
-\r
-control.pddl and control1.pddl -- control rule files.\r
-\r
-All instances are tested and correctness verified.\r
-\r
-Problems prob020 and prob028 are particularly hard!  To solve them, try \r
-\r
--solver -maxsec 30 graphplan -then -maxsec 0 compact -b 8 -then satz -cutoff 100 -restart 50\r
-\r
-To see the how control rules help, try\r
-\r
-blackbox -o domain.pddl -f prob020.pddl -c control.pddl -axioms 31 -t 15 -solver compact -b -then relsat -maxbt 10000 -trials 20\r
-\r
-Collected by Henry Kautz and Bart Selman.\r
-kautz@research.att.com / selman@cs.cornell.edu\r
-\r
-\r
-\r
-\r
-\r
-\r