Marco Cadoli

According to our database, Marco Cadoli authored at least 64 papers between 1990 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2013

Finite model reasoning on UML class diagrams via constraint programming.

Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo, Toni Mancini

Intelligenza Artificiale, 2013

2009

Generalizing consistency and other constraint properties to quantified constraints.

Lucas Bordeaux, Marco Cadoli, Toni Mancini

ACM Trans. Comput. Log., 2009

On the separability of subproblems in Benders decompositions.

Marco Cadoli, Fabio Patrizi

Ann. Oper. Res., 2009

2008

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

Lucas Bordeaux, Marco Cadoli, Toni Mancini

J. Artif. Intell. Res., 2008

Evaluating ASP and Commercial Solvers on the CSPLib.

Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli

Constraints An Int. J., 2008

2007

Combining relational algebra, SQL, constraint modelling, and local search.

Marco Cadoli, Toni Mancini

Theory Pract. Log. Program., 2007

Exploiting functional dependencies in declarative problem specifications.

Toni Mancini, Marco Cadoli

Artif. Intell., 2007

Using a Theorem Prover for Reasoning on Constraint Problems.

Marco Cadoli, Toni Mancini

Appl. Artif. Intell., 2007

2006

k-Approximating Circuits.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

IEEE Trans. Computers, 2006

Automated reformulation of specifications by safe delay of constraints.

Marco Cadoli, Toni Mancini

Artif. Intell., 2006

Evaluating ASP and commercial solvers on the CSPLib (Preliminary work).

Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi

Proceedings of the 20th Workshop on Logic Programming, 2006

SAT as an Effective Solving Technology for Constraint Problems.

Marco Cadoli, Toni Mancini, Fabio Patrizi

Proceedings of the Foundations of Intelligent Systems, 16th International Symposium, 2006

Partial Solutions with Unique Completion.

Marco Cadoli, Marco Schaerf

Proceedings of the Reasoning, 2006

2005

Complexity of propositional nested circumscription and nested abnormality theories.

Marco Cadoli, Thomas Eiter, Georg Gottlob

ACM Trans. Comput. Log., 2005

: Compiling problem specifications into SAT.

Marco Cadoli, Andrea Schaerf

Artif. Intell., 2005

Detecting and Breaking Symmetries by Reasoning on Problem Specifications.

Toni Mancini, Marco Cadoli

Proceedings of the Abstraction, 2005

CSP Properties for Quantified Constraints: Definitions and Complexity.

Lucas Bordeaux, Marco Cadoli, Toni Mancini

Proceedings of the Proceedings, 2005

2004

Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems.

Lucas Bordeaux, Marco Cadoli, Toni Mancini

Proceedings of the Logic for Programming, 2004

Towards Implementing Finite Model Reasoning in Description Logics.

Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo

Proceedings of the 2004 International Workshop on Description Logics (DL2004), 2004

2003

Proposal-Based Negotiation in Convex Regions.

Marco Cadoli

Proceedings of the Cooperative Information Agents VII, 7th International Workshop, 2003

Towards automated reformulation of specications.

Marco Cadoli, Toni Mancini

Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

2002

An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation.

Marco Cadoli, Marco Schaerf, Andrea Giovanardi, Massimo Giovanardi

J. Autom. Reason., 2002

Preprocessing of Intractable Problems.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Inf. Comput., 2002

Complexity of Nested Circumscription and Nested Abnormality Theories

Marco Cadoli, Thomas Eiter, Georg Gottlob

CoRR, 2002

Knowledge Compilation = Query Rewriting + View Synthesis.

Marco Cadoli, Toni Mancini

Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

Combining Relational Algebra, SQL, and Constraint Programming.

Marco Cadoli, Toni Mancini

Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

2001

Complexity of Nested Circumscription and Abnormality Theories.

Marco Cadoli, Thomas Eiter, Georg Gottlob

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

The Expressive Power of Binary Linear Programming.

Marco Cadoli

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

LOCAL++: A C++ framework for local search algorithms.

Andrea Schaerf, Marco Cadoli, Maurizio Lenzerini

Softw. Pract. Exp., 2000

Space Efficiency of Propositional Knowledge Representation Formalisms.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

J. Artif. Intell. Res., 2000

NP-SPEC: an executable specification language for solving all problems in NP.

Marco Cadoli, Giovambattista Ianni, Luigi Palopoli, Andrea Schaerf, Domenico Vasile

Comput. Lang., 2000

