Using temporal logics to express search control knowledge for planning
From MaRDI portal
Publication:1978242
DOI10.1016/S0004-3702(99)00071-5zbMATH Open0939.68827OpenAlexW2141088850WikidataQ126635147 ScholiaQ126635147MaRDI QIDQ1978242FDOQ1978242
Authors: Fahiem Bacchus, Froduald Kabanza 
Publication date: 4 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00071-5
Recommendations
Cites Work
- Fast planning through planning graph analysis
- Title not available (Why is that?)
- The complexity of propositional linear temporal logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planning for temporally extended goals.
- Title not available (Why is that?)
- On the complexity of blocks-world planning
- Safety, liveness and fairness in temporal logic
- Automatically generating abstractions for planning
- Title not available (Why is that?)
- Planning in a hierarchy of abstraction spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acquiring search-control knowledge via static analysis
- Integrating planning and learning: the PRODIGY architecture
- Partial-order planning: Evaluating possible efficiency gains
- Computational model theory: an overview
Cited In (54)
- On the exploitation of control knowledge for enhancing automated planning
- Using α -ctl to Specify Complex Planning Goals
- Learning linear temporal properties from noisy data: a MaxSAT-based approach
- Domain-dependent knowledge in answer set planning
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- On the power of automata minimization in reactive synthesis
- Title not available (Why is that?)
- Managing concurrency in temporal planning using planner-scheduler interaction
- Non-Markovian control in the Situation Calculus
- Planning as heuristic search
- Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
- Experimental evaluation of pheromone models in ACOPlan
- Position systems in dynamic domains
- Strong planning under partial observability
- Title not available (Why is that?)
- Answer set based design of knowledge systems
- Automated Reasoning with Analytic Tableaux and Related Methods
- Practical solution techniques for first-order MDPs
- Planning under uncertainty as G<scp>OLOG</scp>programs
- Reasoning about actions with Temporal Answer Sets
- Selected temporal logic systems: an attempt at engineering evaluation
- Why systems of temporal logic are sometimes (un)useful?
- Automated planning as an early verification tool for distributed control
- Weak, strong, and strong cyclic planning via symbolic model checking
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Model checking approach to automated planning
- Planning as tabled logic programming
- The Hybrid Plan Controller Construction for Trajectories in Sobolev Space
- Planning with regression analysis in transaction logic
- Agenda control for heterogeneous reasoners
- Linear temporal logic as an executable semantics for planning languages
- Planning control rules for reactive agents
- Learning control knowledge for forward search planning
- TALplanner: A temporal logic based forward chaining planner
- The situation calculus: a case for modal logic
- Kernel functions for case-based planning
- Encoding domain and control knowledge for propositional planning
- Agent planning programs
- Task decomposition on abstract states, for planning under nondeterminism
- Finite-trace linear temporal logic: coinductive completeness
- Approximation of action theories and its application to conformant planning
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- Specifying and computing preferred plans
- Computing programs for generalized planning using a classical planner
- Blocks World revisited
- Bounded-Resource Reasoning as (Strong or Classical) Planning
- A temporal logic programming approach to planning
- Maintenance of plan libraries for case-based planning: offline and online policies
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- A compiler for MSVL and its applications
- On the axiomatizability of some first-order spatio-temporal theories
- Automated verification of state sequence invariants in general game playing
- Planning and control in artificial intelligence: A unifying perspective
- Heuristic planning: A declarative approach based on strategies for action selection
Uses Software
This page was built for publication: Using temporal logics to express search control knowledge for planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978242)
