Explicit Conjunctions without Compilation: Computing h-FF(Pi-C) in Polynomial Time

Hoffmann, Jörg and Fickert, Maximilian
(2015) Explicit Conjunctions without Compilation: Computing h-FF(Pi-C) in Polynomial Time.
In: Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, ICAPS 2015, Jerusalem, Israel, June 7-11, 2015..
Conference: ICAPS International Conference on Automated Planning and Scheduling

Full text not available from this repository.
Official URL: http://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/pa...
Item Type: Conference or Workshop Item (A Paper) (Paper)
Conference: ICAPS International Conference on Automated Planning and Scheduling
Depositing User: Sebastian Weisgerber
Date Deposited: 22 Feb 2018 11:11
Last Modified: 23 Feb 2018 08:54
URI: https://publications.cispa.saarland/id/eprint/1947

Actions

Actions (login required)

View Item View Item
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.