Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Generalizations of Opt P to the polynomial hierarchy
Theoretical Computer Science
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Proceedings of the eleventh international conference on Logic programming
Fast planning through planning graph analysis
Artificial Intelligence
Representing action: indeterminacy and ramifications
Artificial Intelligence
Foundations of logic programming
Principles of knowledge representation
An action language based on causal explanation: preliminary report
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Extending Graphplan to handle uncertainty and sensing actions
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
State-space planning by integer optimization
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
Proceedings of the 1999 international conference on Logic programming
Declarative problem-solving in DLV
Logic-based artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Extending and implementing the stable model semantics
Artificial Intelligence
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Beyond the Plan-Length Criterion
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Answer Set Planning under Action Costs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Reasoning about Actions in Prioritized Default Theory
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Planning as Satisfiability in Nondeterministic Domains
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
A cost-directed planner: preliminary report
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Causal theories of action and change
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Monitoring agents using declarative planning
Fundamenta Informaticae
The DLV Project: A Tour from Theory and Research to Applications and Market
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Contingent planning with goal preferences
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Representing Multi-agent Planning in CLP
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Logic programs with abstract constraint atoms: The role of computations
Artificial Intelligence
Planning for multiagent using ASP-prolog
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
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
Survey: The consequences of eliminating NP solutions
Computer Science Review
Monitoring Agents using Declarative Planning
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
TutorialPlan: automated tutorial generation from CAD drawings
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language κc, which extends the declarative planning language κ by action costs. κc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems under other optimality criteria, such as computing "shortest" plans (with the least number of steps), and refinement combinations of cheapest and fastest plans. We study complexity aspects of the language κc and provide a transformation to logic programs, such that planning problems are solved via answer set programming. Furthermore, we report experimental results on selected problems. Our experience is encouraging that answer set planning may be a valuable approach to expressive planning systems in which intricate planning problems can be naturally specified and solved.