Using temporal logics to express search control knowledge for planning
From MaRDI portal
Publication:1978242
DOI10.1016/S0004-3702(99)00071-5zbMath0939.68827OpenAlexW2141088850WikidataQ126635147 ScholiaQ126635147MaRDI QIDQ1978242
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
Related Items
The Hybrid Plan Controller Construction for Trajectories in Sobolev Space, Planning with regression analysis in transaction logic, Managing concurrency in temporal planning using planner-scheduler interaction, Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners, Task decomposition on abstract states, for planning under nondeterminism, Practical solution techniques for first-order MDPs, A compiler for MSVL and its applications, Reasoning about actions with Temporal Answer Sets, Learning linear temporal properties from noisy data: a MaxSAT-based approach, Answer set based design of knowledge systems, Finite-trace linear temporal logic: coinductive completeness, Planning control rules for reactive agents, The situation calculus: a case for modal logic, Planning as tabled logic programming, Kernel functions for case-based planning, A temporal logic programming approach to planning, Agent planning programs, Experimental evaluation of pheromone models in ACOPlan, Specifying and computing preferred plans, Strong planning under partial observability, On the axiomatizability of some first-order spatio-temporal theories, Model checking approach to automated planning, Automated verification of state sequence invariants in general game playing, Non-Markovian control in the Situation Calculus, Approximation of action theories and its application to conformant planning, Agenda control for heterogeneous reasoners, Blocks World revisited, Planning as heuristic search, Planning and control in artificial intelligence: A unifying perspective, Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming, Linear temporal logic as an executable semantics for planning languages, SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking, Selected Temporal Logic Systems: An Attempt at Engineering Evaluation, Why Systems of Temporal Logic Are Sometimes (Un)useful?, Bounded-Resource Reasoning as (Strong or Classical) Planning, Planning under uncertainty as G<scp>OLOG</scp>programs, Computing programs for generalized planning using a classical planner, Position systems in dynamic domains, Automated planning as an early verification tool for distributed control, Weak, strong, and strong cyclic planning via symbolic model checking, Heuristic planning: A declarative approach based on strategies for action selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acquiring search-control knowledge via static analysis
- On the complexity of blocks-world planning
- Partial-order planning: Evaluating possible efficiency gains
- Automatically generating abstractions for planning
- Safety, liveness and fairness in temporal logic
- Planning for temporally extended goals.
- Fast planning through planning graph analysis
- Planning in a hierarchy of abstraction spaces
- The complexity of propositional linear temporal logics
- Computational model theory: an overview
- Integrating planning and learning: the PRODIGY architecture
