scientific article; zbMATH DE number 2201583

Dana Nau, Malik Ghallab, Paolo Traverso

Publication date: 2 September 2005

Full work available at URL: http://www.sciencedirect.com/science/book/9781558608566

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Łukasiewicz Games ⋮ Planning with regression analysis in transaction logic ⋮ Decidability and complexity of action-based temporal planning over dense time ⋮ Analyzing generalized planning under nondeterminism ⋮ Hierarchical planning in a supervisory control context with compositional abstraction ⋮ Domain-independent planning for services in uncertain and dynamic environments ⋮ Argumentation update in YALLA (yet another logic language for argumentation) ⋮ Task decomposition on abstract states, for planning under nondeterminism ⋮ ML-plan: automated machine learning via hierarchical planning ⋮ Gearing Up for Effective ASP Planning ⋮ Learning Actions Models: Qualitative Approach ⋮ Conditional Epistemic Planning ⋮ Qualitative Approximate Behavior Composition ⋮ A constraint-based approach to learn temporal features on action models from multiple plans ⋮ Merge-and-Shrink Abstraction ⋮ Maintenance goals of agents in a dynamic environment: formulation and policy construction ⋮ Proof systems and transformation games ⋮ Randomized Shortest-Path Problems: Two Related Models ⋮ Modeling robotic operations controlled by natural language ⋮ Editorial: Towards a science of integrated AI and robotics ⋮ Efficient interactive decision-making framework for robotic applications ⋮ Geometric backtracking for combined task and motion planning in robotic systems ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ On the importance of domain model configuration for automated planning engines ⋮ The MADLA planner: multi-agent planning by combination of distributed and local heuristic search ⋮ Planning with Critical Section Macros: Theory and Practice ⋮ A Comprehensive Framework for Learning Declarative Action Models ⋮ DEL-sequents for regression and epistemic planning ⋮ On the Complexity of Reconfiguration in Systems with Legacy Components ⋮ Scrutable robot actions using a hierarchical ontological model ⋮ Modular robotic systems: methods and algorithms for abstraction, planning, control, and synchronization ⋮ Recent advances in unfolding technique ⋮ Proof systems for planning under 0-approximation semantics ⋮ CASP solutions for planning in hybrid domains ⋮ Fast and accurate data-driven goal recognition using process mining techniques ⋮ A multi-objective approach for manufacturing systems with multiple production routes based on supervisory control theory and heuristic algorithms ⋮ A temporal logic programming approach to planning ⋮ Agent planning programs ⋮ Finite-trace and generalized-reactivity specifications in temporal synthesis ⋮ Experimental evaluation of pheromone models in ACOPlan ⋮ A planner agent that tries its best in presence of nondeterminism ⋮ Generating possible intentions with constrained argumentation systems ⋮ Dynamic term-modal logics for first-order epistemic planning ⋮ Reasoning about actions with loops via Hoare logic ⋮ Heuristic Hill-Climbing as a Markov Process ⋮ Plan aggregation for strong cyclic planning in nondeterministic domains ⋮ HTN-like solutions for classical planning problems: an application to BDI agent systems ⋮ Qualitative Numeric Planning: Reductions and Complexity ⋮ Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem ⋮ Action-model acquisition for planning via transfer learning ⋮ Learning hierarchical task network domains from partially observed plan traces ⋮ On the computational complexity of coalitional resource games ⋮ Learning-driven goal generation ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ A novel ant colony optimization strategy for the quantum circuit compilation problem ⋮ Planning-based knowing how: a unified approach ⋮ Approximate Achievability in Event Databases ⋮ Strong temporal planning with uncontrollable durations ⋮ Implicit, explicit and speculative knowledge ⋮ Completely and partially executable sequences of actions in deontic context ⋮ The virtues of idleness: a decidable fragment of resource agent logic ⋮ Star-topology decoupled state space search ⋮ Partial-order Boolean games: informational independence in a logic-based model of strategic interaction ⋮ Logic Programming for Multiagent Planning with Negotiation ⋮ Complexity of qualitative timeline-based planning ⋮ t-DeLP: an argumentation-based temporal defeasible logic programming framework ⋮ Group planning with time constraints ⋮ Recursive definitions of tabular transformations ⋮ Linear logic as a tool for planning under temporal uncertainty ⋮ A constraint programming formulation for planning: From plan scheduling to plan generation ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ A case study in programming a quantum annealer for hard operational planning problems ⋮ Multi-robot LTL planning under uncertainty ⋮ Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming ⋮ CP methods for scheduling and routing with~time-dependent task costs ⋮ Natural strategic ability ⋮ Knowledge-based programs as succinct policies for partially observable domains ⋮ On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier ⋮ Towards Real-World HTN Planning Agents ⋮ Forward Chaining Hierarchical Partial-Order Planning ⋮ Acting on Norm Constrained Plans ⋮ Efficient multi-agent epistemic planning: teaching planners about nested belief ⋮ DEL Planning and Some Tractable Cases ⋮ On Hierarchical Task Networks ⋮ Explanation in artificial intelligence: insights from the social sciences ⋮ Probably bounded suboptimal heuristic search ⋮ A dynamic epistemic framework for reasoning about conformant probabilistic plans ⋮ Reasoning from last conflict(s) in constraint programming ⋮ Explaining AI decisions using efficient methods for learning sparse Boolean formulae ⋮ Dynamic Epistemic Logics ⋮ On distinguishing sets of structures by first-order sentences of minimal quantifier rank ⋮ Benchmark and Survey of Automated Machine Learning Frameworks ⋮ On-the-fly informed search of non-blocking directed controllers ⋮ Towards the evaluation of action reversibility in STRIPS using domain generators ⋮ Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning ⋮ A complete parameterized complexity analysis of bounded planning

This page was built for publication: