The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Generating qualitatively different plans through metatheoretic biases
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
Experiences with an interactive museum tour-guide robot
Artificial Intelligence - Special issue on applications of artificial intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
ConGolog, a concurrent programming language based on the situation calculus
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Towards a Possibilistic Logic Handling of Preferences
Applied Intelligence
Artificial Intelligence - Special issue on nonmonotonic reasoning
Planning with preferences using logic programming
Theory and Practice of Logic Programming
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A heuristic search approach to planning with temporally extended preferences
Artificial Intelligence
Planning with first-order temporally extended goals using heuristic search
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning as satisfiability with preferences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A heuristic search approach to planning with temporally extended preferences
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Temporal reasoning with preferences and uncertainty
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Computational complexity of planning with temporal goals
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Towards Augmenting Requirements Models with Preferences
ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
CPP: a constraint logic programming based planner with preferences
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Acquiring and reasoning about variability in goal models
Acquiring and reasoning about variability in goal models
Web service composition via generic procedures and customizing user preferences
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Representing and reasoning with qualitative preferences for compositional systems
Journal of Artificial Intelligence Research
Linear temporal logic and linear dynamic logic on finite traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we address the problem of specifying and computing preferred plans using rich, qualitative, user preferences. We propose a logical language for specifying preferences over the evolution of states and actions associated with a plan. We provide a semantics for our first-order preference language in the situation calculus, and prove that progression of our preference formulae preserves this semantics. This leads to the development of PPlan, a bounded best-first search planner that computes preferred plans. Our preference language is amenable to integration with many existing planners, and beyond planning, can be used to support a diversity of dynamical reasoning tasks that employ preferences.