Planning with preferences using logic programming
From MaRDI portal
Publication:5482277
Recommendations
Cited in
(17)- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- An approach to improve argumentation-based epistemic planning with contextual preferences
- Anytime heuristic search for partial satisfaction planning
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
- Logic Programming and Nonmonotonic Reasoning
- Reasoning about actions with Temporal Answer Sets
- Planning as tabled logic programming
- Logic programming
- Answer set planning: a survey
- Specifying and computing preferred plans
- A language-independent framework for reasoning about preferences for declarative problem solving
- A heuristic search approach to planning with temporally extended preferences
- Logic programming with solution preferences
- A non-monotonic goal specification language for planning with preferences
- Implementing preferences with asprin
- Plan selection framework for policy-aware autonomous agents
This page was built for publication: Planning with preferences using logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482277)