94 citations · 246 across the 28 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.AI2007★ 1 cited
Raising a Hardness Result
Paolo Liberatore
This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions…
cs.AI2007★ 1 cited
Bijective Faithful Translations among Default Logics
Paolo Liberatore
In this article, we study translations between variants of defaults logics such that the extensions of the theories that are the input and the output of the translation are in a bi…