40 citations · 61 across the 6 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2011★ 40 cited
Space Efficiency of Propositional Knowledge Representation Formalisms
M. Cadoli, F. M. Donini, P. Liberatore +1
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. Intuitively, the space efficiency of a formalism F in representing a certain piece…
cs.AI2010★ 2 cited
On the size of data structures used in symbolic model checking
Paolo Liberatore, Marco Schaerf
Temporal Logic Model Checking is a verification method in which we describe a system, the model, and then we verify whether some properties, expressed in a temporal logic formula,…
cs.AI2002★ 9 cited
Compilability of Abduction
Paolo Liberatore, Marco Schaerf
Abduction is one of the most important forms of reasoning; it has been successfully applied to several practical problems such as diagnosis. In this paper we investigate whether th…