activity
20022014
most citedSpace Efficiency of Propositional Knowledge Representation Formalisms

40 citations · 73 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2014★ 15 cited

A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability

Lucas Bordeaux, Marco Cadoli, Toni Mancini

Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangea…

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.LO2007

Generalizing Consistency and other Constraint Properties to Quantified Constraints

Lucas Bordeaux, Marco Cadoli, Toni Mancini

Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual n…

cs.AI2006★ 17 cited

Combining Relational Algebra, SQL, Constraint Modelling, and Local Search

Marco Cadoli, Toni Mancini

The goal of this paper is to provide a strong integration between constraint modelling and relational DBMSs. To this end we propose extensions of standard query languages such as r…

cs.AI2002★ 1 cited

Complexity of Nested Circumscription and Nested Abnormality Theories

Marco Cadoli, Thomas Eiter, Georg Gottlob

The need for a circumscriptive formalism that allows for simple yet elegant modular problem representation has led Lifschitz (AIJ, 1995) to introduce nested abnormality theories (N…