(2007) Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
Logical Methods in Computer Science, 3 (1).
Full text not available from this repository.
Official URL: https://doi.org/10.2168/LMCS-3(1:6)2007
Item Type: | Article |
---|---|
Depositing User: | Sebastian Weisgerber |
Date Deposited: | 22 Feb 2018 11:11 |
Last Modified: | 22 Feb 2018 11:11 |
URI: | https://publications.cispa.saarland/id/eprint/2000 |
Actions
Actions (login required)
View Item |