Marco Cadoli

Publication Activity (10 Years)

Years Active: 1990-2014
Publications (10 Years): 0

Top Topics

Structural Properties

Constraint Satisfaction Problems

Conceptual Model

Top Venues

Intelligenza Artificiale

Publications

Lucas Bordeaux, Marco Cadoli, Toni Mancini
A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability. CoRR (2014)
Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo, Toni Mancini
Finite model reasoning on UML class diagrams via constraint programming. Intelligenza Artificiale 7 (1) (2013)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Space Efficiency of Propositional Knowledge Representation Formalisms CoRR (2011)
Marco Cadoli, Fabio Patrizi
On the separability of subproblems in Benders decompositions. Ann. Oper. Res. 171 (1) (2009)
Lucas Bordeaux, Marco Cadoli, Toni Mancini
Generalizing consistency and other constraint properties to quantified constraints. ACM Trans. Comput. Log. 10 (3) (2009)
Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli
Evaluating ASP and Commercial Solvers on the CSPLib. Constraints An Int. J. 13 (4) (2008)
Lucas Bordeaux, Marco Cadoli, Toni Mancini
A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability. J. Artif. Intell. Res. 32 (2008)
Marco Cadoli, Toni Mancini
Combining relational algebra, SQL, constraint modelling, and local search. Theory Pract. Log. Program. 7 (1-2) (2007)
Marco Cadoli, Toni Mancini
Using a Theorem Prover for Reasoning on Constraint Problems. Appl. Artif. Intell. 21 (4&5) (2007)
Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo, Toni Mancini
Finite Model Reasoning on UML Class Diagrams Via Constraint Programming. AI*IA (2007)
Lucas Bordeaux, Marco Cadoli, Toni Mancini
Generalizing Consistency and other Constraint Properties to Quantified Constraints CoRR (2007)
Toni Mancini, Marco Cadoli
Exploiting functional dependencies in declarative problem specifications. Artif. Intell. 171 (16-17) (2007)
Marco Cadoli, Toni Mancini
Combining Relational Algebra, SQL, Constraint Modelling, and Local Search CoRR (2006)
Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi
Evaluating ASP and Commercial Solvers on the CSPLib. ECAI (2006)
Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi
Evaluating ASP and commercial solvers on the CSPLib (Preliminary work). WLP (2006)
Marco Cadoli, Toni Mancini, Fabio Patrizi
SAT as an Effective Solving Technology for Constraint Problems. ISMIS (2006)
Marco Cadoli, Marco Schaerf
Partial Solutions with Unique Completion. Reasoning, Action and Interaction in AI Theories and Systems (2006)
Marco Cadoli, Toni Mancini
Automated reformulation of specifications by safe delay of constraints. Artif. Intell. 170 (8-9) (2006)
Marco Cadoli, Fabio Patrizi
On the Separability of Subproblems in Benders Decompositions. CPAIOR (2006)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
k-Approximating Circuits. IEEE Trans. Computers 55 (7) (2006)
Marco Cadoli, Thomas Eiter, Georg Gottlob
Complexity of propositional nested circumscription and nested abnormality theories. ACM Trans. Comput. Log. 6 (2) (2005)
Lucas Bordeaux, Marco Cadoli, Toni Mancini
CSP Properties for Quantified Constraints: Definitions and Complexity. AAAI (2005)
Toni Mancini, Marco Cadoli
Detecting and Breaking Symmetries by Reasoning on Problem Specifications. SARA (2005)
Marco Cadoli, Andrea Schaerf
: Compiling problem specifications into SAT. Artif. Intell. 162 (1-2) (2005)
Marco Cadoli, Toni Mancini
Using a Theorem Prover for Reasoning on Constraint Problems. AI*IA (2005)
Marco Cadoli, Toni Mancini
Exploiting Functional Dependencies in Declarative Problem Specifications. JELIA (2004)
Marco Cadoli, Toni Mancini
Automated Reformulation of Specifications by Safe Delay of Constraints. KR (2004)
Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo
Towards Implementing Finite Model Reasoning in Description Logics. Description Logics (2004)
Lucas Bordeaux, Marco Cadoli, Toni Mancini
Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems. LPAR (2004)
Marco Cadoli
Proposal-Based Negotiation in Convex Regions. CIA (2003)
Marco Cadoli, Toni Mancini
Towards automated reformulation of specications. APPIA-GULP-PRODE (2003)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Preprocessing of Intractable Problems. Inf. Comput. 176 (2) (2002)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
k-Approximating Circuits Electron. Colloquium Comput. Complex. (067) (2002)
Marco Cadoli, Marco Schaerf, Andrea Giovanardi, Massimo Giovanardi
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. J. Autom. Reason. 28 (2) (2002)
Marco Cadoli, Thomas Eiter, Georg Gottlob
Complexity of Nested Circumscription and Nested Abnormality Theories CoRR (2002)
Marco Cadoli, Toni Mancini
Combining Relational Algebra, SQL, and Constraint Programming. FroCoS (2002)
Marco Cadoli, Toni Mancini
Knowledge Compilation = Query Rewriting + View Synthesis. PODS (2002)
Marco Cadoli, Andrea Schaerf
Compiling Problem Specifications into SAT. ESOP (2001)
Marco Cadoli, Thomas Eiter, Georg Gottlob
Complexity of Nested Circumscription and Abnormality Theories. IJCAI (2001)
Marco Cadoli
The Expressive Power of Binary Linear Programming. CP (2001)
Andrea Schaerf, Marco Cadoli, Maurizio Lenzerini
LOCAL++: A C++ framework for local search algorithms. Softw. Pract. Exp. 30 (3) (2000)
Marco Cadoli, Giovambattista Ianni, Luigi Palopoli, Andrea Schaerf, Domenico Vasile
NP-SPEC: an executable specification language for solving all problems in NP. Comput. Lang. 26 (2-4) (2000)
Marco Cadoli, Francesco Scarcello
Semantical and computational aspects of Horn approximations. Artif. Intell. 119 (1-2) (2000)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. 13 (2000)
Marco Cadoli, Luigi Palopoli, Francesco Scarcello
Propositional lower bounds: Algorithms and complexity. Ann. Math. Artif. Intell. 27 (1-4) (1999)
Marco Cadoli
Using LPNMR for Problem Specification and Code Generation. LPNMR (1999)
Marco Cadoli, Luigi Palopoli, Andrea Schaerf, Domenico Vasile
NP-SPEC: An Executable Specification Language for Solving All Problems in NP. PADL (1999)
Andrea Schaerf, Maurizio Lenzerini, Marco Cadoli
LOCAL++: A C++ Framework for Local Search Algorithms. TOOLS (29) (1999)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
The Size of a Revised Knowledge Base. Artif. Intell. 115 (1) (1999)
Marco Cadoli, Andrea Giovanardi, Marco Schaerf
An Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI (1998)
Marco Cadoli, Luigi Palopoli, Francesco Scarcello
Propositional Lower Bounds: Generalization and Algorithms. JELIA (1998)
Marco Cadoli, Luigi Palopoli
Circumscribing DATALOG: Expressive Power and Complexity. Theor. Comput. Sci. 193 (1-2) (1998)
Richard W. Weyhrauch, Marco Cadoli, Carolyn L. Talcott
Using Abstract Resources to Control Reasoning. J. Log. Lang. Inf. 7 (1) (1998)
Marco Cadoli, Thomas Eiter, Georg Gottlob
Default Logic as a Query Language. IEEE Trans. Knowl. Data Eng. 9 (3) (1997)
Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri
On Compact Representations of Propositional Circumscription. Theor. Comput. Sci. 182 (1-2) (1997)
Marco Cadoli, Francesco M. Donini
A Survey on Knowledge Compilation. AI Commun. 10 (3-4) (1997)
Marco Cadoli, Andrea Giovanardi, Marco Schaerf
Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. AI*IA (1997)
Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini
Datalog and Description Logics: Expressive Power. DBPL (1997)
Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini
Datalog and Description Logics: Expressive Power. APPIA-GULP-PRODE (1997)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Feasibility and Unfeasibility of Off-Line Processing. ISTCS (1996)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR (1996)
Marco Cadoli, Marco Schaerf
On the complexity of Entailment in Propositional Multivalued Logics. Ann. Math. Artif. Intell. 18 (1) (1996)
Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini
Datalog and Description Logics: Expressive Power - Preliminary Report. Description Logics (1996)
Marco Cadoli, Francesco M. Donini, Marco Schaerf
Is Intractability of Nonmonotonic Reasoning a Real Drawback? Artif. Intell. 88 (1-2) (1996)
Marco Cadoli, Marco Schaerf
Approximate Inference in Default Logic and Circumscription. Fundam. Informaticae 23 (1) (1995)
Marco Cadoli, Francesco M. Donini, Marco Schaerf
On Compact Representations of Propositional Circumscription. STACS (1995)
Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
The Size of a Revised Knowledge Base. PODS (1995)
Marco Schaerf, Marco Cadoli
Tractable Reasoning via Approximation. Artif. Intell. 74 (2) (1995)
Marco Cadoli, Maurizio Lenzerini
The Complexity of Propositional Closed World Reasoning and Circumscription. J. Comput. Syst. Sci. 48 (2) (1994)
Marco Cadoli, Thomas Eiter, Georg Gottlob
Default Logic as a Query Language. KR (1994)
Marco Cadoli, Francesco M. Donini, Marco Schaerf
Is Intractability of Non-Monotonic Reasoning a Real Drawback? AAAI (1994)
Marco Cadoli, Marco Schaerf
Approximate Inference in Default Logic and Circumscription. Fundam. Informaticae 21 (1/2) (1994)
Marco Cadoli
Semantical and Computational Aspects of Horn Approximations. IJCAI (1993)
Marco Cadoli, Marco Schaerf
A Survey of Complexity Results for Nonmonotonic Logics. J. Log. Program. 17 (2/3&4) (1993)
Marco Cadoli, Marco Schaerf
Approximate Inference in Default Logic and Circumscription. ECAI (1992)
Marco Cadoli, Marco Schaerf
Approximate Reasoning and Non-Omniscient Agents. TARK (1992)
Marco Cadoli, Thomas Eiter, Georg Gottlob
An Efficient Method for Eliminating Varying Predicates from a Circumscription. Artif. Intell. 54 (2) (1992)
Marco Cadoli
The Complexity of Model Checking for Circumscriptive Formulae. Inf. Process. Lett. 44 (3) (1992)
Marco Cadoli, Marco Schaerf
Approximation in Concept Description Languages. KR (1992)
Marco Cadoli, Marco Schaerf
Approximate Entailment. AI*IA (1991)
Marco Cadoli, Maurizio Lenzerini
The Complexity of Closed World Reasoning and Circumscription. AAAI (1990)