Code From The Paper "Counterexample-Guided Cartesian Abstraction Refinement For Classical Planning"

Software OPEN SOURCE
Seipp, Jendrik; Helmert, Malte;
(2018)
  • Publisher: Zenodo
  • Related identifiers: doi: 10.5281/zenodo.1240992
  • Subject: code | cost partitioning | abstraction refinement | Counterexample-guided | directory | Space Science | Science Policy | planner | revision 837 b 876fa | zipfile | Neuroscience | Developmental Biology | Fast Downward planning system | Classical Planning | http | Cancer | quot
    • FOR: 80699 Information Systems not elsewhere classified | 29999 Physical Sciences not elsewhere classified | 69999 Biological Sciences not elsewhere classified
    acm: GeneralLiterature_MISCELLANEOUS | TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES | ComputingMilieux_THECOMPUTINGPROFESSION | TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS | GeneralLiterature_REFERENCE(e.g.,dictionaries,encyclopedias,glossaries)

<p>The zipfile contains revision 837b876fa51d&nbsp;of the Fast Downward planning system (http://fast-downward.org). The code for&nbsp;counterexample-guided Cartesian abstraction refinement and saturated cost partitioning can be found in the &quot;src/search/cegar&quot; ... View more
Share - Bookmark