Specifying and computing preferred plans

DOI10.1016/j.artint.2010.11.021zbMath1225.68241OpenAlexW2006754637MaRDI QIDQ646542

Christian Fritz, Meghyn Bienvenu, Sheila A. McIlraith

Publication date: 17 November 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.11.021

zbMATH Keywords

knowledge representationpreferencesplanning with preferences

Mathematics Subject Classification ID

Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking ⋮ PPlan

Uses Software

• CP-nets
• ConGolog
• GOLOG
• Walksat
• PDDL
• Yochan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Qualitative choice logic
• A heuristic search approach to planning with temporally extended preferences
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• The computational complexity of propositional STRIPS planning
• Multicriteria optimization
• ConGolog, a concurrent programming language based on the situation calculus
• TALplanner: A temporal logic based forward chaining planner
• Complexity, decidability and undecidability results for domain-independent planning
• Using temporal logics to express search control knowledge for planning
• Experiences with an interactive museum tour-guide robot
• The complexity of propositional linear temporal logics
• GOLOG: A logic programming language for dynamic domains
• Logic Programming and Nonmonotonic Reasoning
• A General Framework for Expressing Preferences in Causal Reasoning and Planning
• Planning with preferences using logic programming
• Towards a possibilistic logic handling of preferences

This page was built for publication: Specifying and computing preferred plans