Solving Simple Planning Problems with More Inference and No Search
type: Item
instance of: scholarly article
title: Solving Simple Planning Problems with More Inference and No Search
zbMATH Open document ID: 1153.68494
DOI: 10.1007/11564751_50
author: Vincent Vidal
author: Hector Geffner
published in: Principles and Practice of Constraint Programming - CP 2005
publication date: 2008-09-09T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5323089
describes a project that uses: Walksat
describes a project that uses: CPlan
describes a project that uses: Graphplan
describes a project that uses: Siege
MaRDI profile type: MaRDI publication profile
full work available at URL: 11564751 50
OpenAlex ID: W1500277292
Recommended article: Complexity results for standard benchmark domains in planning
Recommended article: Blocks World revisited
Recommended article: The computational complexity of propositional STRIPS planning
Recommended article: AI planning in a constraint programming framework
Recommended article: Planning as heuristic search
description: scientific article; zbMATH DE number 5323089