Planning with preferences using logic programming

DOI10.1017/S1471068406002717zbMath1122.68030OpenAlexW2153367464MaRDI QIDQ5482277

Enrico Pontelli, Tran Cao Son

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

zbMATH Keywords

preference representationplanning with preferencesanswer set planningpreference language

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (9)

Anytime heuristic search for partial satisfaction planning ⋮ Implementing Preferences with asprin ⋮ Reasoning about actions with Temporal Answer Sets ⋮ Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting ⋮ Specifying and computing preferred plans ⋮ A Non-monotonic Goal Specification Language for Planning with Preferences ⋮ Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming ⋮ Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting ⋮ An approach to improve argumentation-based epistemic planning with contextual preferences

Uses Software

• ASSAT
• Cmodels
• Smodels

This page was built for publication: Planning with preferences using logic programming