Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
From MaRDI portal
Publication:5190260
DOI10.1613/jair.2817zbMath1188.68270OpenAlexW2130743314WikidataQ129501934 ScholiaQ129501934MaRDI QIDQ5190260
Ashish Sabharwal, Jörg Hoffmann, Carmel Domshlak
Publication date: 15 March 2010
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.2817
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
A new representation and associated algorithms for generalized planning ⋮ Optimal admissible composition of abstraction heuristics ⋮ A framework for analysing state-abstraction methods
This page was built for publication: Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings