Live briefing

Everything about Satplan

Method for automated planning

Satplan is a method for automated planning. It converts the planning problem instance into an instance of the Boolean satisfiability problem (SAT), which is then solved using a method for establishing satisfiability such as the DPLL algorithm or WalkSAT. Wikipedia →

🧭 Start here: a 6-step reading path

Read the overview: SatplanA 5-minute orientation
Read the landmark paper: μ-SATPLAN: Multi-agent planning as satisfiabilityCited 15 times
Go sideways: WalkSATA closely related topic
Go sideways: Boolean satisfiability problemA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

Methodology

🏆 Landmark papers (most cited)

μ-SATPLAN: Multi-agent planning as satisfiability

Yannis Dimopoulos, Muhammad Adnan Hashmi, Pavlos Moraitis · 2012 · Knowledge-Based Systems · 15 citations
T-SATPLAN: A SAT-BASED TEMPORAL PLANNER

AMOL DATTATRAYA MALI, YING LIU · 2006 · International Journal on Artificial Intelligence Tools · 1 citations
No One SATPlan Encoding To Rule Them All

Tomáš Balyo, Roman Barták · 2021 · Proceedings of the International Symposium on Combinatorial Search · 0 citations

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

WalkSAT In computer science, GSAT and WalkSAT are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae in Boolean…
Boolean satisfiability problem In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY…
Automated planning and scheduling Automated planning and scheduling, sometimes denoted as simply AI planning, is a branch of artificial intelligence that concerns the realization of strategies…
SAT solver In computer science and formal methods, a SAT solver is a computer program which aims to solve the Boolean satisfiability problem (SAT). On input a formula…
DPLL algorithm In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the…
Action model learning Action model learning (sometimes abbreviated action learning) is an area of machine learning concerned with the creation and modification of a software…
Satisfiability modulo theories In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable…
Stanford Research Institute Problem Solver The Stanford Research Institute Problem Solver, known by its acronym STRIPS, is an automated planner developed by Richard Fikes and Nils Nilsson in 1971…