dblp.uni-trier.dewww.uni-trier.de

Marco Cadoli Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
78EELucas Bordeaux, Marco Cadoli, Toni Mancini: Generalizing consistency and other constraint properties to quantified constraints. ACM Trans. Comput. Log. 10(3): (2009)
2008
77EEToni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli: Evaluating ASP and Commercial Solvers on the CSPLib. Constraints 13(4): 407-436 (2008)
76EELucas 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
75EEMarco Cadoli, Diego Calvanese, Giuseppe De Giacomo, Toni Mancini: Finite Model Reasoning on UML Class Diagrams Via Constraint Programming. AI*IA 2007: 36-47
74EEMarco Cadoli, Toni Mancini: Using a Theorem Prover for Reasoning on Constraint Problems. Applied Artificial Intelligence 21(4&5): 383-404 (2007)
73EEToni Mancini, Marco Cadoli: Exploiting functional dependencies in declarative problem specifications. Artif. Intell. 171(16-17): 985-1010 (2007)
72EELucas Bordeaux, Marco Cadoli, Toni Mancini: Generalizing Consistency and other Constraint Properties to Quantified Constraints CoRR abs/0705.3561: (2007)
71EEMarco Cadoli, Toni Mancini: Combining relational algebra, SQL, constraint modelling, and local search. TPLP 7(1-2): 37-65 (2007)
2006
70EEMarco Cadoli, Fabio Patrizi: On the Separability of Subproblems in Benders Decompositions. CPAIOR 2006: 74-88
69 Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi: Evaluating ASP and Commercial Solvers on the CSPLib. ECAI 2006: 68-72
68EEMarco Cadoli, Toni Mancini, Fabio Patrizi: SAT as an Effective Solving Technology for Constraint Problems. ISMIS 2006: 540-549
67EEMarco Cadoli, Marco Schaerf: Partial Solutions with Unique Completion. Reasoning, Action and Interaction in AI Theories and Systems 2006: 101-115
66EEMarco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi: Evaluating ASP and commercial solvers on the CSPLib (Preliminary work). WLP 2006: 54-63
65EEMarco Cadoli, Toni Mancini: Automated reformulation of specifications by safe delay of constraints. Artif. Intell. 170(8-9): 779-801 (2006)
64EEMarco Cadoli, Toni Mancini: Combining Relational Algebra, SQL, Constraint Modelling, and Local Search CoRR abs/cs/0601043: (2006)
63EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits. IEEE Trans. Computers 55(7): 913-917 (2006)
2005
62 Lucas Bordeaux, Marco Cadoli, Toni Mancini: CSP Properties for Quantified Constraints: Definitions and Complexity. AAAI 2005: 360-365
61EEMarco Cadoli, Toni Mancini: Using a Theorem Prover for Reasoning on Constraint Problems. AI*IA 2005: 38-49
60EEToni Mancini, Marco Cadoli: Detecting and Breaking Symmetries by Reasoning on Problem Specifications. SARA 2005: 165-181
59EEMarco Cadoli, Thomas Eiter, Georg Gottlob: Complexity of propositional nested circumscription and nested abnormality theories. ACM Trans. Comput. Log. 6(2): 232-272 (2005)
58EEMarco Cadoli, Andrea Schaerf: : Compiling problem specifications into SAT. Artif. Intell. 162(1-2): 89-120 (2005)
2004
57EEMarco Cadoli, Diego Calvanese, Giuseppe De Giacomo: Towards Implementing Finite Model Reasoning in Description Logics. Description Logics 2004
56EEMarco Cadoli, Toni Mancini: Exploiting Functional Dependencies in Declarative Problem Specifications. JELIA 2004: 628-640
55 Marco Cadoli, Toni Mancini: Automated Reformulation of Specifications by Safe Delay of Constraints. KR 2004: 388-398
54EELucas Bordeaux, Marco Cadoli, Toni Mancini: Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems. LPAR 2004: 270-284
2003
53 Marco Cadoli, Toni Mancini: Towards automated reformulation of specications. APPIA-GULP-PRODE 2003: 398-409
52EEMarco Cadoli: Proposal-Based Negotiation in Convex Regions. CIA 2003: 93-108
2002
51EEMarco Cadoli, Toni Mancini: Combining Relational Algebra, SQL, and Constraint Programming. FroCos 2002: 147-161
50EEMarco Cadoli, Toni Mancini: Knowledge Compilation = Query Rewriting + View Synthesis. PODS 2002: 199-208
49EEMarco Cadoli, Thomas Eiter, Georg Gottlob: Complexity of Nested Circumscription and Nested Abnormality Theories CoRR cs.AI/0207072: (2002)
48EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: k-Approximating Circuits Electronic Colloquium on Computational Complexity (ECCC)(067): (2002)
47EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Preprocessing of Intractable Problems. Inf. Comput. 176(2): 89-120 (2002)
46 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)
2001
45EEMarco Cadoli: The Expressive Power of Binary Linear Programming. CP 2001: 570-574
44EEMarco Cadoli, Andrea Schaerf: Compiling Problem Specifications into SAT. ESOP 2001: 387-401
43 Marco Cadoli, Thomas Eiter, Georg Gottlob: Complexity of Nested Circumscription and Abnormality Theories. IJCAI 2001: 169-174
2000
42EEMarco Cadoli, Francesco Scarcello: Semantical and computational aspects of Horn approximations. Artif. Intell. 119(1-2): 1-17 (2000)
41 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)
40EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Space Efficiency of Propositional Knowledge Representation Formalisms. J. Artif. Intell. Res. (JAIR) 13: 1-31 (2000)
39 Andrea Schaerf, Marco Cadoli, Maurizio Lenzerini: LOCAL++: A C++ framework for local search algorithms. Softw., Pract. Exper. 30(3): 233-257 (2000)
1999
38EEMarco Cadoli: Using LPNMR for Problem Specification and Code Generation. LPNMR 1999: 372
37EEMarco Cadoli, Luigi Palopoli, Andrea Schaerf, Domenico Vasile: NP-SPEC: An Executable Specification Language for Solving All Problems in NP. PADL 1999: 16-30
36EEAndrea Schaerf, Maurizio Lenzerini, Marco Cadoli: LOCAL++: A C++ Framework for Local Search Algorithms. TOOLS (29) 1999: 152-161
35 Marco Cadoli, Luigi Palopoli, Francesco Scarcello: Propositional lower bounds: Algorithms and complexity. Ann. Math. Artif. Intell. 27(1-4): 129-148 (1999)
34EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. Artif. Intell. 115(1): 25-64 (1999)
1998
33 Marco Cadoli, Andrea Giovanardi, Marco Schaerf: An Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 1998: 262-267
32EEMarco Cadoli, Luigi Palopoli, Francesco Scarcello: Propositional Lower Bounds: Generalization and Algorithms. JELIA 1998: 355-367
31 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)
30EEMarco Cadoli, Luigi Palopoli: Circumscribing DATALOG: Expressive Power and Complexity. Theor. Comput. Sci. 193(1-2): 215-244 (1998)
1997
29 Marco Cadoli, Andrea Giovanardi, Marco Schaerf: Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. AI*IA 1997: 207-218
28 Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini: Datalog and Description Logics: Expressive Power. APPIA-GULP-PRODE 1997: 333-344
27EEMarco Cadoli, Luigi Palopoli, Maurizio Lenzerini: Datalog and Description Logics: Expressive Power. DBPL 1997: 281-298
26 Marco Cadoli, Francesco M. Donini: A Survey on Knowledge Compilation. AI Commun. 10(3-4): 137-150 (1997)
25EEMarco Cadoli, Thomas Eiter, Georg Gottlob: Default Logic as a Query Language. IEEE Trans. Knowl. Data Eng. 9(3): 448-463 (1997)
24EEMarco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri: On Compact Representations of Propositional Circumscription. Theor. Comput. Sci. 182(1-2): 183-202 (1997)
1996
23 Marco Cadoli, Luigi Palopoli, Maurizio Lenzerini: Datalog and Description Logics: Expressive Power - Preliminary Report. Description Logics 1996: 97-101
22 Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Feasibility and Unfeasibility of Off-Line Processing. ISTCS 1996: 100-109
21 Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. KR 1996: 364-373
20 Marco Cadoli, Marco Schaerf: On the complexity of Entailment in Propositional Multivalued Logics. Ann. Math. Artif. Intell. 18(1): 29-50 (1996)
19EEMarco Cadoli, Francesco M. Donini, Marco Schaerf: Is Intractability of Nonmonotonic Reasoning a Real Drawback? Artif. Intell. 88(1-2): 215-251 (1996)
1995
18 Marco Cadoli: Tractable Reasoning in Artificial Intelligence Springer 1995
17EEMarco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf: The Size of a Revised Knowledge Base. PODS 1995: 151-162
16EEMarco Cadoli, Francesco M. Donini, Marco Schaerf: On Compact Representations of Propositional Circumscription. STACS 1995: 205-216
15EEMarco Schaerf, Marco Cadoli: Tractable Reasoning via Approximation. Artif. Intell. 74(2): 249-310 (1995)
14 Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. Fundam. Inform. 23(1): 123-143 (1995)
1994
13 Marco Cadoli, Francesco M. Donini, Marco Schaerf: Is Intractability of Non-Monotonic Reasoning a Real Drawback? AAAI 1994: 946-951
12 Marco Cadoli, Thomas Eiter, Georg Gottlob: Default Logic as a Query Language. KR 1994: 99-108
11 Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. Fundam. Inform. 21(1/2): 103-112 (1994)
10 Marco Cadoli, Maurizio Lenzerini: The Complexity of Propositional Closed World Reasoning and Circumscription. J. Comput. Syst. Sci. 48(2): 255-310 (1994)
1993
9 Marco Cadoli: Semantical and Computational Aspects of Horn Approximations. IJCAI 1993: 39-45
8 Marco Cadoli, Marco Schaerf: A Survey of Complexity Results for Nonmonotonic Logics. J. Log. Program. 17(2/3&4): 127-160 (1993)
1992
7 Marco Cadoli, Marco Schaerf: Approximate Inference in Default Logic and Circumscription. ECAI 1992: 319-323
6 Marco Cadoli, Marco Schaerf: Approximation in Concept Description Languages. KR 1992: 330-341
5 Marco Cadoli, Marco Schaerf: Approximate Reasoning and Non-Omniscient Agents. TARK 1992: 169-183
4 Marco Cadoli, Thomas Eiter, Georg Gottlob: An Efficient Method for Eliminating Varying Predicates from a Circumscription. Artif. Intell. 54(2): 397-410 (1992)
3 Marco Cadoli: The Complexity of Model Checking for Circumscriptive Formulae. Inf. Process. Lett. 44(3): 113-118 (1992)
1991
2 Marco Cadoli, Marco Schaerf: Approximate Entailment. AI*IA 1991: 68-77
1990
1 Marco Cadoli, Maurizio Lenzerini: The Complexity of Closed World Reasoning and Circumscription. AAAI 1990: 550-555

