Specifying and computing preferred plans
From MaRDI portal
Publication:646542
DOI10.1016/J.ARTINT.2010.11.021zbMATH Open1225.68241OpenAlexW2006754637MaRDI QIDQ646542FDOQ646542
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
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30)
Cites Work
- ConGolog, a concurrent programming language based on the situation calculus
- GOLOG: A logic programming language for dynamic domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of propositional linear temporal logics
- The computational complexity of propositional STRIPS planning
- TALplanner: A temporal logic based forward chaining planner
- The FF planning system: Fast plan generation through heuristic search
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Experiences with an interactive museum tour-guide robot
- Towards a possibilistic logic handling of preferences
- Using temporal logics to express search control knowledge for planning
- Qualitative choice logic
- Complexity, decidability and undecidability results for domain-independent planning
- Title not available (Why is that?)
- Logic Programming and Nonmonotonic Reasoning
- A General Framework for Expressing Preferences in Causal Reasoning and Planning
- Planning with preferences using logic programming
- A heuristic search approach to planning with temporally extended preferences
Cited In (7)
- PPlan
- Introducing preferences in planning as satisfiability
- Title not available (Why is that?)
- 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
Uses Software
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)
