Planning with preferences using logic programming
From MaRDI portal
Publication:5482277
DOI10.1017/S1471068406002717zbMATH Open1122.68030OpenAlexW2153367464MaRDI QIDQ5482277FDOQ5482277
Publication date: 28 August 2006
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068406002717
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cited In (15)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting
- An approach to improve argumentation-based epistemic planning with contextual preferences
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
- Anytime heuristic search for partial satisfaction planning
- Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
- Logic Programming and Nonmonotonic Reasoning
- Implementing Preferences with asprin
- Reasoning about actions with Temporal Answer Sets
- Planning as tabled logic programming
- Logic programming
- A Non-monotonic Goal Specification Language for Planning with Preferences
- Specifying and computing preferred plans
- A heuristic search approach to planning with temporally extended preferences
- Logic programming with solution preferences
- Plan selection framework for policy-aware autonomous agents
Uses Software
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)
