Publikace
- Complexity Issues Related to Propagation Completeness2013 | Matematicko-fyzikální fakulta
- Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas2013 | Matematicko-fyzikální fakulta
- Finding Minimum Satisfying Assignments of Boolean Formulas2013 | Matematicko-fyzikální fakulta
- Finding Minimum Satisfying Assignments of Boolean FormulasPublikace bez příslušnosti k fakultě
- No One SATPlan Encoding To Rule Them All2015 | Matematicko-fyzikální fakulta
- Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask)2014 | Matematicko-fyzikální fakulta
- On Different Strategies for Eliminating Redundant Actions from Plans2014 | Matematicko-fyzikální fakulta
- Relaxing the Relaxed Exist-Step Parallel Planning Semantics2013 | Matematicko-fyzikální fakulta
- On Hierarchies over the SLUR Class2012 | Matematicko-fyzikální fakulta
- On Improving Plan Quality via Local Enhancements2012 | Matematicko-fyzikální fakulta
Loading network view...