| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Marco Cadoli 46 Marco Cadoli, Toni Mancini : Combining Relational Algebra, SQL, and Constraint Programming. FroCos 2002 : 147-161 45 Marco Cadoli, Toni Mancini : Knowledge Compilation = Query Rewriting + View Synthesis. PODS 2002 : 199-208 44 Marco Cadoli, Francesco M. Donini , Paolo Liberatore , Marco Schaerf : k-Approximating Circuits. Electronic Colloquium on Computational Complexity (ECCC) (067): (2002) 43 Marco Cadoli, Marco Schaerf , Andrea Giovanardi , Massimo Giovanardi : An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. Journal of Automated Reasoning 28 (2): 101-142 (2002) 42 Marco Cadoli: The Expressive Power of Binary Linear Programming. CP 2001 : 570-574 41 Marco Cadoli, Andrea Schaerf : Compiling Problem Specifications into SAT. ESOP 2001 : 387-401 40 Marco Cadoli, Thomas Eiter , Georg Gottlob : Complexity of Nested Circumscription and Abnormality Theories. IJCAI 2001 : 169-174 39 Marco Cadoli, Francesco Scarcello : Semantical and computational aspects of Horn approximations. Artificial Intelligence 119 (1-2): 1-17 (2000) 38 Marco Cadoli, Giovambattista Ianni , Luigi Palopoli , Andrea Schaerf , Domenico Vasile : NP-SPEC: an executable specification language for solving all problems in NP. Computer Languages 26 (2-4): 165-195 (2000) 37 Marco Cadoli, Francesco M. Donini , Paolo Liberatore , Marco Schaerf : Space Efficiency of Propositional Knowledge Representation Formalisms. JAIR 13 : 1-31 (2000) 36 Andrea Schaerf , Marco Cadoli, Maurizio Lenzerini : LOCAL++: A C++ framework for local search algorithms. Software - Practice and Experience 30 (3): 233-257 (2000) 35 Marco Cadoli: Using LPNMR for Problem Specification and Code Generation. LPNMR 1999 : 372 34 Marco Cadoli, Luigi Palopoli , Andrea Schaerf , Domenico Vasile : NP-SPEC: An Executable Specification Language for Solving All Problems in NP. PADL 1999 : 16-30 33 Marco Cadoli, Luigi Palopoli , Francesco Scarcello : Propositional lower bounds: Algorithms and complexity. Annals of Mathematics and Artificial Intelligence 27 (1-4): 129-148 (1999) 32 Marco Cadoli, Francesco M. Donini , Paolo Liberatore , Marco Schaerf : The Size of a Revised Knowledge Base. Artificial Intelligence 115 (1): 25-64 (1999) 31 Marco Cadoli, Andrea Giovanardi , Marco Schaerf : An Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 1998 : 262-267 30 Marco Cadoli, Luigi Palopoli , Francesco Scarcello : Propositional Lower Bounds: Generalization and Algorithms. JELIA 1998 : 355-367 29 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) 28 Marco Cadoli, Luigi Palopoli : Circumscribing DATALOG: Expressive Power and Complexity. TCS 193 (1-2): 215-244 (1998) 27 Marco Cadoli, Andrea Giovanardi , Marco Schaerf : Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae. AI*IA 1997 : 207-218 26 Marco Cadoli, Luigi Palopoli , Maurizio Lenzerini : Datalog and Description Logics: Expressive Power. DBPL 1997 : 281-298 25 Marco Cadoli, Francesco M. Donini : A Survey on Knowledge Compilation. AI Communications 10 (3-4): 137-150 (1997) 24 Marco Cadoli, Francesco M. Donini , Marco Schaerf , Riccardo Silvestri : On Compact Representations of Propositional Circumscription. TCS 182 (1-2): 183-202 (1997) 23 Marco Cadoli, Thomas Eiter , Georg Gottlob : Default Logic as a Query Language. TKDE 9 (3): 448-463 (1997) 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. Annals of Mathematics and Artificial Intelligence 18 (1): 29-50 (1996) 19 Marco Cadoli, Francesco M. Donini , Marco Schaerf : Is Intractability of Nonmonotonic Reasoning a Real Drawback? Artificial Intelligence 88 (1-2): 215-251 (1996) 18 Marco Cadoli: Tractable Reasoning in Artificial Intelligence. Springer 1995 17 Marco Cadoli, Francesco M. Donini , Paolo Liberatore , Marco Schaerf : The Size of a Revised Knowledge Base. PODS 1995 : 151-162 16 Marco Cadoli, Francesco M. Donini , Marco Schaerf : On Compact Representations of Propositional Circumscription. STACS 1995 : 205-216 15 Marco Schaerf , Marco Cadoli: Tractable Reasoning via Approximation. Artificial Intelligence 74 (2): 249-310 (1995) 14 Marco Cadoli, Marco Schaerf : Approximate Inference in Default Logic and Circumscription. Fundamenta Informaticae 23 (1): 123-143 (1995) 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. Fundamenta Informaticae 21 (1/2): 103-112 (1994) 10 Marco Cadoli, Maurizio Lenzerini : The Complexity of Propositional Closed World Reasoning and Circumscription. JCSS 48 (2): 255-310 (1994) 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. JLP 17 (2/3&4): 127-160 (1993) 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. Artificial Intelligence 54 (2): 397-410 (1992) 3 Marco Cadoli: The Complexity of Model Checking for Circumscriptive Formulae. Information Processing Letters 44 (3): 113-118 (1992) 2 Marco Cadoli, Marco Schaerf : Approximate Entailment. AI*IA 1991 : 68-77 1 Marco Cadoli, Maurizio Lenzerini : The Complexity of Closed World Reasoning and Circumscription. AAAI 1990 : 550-555  DiSC'03 © 2003 Association for Computing Machinery |
