94 citations · 246 across the 28 of their papers we have counts for
Showing 2004 · cs.AIShow all
2 papers · 2 filters
cs.AI2004★ 20 cited
On the Complexity of Case-Based Planning
Paolo Liberatore
We analyze the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. We p…
cs.AI2004★ 1 cited
Where Fail-Safe Default Logics Fail
Paolo Liberatore
Reiter's original definition of default logic allows for the application of a default that contradicts a previously applied one. We call failure this condition. The possibility of…