Pages that link to "Item:Q1978242"
From MaRDI portal
The following pages link to Using temporal logics to express search control knowledge for planning (Q1978242):
Displaying 45 items.
- Experimental evaluation of pheromone models in ACOPlan (Q421472) (← links)
- On the axiomatizability of some first-order spatio-temporal theories (Q514577) (← links)
- Non-Markovian control in the Situation Calculus (Q543575) (← links)
- Approximation of action theories and its application to conformant planning (Q543583) (← links)
- The situation calculus: a case for modal logic (Q616039) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Heuristic planning: A declarative approach based on strategies for action selection (Q814564) (← links)
- Managing concurrency in temporal planning using planner-scheduler interaction (Q834400) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Practical solution techniques for first-order MDPs (Q835833) (← links)
- Answer set based design of knowledge systems (Q854966) (← links)
- Agent planning programs (Q899440) (← links)
- Linear temporal logic as an executable semantics for planning languages (Q1006453) (← links)
- Planning control rules for reactive agents (Q1389598) (← links)
- A compiler for MSVL and its applications (Q1630985) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- Automated verification of state sequence invariants in general game playing (Q1761287) (← links)
- Agenda control for heterogeneous reasoners (Q1764797) (← links)
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking (Q2046017) (← links)
- Learning linear temporal properties from noisy data: a MaxSAT-based approach (Q2147181) (← links)
- Model checking approach to automated planning (Q2248102) (← links)
- Computing programs for generalized planning using a classical planner (Q2321292) (← links)
- Position systems in dynamic domains (Q2341258) (← links)
- Automated planning as an early verification tool for distributed control (Q2352501) (← links)
- Planning with regression analysis in transaction logic (Q2360182) (← links)
- A temporal logic programming approach to planning (Q2424818) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Selected Temporal Logic Systems: An Attempt at Engineering Evaluation (Q2814121) (← links)
- Why Systems of Temporal Logic Are Sometimes (Un)useful? (Q2814135) (← links)
- Bounded-Resource Reasoning as (Strong or Classical) Planning (Q3393381) (← links)
- Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming (Q3601793) (← links)
- Planning under uncertainty as G<scp>OLOG</scp>programs (Q4467045) (← links)
- Planning as tabled logic programming (Q4592996) (← links)
- Reasoning about actions with Temporal Answer Sets (Q5299584) (← links)
- The Hybrid Plan Controller Construction for Trajectories in Sobolev Space (Q5881166) (← links)
- Blocks World revisited (Q5940781) (← links)
- Planning as heuristic search (Q5941310) (← links)
- Planning and control in artificial intelligence: A unifying perspective (Q5945807) (← links)
- Maintenance of plan libraries for case-based planning: offline and online policies (Q6535412) (← links)
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects (Q6566615) (← links)
- On the power of automata minimization in reactive synthesis (Q6649518) (← links)
- On the exploitation of control knowledge for enhancing automated planning (Q6665139) (← links)
