Planning as propositional CSP: From Walksat to local search techniques for action graphs

DOI10.1023/A:1025846120461zbMath1074.68612OpenAlexW1586443364MaRDI QIDQ1768745

Ivan Serina, Alfonso E. Gerevini

Publication date: 15 March 2005

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025846120461

zbMATH Keywords

local searchheuristic searchplanning as CSPplanning graphspropositional CSP

Mathematics Subject Classification ID

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

Related Items (4)

Learning from planner performance ⋮ Planning as satisfiability: heuristics ⋮ Analysis of local search landscapes for \(k\)-SAT instances ⋮ Planning in domains with derived predicates through rule-action graphs and local search

Uses Software

• STAN
• Walksat
• CPlan
• Chaff
• Graphplan

This page was built for publication: Planning as propositional CSP: From Walksat to local search techniques for action graphs