Automatic polytime reductions of NP problems into a fragment of STRIPS

ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling

Volumn , Issue , 2011, Pages 178-185

  Porco, Aldo ^a   Machado, Alejandro ^a   Bonet, Blai ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC METHOD; BENCH-MARK PROBLEMS; NP PROBLEMS; POLYNOMIAL-TIME; REAL-LIFE PROBLEMS; SOFTWARE TOOL;

KNOWLEDGE ENGINEERING; POLYNOMIAL APPROXIMATION;

SCHEDULING;

EID: 80054837318     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bollobás, B. 2001. Random Graphs. Cambridge University Press, second edition.
2. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69:165-204.
3. Cadoli, M., and Schaerf, A. 2005. Compiling problem specifications into SAT. Artificial Intelligence 162:89-120. (Pubitemid 40034595)
4. Fagin, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. American Mathematical Society 7:21-41.
5. Hoffmann, J.; Gomes, C.; Selman, B.; and Kautz, H. A. 2007. SAT encodings of state-space reachability problems in numeric domains. Proc. 20th Int. Conf. on Automated Planning and Scheduling, 1918-1923.
6. Immerman, N. 1998. Descriptive Complexity. Springer.
7. McDermott, D.; Ghallab, M.; Howe, A.; Knoblock, C.; Ram, A.; Veloso, M.; Weld, D.; and Wilkins, D. 1998. PDDL - The Planning Domain Definition Language. Technical Report CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, New Haven, CT.
8. Mitchell, D. G., and Ternovska, E. 2005. A framework for representing and solving NP search problems. Proc. 20th National Conf. on Artificial Intelligence, 430-435.
9. Rintanen, J. 2010a. Heuristic planning with SAT: Beyond strict depth-first search. Proc. 23rd Australasian Joint Conf. on Artificial Intelligence, 415-424.
10. Rintanen, J. 2010b. Heuristics for planning with SAT. Proc. 16th Int. Conf. on Principles and Practice of Contraint Programming, 414-428.
11. Sipser, M. 2005. Introduction to Theory of Computation, 2nd Edition. Boston, MA: Thomson Course Technology.
12. Tseitin, G. S. 1968. On the complexity of derivation in propositional calculus. In Slisenko, A. O., ed., Studies in Constructive Mathematics and Mathematical Logic, Part 2. Springer. 115-125.