Satplan

Known as: Plansat 
Satplan (better known as Planning as Satisfiability) is a method for automated planning. It converts the planning problem instance into an instance… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2015
0246819962015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Solving planning problems via translation to propositional satisfiability (SAT) is one of the most successful approaches to… (More)
  • table 1
  • table 2
Is this relevant?
2012
2012
Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination of multiple agents in two… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
2010
2010
Multi-agent planning is a core issue in the multi-agent systems field. In this work we focus on the coordination of multiple… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
2006
2006
Recent advances in solving constraint satisfaction problems (CSPs) and heuristic search have made it possible to solve classical… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2005
2005
Agents with web services based interfaces have service description encoded in machine-understandable formats so that they can… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 5
  • table 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Blackbox planning system unifies the planning as satisfiability framework (Kautz and Selman 1992, 1996) with the plan graph… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
It has often been observed that the classical AI planning problem (that is, planning with complete and certain information) is a… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We describe some new preprocessing techniques that enable faster domain-independent planning. The first set of techniques is… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present a framework for encoding planning problems in logic programs with negation as failure, having computational ee-ciency… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
There has been a great deal of recent work on new approaches to eeciently generating plans in systems such as Graphplan and… (More)
Is this relevant?