6 citations · 10 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2005★ 6 cited
Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems
Paolo Liberatore
We study the problem of deciding whether some PSPACE-complete problems have models of bounded size. Contrary to problems in NP, models of PSPACE-complete problems may be exponentia…
cs.AI2002★ 3 cited
Merging Locally Correct Knowledge Bases: A Preliminary Report
Paolo Liberatore
Belief integration methods are often aimed at deriving a single and consistent knowledge base that retains as much as possible of the knowledge bases to integrate. The rationale be…