94 citations · 246 across the 28 of their papers we have counts for
Showing 2004Show all
3 papers · 1 filter
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…
cs.CC2004★ 1 cited
The Complexity of Modified Instances
Paolo Liberatore
In this paper we study the complexity of solving a problem when a solution of a similar instance is known. This problem is relevant whenever instances may change from time to time,…