Specifying and computing preferred plans

DOI10.1016/J.ARTINT.2010.11.021MaRDI QIDQ646542zbMATH OpenOpenAlexFDO

Authors Meghyn Bienvenu, Christian Fritz, 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

preferencesknowledge representationplanning with preferences

Mathematics Subject Classification ID

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

Recommendations

• Planning with preferences using logic programming
• Logic Programming and Nonmonotonic Reasoning
• Introducing preferences in planning as satisfiability
• A heuristic search approach to planning with temporally extended preferences
• A General Framework for Expressing Preferences in Causal Reasoning and Planning

Cites work

• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 2000818 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• scientific article; zbMATH DE number 3326230 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• A General Framework for Expressing Preferences in Causal Reasoning and Planning
• A heuristic search approach to planning with temporally extended preferences
• Complexity, decidability and undecidability results for domain-independent planning
• ConGolog, a concurrent programming language based on the situation calculus
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Experiences with an interactive museum tour-guide robot
• GOLOG: A logic programming language for dynamic domains
• Logic Programming and Nonmonotonic Reasoning
• Multicriteria optimization
• Planning with preferences using logic programming
• Qualitative choice logic
• TALplanner: A temporal logic based forward chaining planner
• The FF planning system: Fast plan generation through heuristic search
• The complexity of propositional linear temporal logics
• The computational complexity of propositional STRIPS planning
• Towards a possibilistic logic handling of preferences
• Using temporal logics to express search control knowledge for planning

Cited in

(7)

• PPlan
• Introducing preferences in planning as satisfiability
• scientific article; zbMATH DE number 1754020 (Why is no real title available?)
• Planning with preferences using logic programming
• A heuristic search approach to planning with temporally extended preferences
• A non-monotonic goal specification language for planning with preferences
• SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646542)