en-de
en-es
en-fr
en-pt
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS
Published on Jul 21, 20113719 Views
We present a software tool that is able to automatically translate an NP problem into a STRIPS problem such that the former problem has a solution if the latter has one, a solution for the latter can
Related categories
Chapter list
Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS00:00
Motivation00:06
Our Contribution00:34
This Talk01:07
Descriptive Complexity Theory - 101:23
Descriptive Complexity Theory - 201:25
Descriptive Complexity Theory - 302:01
Example: SAT - 102:30
Example: SAT - 202:49
Example: SAT - 303:06
Example: SAT - 403:48
Example: SAT - 504:17
Example: SAT - 604:56
Example: SAT - 705:17
Example: SAT - 805:25
Example: 3 - Colorability05:42
Example: Directed Hamiltonian Path06:06
The Tool06:24
Input, Output, Guarantees06:26
Related Work07:14
Translation08:04
Two Steps08:06
Di erent Translations08:30
Translation Used in Experiments - 109:00
Translation Used in Experiments - 209:46
Example: SAT - Fluents - 110:20
Example: SAT - Fluents - 210:32
Example: SAT - Fluents - 310:34
Example: SAT - Fluents - 410:37
Example: SAT - Fluents - 510:57
Example: SAT - Actions - 111:07
Example: SAT - Actions - 211:39
Example: SAT - Actions - 312:00
Example: SAT - Actions - 412:20
Formal Properties - 112:30
Formal Properties - 212:52
Formal Properties - 313:01
Experiments - 113:21
Experiments - 213:25
Summary of Results13:51
Domains14:26
Chromatic Number14:39
Discussion15:07
Thanks!16:35