Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
Saved in:
| Published in: | Logical Methods in Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2007
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1864030186460151812 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | Logical Methods in Computer Science |
| description | |
| discipline_display | Engineering & Technology |
| discipline_facet | Engineering & Technology |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:6693 |
| institution | FRELIP |
| journal_source_facet | Logical Methods in Computer Science |
| publishDate | 2007 |
| publishDateSort | 2007 |
| record_format | rss_article |
| spellingShingle | Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning Computer Science & Information Science Computer Science & IT Engineering & Technology |
| sub_discipline_display | Computer Science & IT |
| sub_discipline_facet | Computer Science & IT |
| subject_display | Computer Science & Information Science Computer Science & IT Engineering & Technology Computer Science & Information Science Computer Science & IT Engineering & Technology |
| subject_facet | Computer Science & Information Science Computer Science & IT Engineering & Technology |
| title | Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning |
| title_auth | Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning |
| title_full | Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning |
| title_fullStr | Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning |
| title_full_unstemmed | Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning |
| title_short | Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning |
| title_sort | structure and problem hardness: goal asymmetry and dpll proofs in sat-based planning |
| topic | Computer Science & Information Science Computer Science & IT Engineering & Technology |
| url | https://doi.org/10.2168/LMCS-3(1:6)2007 |