Coauthor Index

1Lucas Bordeaux [54] [62] [72] [76] [78]
2Diego Calvanese [57] [75]
3Francesco M. Donini [13] [16] [17] [19] [21] [22] [24] [26] [34] [40] [47] [48] [63]
4Thomas Eiter [4] [12] [25] [43] [49] [59]
5Giuseppe De Giacomo [57] [75]
6Andrea Giovanardi [29] [33] [46]
7Massimo Giovanardi [46]
8Georg Gottlob [4] [12] [25] [43] [49] [59]
9Giovambattista Ianni [41]
10Maurizio Lenzerini [1] [10] [23] [27] [28] [36] [39]
11Paolo Liberatore [17] [21] [22] [34] [40] [47] [48] [63]
12Toni Mancini [50] [51] [53] [54] [55] [56] [60] [61] [62] [64] [65] [66] [68] [69] [71] [72] [73] [74] [75] [76] [77] [78]
13Davide Micaletto [66] [69] [77]
14Luigi Palopoli [23] [27] [28] [30] [32] [35] [37] [41]
15Fabio Patrizi [66] [68] [69] [70] [77]
16Francesco Scarcello [32] [35] [42]
17Andrea Schaerf [36] [37] [39] [41] [44] [58]
18Marco Schaerf [2] [5] [6] [7] [8] [11] [13] [14] [15] [16] [17] [19] [20] [21] [22] [24] [29] [33] [34] [40] [46] [47] [48] [63] [67]
19Riccardo Silvestri [24]
20Carolyn L. Talcott [31]
21Domenico Vasile [37] [41]
22Richard W. Weyhrauch [31]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)