Semantical and computational aspects of Horn approximations.

Marco Cadoli, Francesco Scarcello

Artif. Intell., 2000

1999

Propositional lower bounds: Algorithms and complexity.

Marco Cadoli, Luigi Palopoli, Francesco Scarcello

Ann. Math. Artif. Intell., 1999

The Size of a Revised Knowledge Base.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Artif. Intell., 1999

NP-SPEC: An Executable Specification Language for Solving All Problems in NP.

Marco Cadoli, Luigi Palopoli, Andrea Schaerf, Domenico Vasile

Proceedings of the Practical Aspects of Declarative Languages, 1999

Using LPNMR for Problem Specification and Code Generation.

Marco Cadoli

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

1998

Circumscribing DATALOG: Expressive Power and Complexity.

Marco Cadoli, Luigi Palopoli

Theor. Comput. Sci., 1998

Using Abstract Resources to Control Reasoning.

Richard W. Weyhrauch, Marco Cadoli, Carolyn L. Talcott

J. Log. Lang. Inf., 1998

Propositional Lower Bounds: Generalization and Algorithms.

Marco Cadoli, Luigi Palopoli, Francesco Scarcello

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

An Algorithm to Evaluate Quantified Boolean Formulae.

Marco Cadoli, Andrea Giovanardi, Marco Schaerf

Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997

Default Logic as a Query Language.

Marco Cadoli, Thomas Eiter, Georg Gottlob

IEEE Trans. Knowl. Data Eng., 1997

On Compact Representations of Propositional Circumscription.

Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri

Theor. Comput. Sci., 1997

A Survey on Knowledge Compilation.

Marco Cadoli, Francesco M. Donini

AI Commun., 1997

Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae.

Marco Cadoli, Andrea Giovanardi, Marco Schaerf

Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

Datalog and Description Logics: Expressive Power.

Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini

Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996

On the complexity of Entailment in Propositional Multivalued Logics.

Marco Cadoli, Marco Schaerf

Ann. Math. Artif. Intell., 1996

Is Intractability of Nonmonotonic Reasoning a Real Drawback?

Marco Cadoli, Francesco M. Donini, Marco Schaerf

Artif. Intell., 1996

Comparing Space Efficiency of Propositional Knowledge Representation Formalisms.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Feasibility and Unfeasibility of Off-Line Processing.

Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Datalog and Description Logics: Expressive Power - Preliminary Report.

Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini

Proceedings of the 1996 International Workshop on Description Logics, 1996

1995

Approximate Inference in Default Logic and Circumscription.

Marco Cadoli, Marco Schaerf

Fundam. Informaticae, 1995

Tractable Reasoning via Approximation.

Marco Schaerf, Marco Cadoli

Artif. Intell., 1995

On Compact Representations of Propositional Circumscription.

Marco Cadoli, Francesco M. Donini, Marco Schaerf

Proceedings of the STACS 95, 1995

Tractable Reasoning in Artificial Intelligence

Marco Cadoli

Lecture Notes in Computer Science 941, Springer, ISBN: 3-540-60058-2, 1995

1994

The Complexity of Propositional Closed World Reasoning and Circumscription.

Marco Cadoli, Maurizio Lenzerini

J. Comput. Syst. Sci., 1994

Is Intractability of Non-Monotonic Reasoning a Real Drawback?

Marco Cadoli, Francesco M. Donini, Marco Schaerf

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993

A Survey of Complexity Results for Nonmonotonic Logics.

Marco Cadoli, Marco Schaerf

J. Log. Program., 1993

Semantical and Computational Aspects of Horn Approximations.

Marco Cadoli

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992

The Complexity of Model Checking for Circumscriptive Formulae.

Marco Cadoli

Inf. Process. Lett., 1992

An Efficient Method for Eliminating Varying Predicates from a Circumscription.

Marco Cadoli, Thomas Eiter, Georg Gottlob

Artif. Intell., 1992

Approximate Reasoning and Non-Omniscient Agents.

Marco Cadoli, Marco Schaerf

Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge, 1992

Approximation in Concept Description Languages.

Marco Cadoli, Marco Schaerf

Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR'92). Cambridge, 1992

1991

Approximate Entailment.

Marco Cadoli, Marco Schaerf

Proceedings of the Trends in Artificial Intelligence, 1991

1990

The Complexity of Closed World Reasoning and Circumscription.

Marco Cadoli, Maurizio Lenzerini

Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990