The following pages link to Jörg Hoffmann (Q514136):
Displayed 34 items.
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Tracking the race between deep reinforcement learning and imitation learning (Q2056979) (← links)
- Conformant planning via heuristic forward search: A new approach (Q2457623) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- (Q2717791) (← links)
- (Q2766931) (← links)
- BDD Ordering Heuristics for Classical Planning (Q2938478) (← links)
- Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art (Q2953929) (← links)
- Brothers in Arms? On AI Planning and Cellular Automata (Q2999137) (← links)
- Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+ (Q3007563) (← links)
- A CACHING TECHNIQUE FOR OPTIMIZING AUTOMATED SERVICE DISCOVERY (Q3173443) (← links)
- Merge-and-Shrink Abstraction (Q3189651) (← links)
- Short XORs for Model Counting: From Theory to Practice (Q3612459) (← links)
- (Q3624023) (← links)
- (Q3624106) (← links)
- (Q4449305) (← links)
- Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning (Q5026253) (← links)
- Deep Statistical Model Checking (Q5041276) (← links)
- Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison (Q5114783) (← links)
- Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings (Q5190260) (← links)
- Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search (Q5227490) (← links)
- (Q5283006) (← links)
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning (Q5310682) (← links)
- Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL (Q5423882) (← links)
- Fast Directed Model Checking Via Russian Doll Abstraction (Q5458328) (← links)
- Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions (Q5494855) (← links)
- (Q5715683) (← links)
- (Q5715723) (← links)
- (Q5715727) (← links)
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization (Q5739833) (← links)
- Star-Topology Decoupling in SPIN (Q5883577) (← links)
- Model Checking Software (Q5899035) (← links)