default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Cadoli
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[i6]Lucas Bordeaux, Marco Cadoli, Toni Mancini:
A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability. CoRR abs/1401.3430 (2014)- 2013
- [j34]Marco Cadoli, Diego Calvanese, Giuseppe De Giacomo, Toni Mancini:
Finite model reasoning on UML class diagrams via constraint programming. Intelligenza Artificiale 7(1): 57-65 (2013) - 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. Ann. Oper. Res. 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): 17:1-17:25 (2009) - 2008
- [j31]Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli:
Evaluating ASP and Commercial Solvers on the CSPLib. Constraints An Int. J. 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. 32: 607-629 (2008) - 2007
- [j29]Marco Cadoli, Toni Mancini:
Using a Theorem Prover for Reasoning on Constraint Problems. Appl. Artif. Intell. 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. Theory Pract. Log. Program. 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]Marco Cadoli:
Proposal-Based Negotiation in Convex Regions. CIA 2003: 93-108 - 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. Reason. 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. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c24]Marco Cadoli:
The Expressive Power of Binary Linear Programming. CP 2001: 570-574 - [c23]Marco Cadoli, Andrea Schaerf:
Compiling Problem Specifications into SAT. ESOP 2001: 387-401 - [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. 13: 1-31 (2000) - [j17]Andrea Schaerf, Marco Cadoli, Maurizio Lenzerini:
LOCAL++: A C++ framework for local search algorithms. Softw. Pract. Exp. 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]Marco Cadoli:
Using LPNMR for Problem Specification and Code Generation. LPNMR 1999: 372 - [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. J. Log. Lang. Inf. 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. Informaticae 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. Informaticae 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]Marco Cadoli, Thomas Eiter, Georg Gottlob:
Default Logic as a Query Language. KR 1994: 99-108 - 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]Marco Cadoli:
Semantical and Computational Aspects of Horn Approximations. IJCAI 1993: 39-45 - 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]Marco Cadoli, Marco Schaerf:
Approximation in Concept Description Languages. KR 1992: 330-341 - [c3]Marco Cadoli, Marco Schaerf:
Approximate Reasoning and Non-Omniscient Agents. TARK 1992: 169-183 - 1991
- [c2]Marco Cadoli, Marco Schaerf:
Approximate Entailment. AI*IA 1991: 68-77 - 1990
- [c1]Marco Cadoli, Maurizio Lenzerini:
The Complexity of Closed World Reasoning and Circumscription. AAAI 1990: 550-555
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
