Soft Goals Can Be Compiled Away

DOI10.1613/jair.2857zbMath1185.68644arXiv1401.3491OpenAlexW3098468635WikidataQ129501602 ScholiaQ129501602MaRDI QIDQ5190263

Emil Keyder, Héctor Geffner

Publication date: 15 March 2010

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.3491

zbMATH Keywords

heuristicsplanningsearch algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Agent planning programs ⋮ Anticipation of goals in automated planning ⋮ Selecting goals in oversubscription planning using relaxed plans

This page was built for publication: Soft Goals Can Be Compiled Away