Marco Cadoli

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