Answer set planning: a survey
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1696837 (Why is no real title available?)
- scientific article; zbMATH DE number 5959974 (Why is no real title available?)
- scientific article; zbMATH DE number 3128787 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 52880 (Why is no real title available?)
- scientific article; zbMATH DE number 1305704 (Why is no real title available?)
- scientific article; zbMATH DE number 582867 (Why is no real title available?)
- scientific article; zbMATH DE number 1096857 (Why is no real title available?)
- scientific article; zbMATH DE number 2000818 (Why is no real title available?)
- scientific article; zbMATH DE number 2038899 (Why is no real title available?)
- scientific article; zbMATH DE number 1560498 (Why is no real title available?)
- scientific article; zbMATH DE number 1931653 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 1453058 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- scientific article; zbMATH DE number 2243368 (Why is no real title available?)
- scientific article; zbMATH DE number 2243372 (Why is no real title available?)
- scientific article; zbMATH DE number 2243394 (Why is no real title available?)
- scientific article; zbMATH DE number 2243410 (Why is no real title available?)
- A concise introduction to multiagent systems and distributed artificial intelligence
- A correctness result for synthesizing plans with loops in stochastic domains
- A logic programming approach to knowledge-state planning, semantics and complexity
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- A logic-based calculus of events
- A novel SAT-based approach to model based diagnosis
- A resource logic for multi-agent plan merging
- A single-agent approach to multiagent planning
- A theory of diagnosis from first principles
- ASP modulo CSP: the clingcon system
- ASP-Core-2 input language format
- An abductive event calculus planner
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- Answer set programming and plan generation
- Approximation of action theories and its application to conformant planning
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- CASP solutions for planning in hybrid domains
- CHICA, An Abductive Planning System Based on Event Calculus
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
- Compiling uncertainty away in conformant planning problems with bounded width
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Conditional Planning with External Functions
- Conflict-based search for optimal multi-agent pathfinding
- Conformant planning via heuristic forward search: A new approach
- Conformant planning via symbolic model checking and heuristic search
- Constraint Answer Set Solving
- Constraint answer set solver EZCSP and why integration schemas matter
- DEL planning and some tractable cases
- Degrees of laziness in grounding. Effects of lazy-grounding strategies on ASP solving
- Depth-first iterative-deepening: An optimal admissible tree search
- Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study
- Diagnosis of large active systems
- Diagnostic reasoning with A-Prolog
- Domain-dependent knowledge in answer set planning
- Domain-independent cost-optimal planning in ASP
- Elaboration tolerant representation of Markov decision process via decision-theoretic extension of probabilistic action language \(p\mathcal{BC}+\)
- Enhanced partial expansion A^*
- Epistemic planning for single- and multi-agent systems
- Extending and implementing the stable model semantics
- Fast planning through planning graph analysis
- Formalizing negotiations using logic programming
- Formalizing sensing actions -- a transition function based approach
- GASP: Answer set programming with lazy grounding
- Human robot collaborative assembly planning: an answer set programming approach
- Hybrid conditional planning using answer set programming
- Implementing preferences with asprin
- Industrial-size scheduling with ASP+CP
- Integrating answer set programming and constraint logic programming
- Introducing preferences in planning as satisfiability
- Lazy model expansion: interleaving grounding with search
- Logic Programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming for Multiagent Planning with Negotiation
- Logics in Artificial Intelligence
- Long-distance mutual exclusion for planning
- Modelling multi-agent epistemic planning in ASP
- Multi-shot ASP solving with clingo
- Multiagent Systems
- Planning and acting in partially observable stochastic domains
- Planning as heuristic search
- Planning as satisfiability: heuristics
- Planning as satisfiability: parallel plans and algorithms for plan search
- Planning for hybrid systems via satisfiability modulo theories
- Planning for multiagent using ASP-Prolog
- Planning graph heuristics for belief space search
- Planning in a hierarchy of abstraction spaces
- Planning in answer set programming using ordered task decomposition
- Planning with Incomplete Information in Quantified Answer Set Programming
- Planning with preferences using logic programming
- Push and rotate: a complete multi-agent pathfinding algorithm
- Reasoning agents in dynamic domains
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
- Representing action: indeterminacy and ramifications
- Representing actions in logic programs and default theories a situation calculus approach
- Representing constraint satisfaction problems in answer set programming
- Robust multi-agent path finding and executing
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- STRIPS: A new approach to the application of theorem proving to problem solving
- Strengthening landmark heuristics via hitting sets
- Subdimensional expansion for multirobot path planning
- The ASP system DLV2
- The Complexity of Decentralized Control of Markov Decision Processes
- The FF planning system: Fast plan generation through heuristic search
- The fast downward planning system
- The well-founded semantics for general logic programs
- Topological value iteration algorithms
- Train scheduling with hybrid ASP
- \textit{clingcon}: the next generation
- plasp 3: towards effective ASP planning
Cited in
(2)
This page was built for publication: Answer set planning: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027219)
