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