CADOLI, Marco
 Distribuzione geografica
Continente #
NA - Nord America 2.783
EU - Europa 549
AS - Asia 435
SA - Sud America 63
AF - Africa 3
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 3.835
Nazione #
US - Stati Uniti d'America 2.769
SG - Singapore 196
UA - Ucraina 128
IN - India 124
IT - Italia 118
SE - Svezia 118
CN - Cina 108
FI - Finlandia 66
BR - Brasile 34
GB - Regno Unito 30
AR - Argentina 25
DE - Germania 24
RU - Federazione Russa 23
IE - Irlanda 15
CA - Canada 12
NL - Olanda 8
BG - Bulgaria 5
RO - Romania 5
BE - Belgio 4
FR - Francia 3
IQ - Iraq 2
AU - Australia 1
AZ - Azerbaigian 1
CL - Cile 1
CO - Colombia 1
DO - Repubblica Dominicana 1
EG - Egitto 1
ES - Italia 1
EU - Europa 1
GR - Grecia 1
IL - Israele 1
KZ - Kazakistan 1
MA - Marocco 1
MX - Messico 1
NP - Nepal 1
PK - Pakistan 1
PY - Paraguay 1
TG - Togo 1
VE - Venezuela 1
Totale 3.835
Città #
Fairfield 446
Woodbridge 235
Chandler 216
Santa Clara 199
Ashburn 172
Cambridge 161
Seattle 158
Wilmington 152
Houston 133
Singapore 118
Princeton 75
Beijing 69
Ann Arbor 65
Plano 58
Jacksonville 55
Rome 46
Lawrence 38
Boston 37
Des Moines 37
San Paolo di Civitate 35
Millbury 34
San Diego 33
Dearborn 25
Federal 23
Dublin 15
Andover 14
Boardman 14
Norwalk 14
Falkenstein 13
Southend 12
Toronto 11
Delhi 10
Falls Church 8
Helsinki 8
Nanjing 8
Moscow 7
Sofia 5
Centrale 4
London 4
Mannheim 4
San Mateo 4
Viterbo 4
Brussels 3
Hamburg 3
Hefei 3
Littleton 3
Los Angeles 3
Messina 3
Auburn Hills 2
Brasília 2
Buffalo 2
Campinas 2
Canale Monterano 2
Formia 2
Hounslow 2
Indiana 2
Kunming 2
Ningbo 2
Zhengzhou 2
Agadir 1
Aktobe 1
Antwerp 1
Araçatuba 1
Baku 1
Baotou 1
Bituruna 1
Bologna 1
Bom Jesus do Galho 1
Botucatu 1
Bühl 1
Cairo 1
Capão da Canoa 1
Caracas 1
Changzhou 1
Chicago 1
Chongqing 1
Cianorte 1
Curitiba 1
Divinópolis 1
Fayetteville 1
Fuzhou 1
Goiânia 1
Grafing 1
Guangzhou 1
Holambra 1
Iapu 1
Ipatinga 1
Isernia 1
Jacareí 1
Jinan 1
Juiz de Fora 1
Jönköping 1
Kasur 1
Kut 1
Langfang 1
Lanús 1
Linhares 1
Lishui 1
Lomé 1
Magé 1
Totale 2.860
Nome #
Compiling problem specifications into SAT 135
NP-Spec: An executable specification language for solving all problems in NP 99
Approximate Inference in Default Logic and Circumscription 97
Compiling problem specifications into SAT 93
The expressive power of binary linear programming 90
k-approximating circuits 90
A SURVEY OF COMPLEXITY RESULTS FOR NONMONOTONIC LOGICS 88
Default logic as a query language 85
Exploiting functional dependencies in declarative problem specifications 84
Automated reformulation of specifications by safe delay of constraints 80
On the separability of subproblems in Benders decompositions 79
SAT as an effective solving technology for constraint problems 78
Finite Model Reasoning on UML Class Diagrams Via Constraint Programming 78
Detecting and breaking symmetries by reasoning on problem specifications 76
Combining Relational Algebra, SQL, and Constraint Programming 75
Semantical and computational aspects of Horn approximations 73
Using LPNMR for problem specification and code generation 73
Automated reformulation of specifications by safe delay of constraints 73
Exploiting functional dependencies in declarative problem specifications 73
On the complexity of entailment in propositional multivalued logics 70
Knowledge compilation = Query rewriting + View synthesis 67
Using a Theorem Prover for Reasoning on Constraint Problems 66
Approximate entailment 66
Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae 66
Evaluating ASP and commercial solvers on the CSPLib 66
Proposal-based negotiation in convex regions 65
Using a theorem prover for reasoning on constraint problems 65
LOCAL++: A C++ framework for local search algorithms 65
Exploiting fixable, removable, and implied values in Constraint Satisfaction Problems 65
Feasibility and unfeasibility of off-line processing 64
Automated reformulation of specifications by safe delay of constraints 64
Finite model reasoning on UML class diagrams via constraint programming 64
The size of a revised knowledge base 64
Circumscribing datalog: expressive power and complexity 62
Partial Solutions with Unique Completion 58
On Compact Representations of Propositional Circumscription 58
Exploiting functional dependencies in declarative problem specifications 58
An algorithm to evaluate quantified Boolean formulae and its experimental evaluation 57
Is intractability of nonmonotonic reasoning a real drawback? 55
Tractable Reasoning via Approximation 54
Space efficiency of propositional knowledge representation formalisms 54
On compact representations of propositional circumscription 54
Size of a revised knowledge base 54
Complexity of nested circumscription and abnormality theories. 51
Is intractability of non-monotonic reasoning a real drawback? 51
Complexity of Propositional Nested Circumscription and Abnormality Theories 49
Propositional lower bounds: Algorithms and complexity 49
Algorithm to evaluate Quantified Boolean Formulae 49
Using a theorem prover for reasoning on constraint problems 47
Preprocessing of intractable problems 46
Esercizi di progettazione di programmi in C++ 45
A survey on knowledge compilation 44
Towards automated reformulation of specifications 44
Programmazione orientata agli oggetti e Java 42
Detecting and breaking symmetries on specifications 39
CSP properties for Quantified Constraints: Definitions and complexity 35
Giornata di Lavoro del gruppo di “Rappresentazione della conoscenza e ragionamento automatico” (RCRA) dell’Associazione Italiana per l’Intelligenza Artificiale (AI*IA), tenutasi a Ferrara, intitolata “Analisi sperimentale e benchmark di algoritmi per l’Intelligenza Artificiale” (RCRA 2005) 34
Evaluating ASP and commercial solvers on the CSPLib – Preliminary report 33
Towards Implementing Finite Model Reasoning in Description Logics 29
Modeling real requirements for cooperative software development: A case study 28
Finite Satisfiability of UML class diagrams by Constraint Programming 26
iAgree: a system for proposal-based negotiation among intelligent agents 23
Using abstract resources to control reasoning 20
Giornata di Lavoro del gruppo di “Rappresentazione della conoscenza e ragionamento automatico” (RCRA) dell’Associazione Italiana per l’Intelligenza Artificiale (AI*IA), tenutasi a Udine, intitolata “Analisi sperimentale e benchmark di algoritmi per l’Intelligenza Artificiale” 19
Totale 3.903
Categoria #
all - tutte 10.846
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 10.846


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020545 0 0 0 0 0 0 129 130 113 89 63 21
2020/2021246 34 48 12 19 9 11 0 25 35 34 17 2
2021/2022716 2 47 65 12 84 26 25 65 54 61 114 161
2022/2023678 135 136 34 68 81 83 1 31 74 0 20 15
2023/2024205 24 46 6 5 35 10 4 4 0 27 24 20
2024/2025451 38 26 19 23 180 143 22 0 0 0 0 0
Totale 3.903