Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Marco Cadoli
2010 – today
- 2011
[i5]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Space Efficiency of Propositional Knowledge Representation Formalisms. CoRR abs/1106.0233 (2011)
2000 – 2009
- 2009
- [j33]Marco Cadoli, Fabio Patrizi: On the separability of subproblems in Benders decompositions. Annals OR 171(1): 27-43 (2009)
- [j32]Lucas Bordeaux, Marco Cadoli, Toni Mancini: Generalizing consistency and other constraint properties to quantified constraints. ACM Trans. Comput. Log. 10(3) (2009)
- 2008
- [j31]Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli: Evaluating ASP and Commercial Solvers on the CSPLib. Constraints 13(4): 407-436 (2008)
- [j30]Lucas Bordeaux, Marco Cadoli, Toni Mancini: A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability. J. Artif. Intell. Res. (JAIR) 32: 607-629 (2008)
- 2007
- [j29]Marco Cadoli, Toni Mancini: Using a Theorem Prover for Reasoning on Constraint Problems. Applied Artificial Intelligence 21(4&5): 383-404 (2007)
- [j28]Toni Mancini, Marco Cadoli: Exploiting functional dependencies in declarative problem specifications. Artif. Intell. 171(16-17): 985-1010 (2007)
- [j27]Marco Cadoli, Toni Mancini: Combining relational algebra, SQL, constraint modelling, and local search. TPLP 7(1-2): 37-65 (2007)
- [c41]Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo, Toni Mancini: Finite Model Reasoning on UML Class Diagrams Via Constraint Programming. AI*IA 2007: 36-47
- [i4]Lucas Bordeaux, Marco Cadoli, Toni Mancini: Generalizing Consistency and other Constraint Properties to Quantified Constraints. CoRR abs/0705.3561 (2007)
- 2006
- [j26]Marco Cadoli, Toni Mancini: Automated reformulation of specifications by safe delay of constraints. Artif. Intell. 170(8-9): 779-801 (2006)
- [j25]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits. IEEE Trans. Computers 55(7): 913-917 (2006)
- [c40]Marco Cadoli, Marco Schaerf: Partial Solutions with Unique Completion. Reasoning, Action and Interaction in AI Theories and Systems 2006: 101-115
- [c39]Marco Cadoli, Fabio Patrizi: On the Separability of Subproblems in Benders Decompositions. CPAIOR 2006: 74-88
- [c38]Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi: Evaluating ASP and Commercial Solvers on the CSPLib. ECAI 2006: 68-72
- [c37]Marco Cadoli, Toni Mancini, Fabio Patrizi: SAT as an Effective Solving Technology for Constraint Problems. ISMIS 2006: 540-549
- [c36]Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi: Evaluating ASP and commercial solvers on the CSPLib (Preliminary work). WLP 2006: 54-63
- [i3]Marco Cadoli, Toni Mancini: Combining Relational Algebra, SQL, Constraint Modelling, and Local Search. CoRR abs/cs/0601043 (2006)
- 2005
- [j24]Marco Cadoli, Andrea Schaerf: : Compiling problem specifications into SAT. Artif. Intell. 162(1-2): 89-120 (2005)
- [j23]Marco Cadoli, Thomas Eiter, Georg Gottlob: Complexity of propositional nested circumscription and nested abnormality theories. ACM Trans. Comput. Log. 6(2): 232-272 (2005)
- [c35]Lucas Bordeaux, Marco Cadoli, Toni Mancini: CSP Properties for Quantified Constraints: Definitions and Complexity. AAAI 2005: 360-365
- [c34]Marco Cadoli, Toni Mancini: Using a Theorem Prover for Reasoning on Constraint Problems. AI*IA 2005: 38-49
- [c33]Toni Mancini, Marco Cadoli: Detecting and Breaking Symmetries by Reasoning on Problem Specifications. SARA 2005: 165-181
- 2004
- [c32]Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo: Towards Implementing Finite Model Reasoning in Description Logics. Description Logics 2004
- [c31]Marco Cadoli, Toni Mancini: Exploiting Functional Dependencies in Declarative Problem Specifications. JELIA 2004: 628-640
- [c30]Marco Cadoli, Toni Mancini: Automated Reformulation of Specifications by Safe Delay of Constraints. KR 2004: 388-398
- [c29]Lucas Bordeaux, Marco Cadoli, Toni Mancini: Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems. LPAR 2004: 270-284
- 2003
- [c28]Marco Cadoli, Toni Mancini: Towards automated reformulation of specications. APPIA-GULP-PRODE 2003: 398-409
- [c27]
- 2002
- [j22]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Preprocessing of Intractable Problems. Inf. Comput. 176(2): 89-120 (2002)
- [j21]Marco Cadoli, Marco Schaerf, Andrea Giovanardi, Massimo Giovanardi: An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. J. Autom. Reasoning 28(2): 101-142 (2002)
- [c26]Marco Cadoli, Toni Mancini: Combining Relational Algebra, SQL, and Constraint Programming. FroCoS 2002: 147-161
- [c25]Marco Cadoli, Toni Mancini: Knowledge Compilation = Query Rewriting + View Synthesis. PODS 2002: 199-208
- [i2]Marco Cadoli, Thomas Eiter, Georg Gottlob: Complexity of Nested Circumscription and Nested Abnormality Theories. CoRR cs.AI/0207072 (2002)
- [i1]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits. Electronic Colloquium on Computational Complexity (ECCC)(067) (2002)
- 2001
- [c24]
- [c23]
- [c22]Marco Cadoli, Thomas Eiter, Georg Gottlob: Complexity of Nested Circumscription and Abnormality Theories. IJCAI 2001: 169-174
- 2000
- [j20]Marco Cadoli, Francesco Scarcello: Semantical and computational aspects of Horn approximations. Artif. Intell. 119(1-2): 1-17 (2000)
- [j19]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): 165-195 (2000)
- [j18]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. (JAIR) 13: 1-31 (2000)
- [j17]Andrea Schaerf, Marco Cadoli, Maurizio Lenzerini: LOCAL++: A C++ framework for local search algorithms. Softw., Pract. Exper. 30(3): 233-257 (2000)
1990 – 1999
- 1999
- [j16]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. Artif. Intell. 115(1): 25-64 (1999)
- [j15]Marco Cadoli, Luigi Palopoli, Francesco Scarcello: Propositional lower bounds: Algorithms and complexity. Ann. Math. Artif. Intell. 27(1-4): 129-148 (1999)
- [c21]
- [c20]Marco Cadoli, Luigi Palopoli, Andrea Schaerf, Domenico Vasile: NP-SPEC: An Executable Specification Language for Solving All Problems in NP. PADL 1999: 16-30
- [c19]Andrea Schaerf, Maurizio Lenzerini, Marco Cadoli: LOCAL++: A C++ Framework for Local Search Algorithms. TOOLS (29) 1999: 152-161
- 1998
- [j14]Richard W. Weyhrauch, Marco Cadoli, Carolyn L. Talcott: Using Abstract Resources to Control Reasoning. Journal of Logic, Language and Information 7(1): 77-101 (1998)
- [j13]Marco Cadoli, Luigi Palopoli: Circumscribing DATALOG: Expressive Power and Complexity. Theor. Comput. Sci. 193(1-2): 215-244 (1998)
- [c18]Marco Cadoli, Andrea Giovanardi, Marco Schaerf: An Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 1998: 262-267
- [c17]Marco Cadoli, Luigi Palopoli, Francesco Scarcello: Propositional Lower Bounds: Generalization and Algorithms. JELIA 1998: 355-367
- 1997
- [j12]Marco Cadoli, Francesco M. Donini: A Survey on Knowledge Compilation. AI Commun. 10(3-4): 137-150 (1997)
- [j11]Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri: On Compact Representations of Propositional Circumscription. Theor. Comput. Sci. 182(1-2): 183-202 (1997)
- [j10]Marco Cadoli, Thomas Eiter, Georg Gottlob: Default Logic as a Query Language. IEEE Trans. Knowl. Data Eng. 9(3): 448-463 (1997)
- [c16]Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini: Datalog and Description Logics: Expressive Power. APPIA-GULP-PRODE 1997: 333-344
- [c15]Marco Cadoli, Andrea Giovanardi, Marco Schaerf: Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. AI*IA 1997: 207-218
- [c14]Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini: Datalog and Description Logics: Expressive Power. DBPL 1997: 281-298
- 1996
- [j9]Marco Cadoli, Francesco M. Donini, Marco Schaerf: Is Intractability of Nonmonotonic Reasoning a Real Drawback? Artif. Intell. 88(1-2): 215-251 (1996)
- [j8]Marco Cadoli, Marco Schaerf: On the complexity of Entailment in Propositional Multivalued Logics. Ann. Math. Artif. Intell. 18(1): 29-50 (1996)
- [c13]Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini: Datalog and Description Logics: Expressive Power - Preliminary Report. Description Logics 1996: 97-101
- [c12]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Feasibility and Unfeasibility of Off-Line Processing. ISTCS 1996: 100-109
- [c11]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR 1996: 364-373
- 1995
- [b1]Marco Cadoli: Tractable Reasoning in Artificial Intelligence. Lecture Notes in Computer Science 941, Springer 1995, ISBN 3-540-60058-2
- [j7]Marco Schaerf, Marco Cadoli: Tractable Reasoning via Approximation. Artif. Intell. 74(2): 249-310 (1995)
- [j6]Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. Fundam. Inform. 23(1): 123-143 (1995)
- [c10]Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. PODS 1995: 151-162
- [c9]Marco Cadoli, Francesco M. Donini, Marco Schaerf: On Compact Representations of Propositional Circumscription. STACS 1995: 205-216
- 1994
- [j5]Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. Fundam. Inform. 21(1/2): 103-112 (1994)
- [j4]Marco Cadoli, Maurizio Lenzerini: The Complexity of Propositional Closed World Reasoning and Circumscription. J. Comput. Syst. Sci. 48(2): 255-310 (1994)
- [c8]Marco Cadoli, Francesco M. Donini, Marco Schaerf: Is Intractability of Non-Monotonic Reasoning a Real Drawback? AAAI 1994: 946-951
- [c7]
- 1993
- [j3]Marco Cadoli, Marco Schaerf: A Survey of Complexity Results for Nonmonotonic Logics. J. Log. Program. 17(2/3&4): 127-160 (1993)
- [c6]
- 1992
- [j2]Marco Cadoli, Thomas Eiter, Georg Gottlob: An Efficient Method for Eliminating Varying Predicates from a Circumscription. Artif. Intell. 54(2): 397-410 (1992)
- [j1]Marco Cadoli: The Complexity of Model Checking for Circumscriptive Formulae. Inf. Process. Lett. 44(3): 113-118 (1992)
- [c5]Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. ECAI 1992: 319-323
- [c4]
- [c3]
- 1991
- [c2]
- 1990
- [c1]Marco Cadoli, Maurizio Lenzerini: The Complexity of Closed World Reasoning and Circumscription. AAAI 1990: 550-555
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-17 21:41 CEST by the dblp team