Planning for conjunctive goals
Artificial Intelligence
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Proceedings of the eleventh international conference on Logic programming
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Fast planning through planning graph analysis
Artificial Intelligence
The interactive museum tour-guide robot
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Control knowledge in planning: benefits and tradeoffs
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Proceedings of the 1999 international conference on Logic programming
ConGolog, a concurrent programming language based on the situation calculus
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Answer set programming and plan generation
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
SHOP: Simple Hierarchical Ordered Planner
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Polynomial-Length Planning Spans the Polynomial Hierarchy
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Extending ConGolog to Allow Partial Ordering
ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
TALplanner: An Empirical Investigation of a Temporal Logic-based Forward Chaining Planner
TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Reasoning about actions: non-deterministic effects, constraints, and qualification
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Towards the creation of accessibility agents for non-visual navigation of the web
CUU '03 Proceedings of the 2003 conference on Universal usability
Theory and Practice of Logic Programming
Probabilistic Planning in Hybrid Probabilistic Logic Programs
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
A Logical Framework to Reinforcement Learning Using Hybrid Probabilistic Logic Programs
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Logic Programming for Multiagent Planning with Negotiation
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Modeling Multi-agent Domains in an Action Languages: An Empirical Study Using $\mathcal{C}$
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
An extension to conformant planning using logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Logic programming for finding models in the logics of knowledge and its applications: A case study
Theory and Practice of Logic Programming
Coala: a compiler from action languages to ASP
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Approximation of action theories and its application to conformant planning
Artificial Intelligence
Planning for multiagent using ASP-prolog
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Reasoning about multi-agent domains using action language C: a preliminary study
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Combining answer set programming and prolog: the ASP-PROLOG system
Logic programming, knowledge representation, and nonmonotonic reasoning
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
An approximation of action theories of AL and its application to conformant planning
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Reasoning and planning with cooperative actions for multiagents using answer set programming
DALT'09 Proceedings of the 7th international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.01 |
In this article we consider three different kinds of domain-dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative and relies on the language of logic programming with answer set semantics (AnsProlog*). AnsProlog* is designed to plan without control knowledge. We show how temporal, procedural and HTN-based control knowledge can be incorporated into AnsProlog* by the modular addition of a small number of domain-dependent rules, without the need to modify the planner. We formally prove the correctness of our planner, both in the absence and presence of the control knowledge. Finally, we perform some initial experimentation that demonstrates the potential reduction in planning time that can be achieved when procedural domain knowledge is used to solve planning problems with large plan length.