Satplan (better known as Planning as Satisfiability) is a method for automated planning. It converts the planning problem instance into an instance of...

partial-order planning reduction to the propositional satisfiability problem (satplan). reduction to model checking - both are essentially problems of traversing...

converts planning problems into Boolean satisfiability problems is called satplan. MaxWalkSAT is a variant of WalkSAT designed to solve the weighted satisfiability...

satisfiability in solving the planning problem in artificial intelligence (see satplan) in 1996, the same approach was generalized to model checking for linear...

closely related approach to planning is the Planning as Satisfiability (Satplan). Both reduce the automated planning problem to search for plans of different...

Belief revision Modal logics paraconsistent logics Planning using logic Satplan Learning using logic Inductive logic programming Explanation based learning...

initial state, working forwards, or a goal state if working backwards. Satplan is an approach to planning where a planning problem is reduced to a Boolean...