Catalogo dei prodotti della ricerca

CADOLI, Marco
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.566
EU - Europa 497
AS - Asia 269
SA - Sud America 24
AF - Africa 1
Continente sconosciuto - Info sul continente non disponibili 1
OC - Oceania 1
Totale 3.359
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.554
UA - Ucraina 128
SE - Svezia 118
IN - India 114
IT - Italia 113
CN - Cina 98
FI - Finlandia 59
SG - Singapore 56
GB - Regno Unito 30
AR - Argentina 23
IE - Irlanda 15
CA - Canada 12
NL - Olanda 8
DE - Germania 6
BG - Bulgaria 5
RO - Romania 5
BE - Belgio 4
FR - Francia 3
AU - Australia 1
CL - Cile 1
ES - Italia 1
EU - Europa 1
GR - Grecia 1
IL - Israele 1
RU - Federazione Russa 1
TG - Togo 1
Totale 3.359
Salva come PNG Salva come JPEG
Città #
Fairfield 446
Woodbridge 235
Chandler 216
Ashburn 171
Cambridge 161
Seattle 158
Wilmington 152
Houston 133
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
Singapore 21
Dublin 15
Andover 14
Boardman 14
Norwalk 14
Southend 12
Toronto 11
Falls Church 8
Nanjing 8
Sofia 5
Centrale 4
London 4
San Mateo 4
Viterbo 4
Brussels 3
Hamburg 3
Hefei 3
Los Angeles 3
Auburn Hills 2
Canale Monterano 2
Formia 2
Hounslow 2
Indiana 2
Kunming 2
Messina 2
Ningbo 2
Zhengzhou 2
Antwerp 1
Baotou 1
Bologna 1
Buffalo 1
Bühl 1
Chicago 1
Chongqing 1
Fayetteville 1
Fuzhou 1
Grafing 1
Helsinki 1
Jinan 1
Jönköping 1
Langfang 1
Lishui 1
Lomé 1
Mesagne 1
Milan 1
Montréal 1
Mountain View 1
Naaldwijk 1
Nanchang 1
New Bedfont 1
New York 1
Perth 1
Philadelphia 1
Provo 1
Redmond 1
Redwood City 1
Sabadell 1
Salerno 1
San Jose 1
San Pablo 1
Santiago 1
Seversk 1
Shanghai 1
Suri 1
Tappahannock 1
Verona 1
Vicenza 1
Westminster 1
Yellow Springs 1
Totale 2.512
Salva come PNG Salva come JPEG
Nome #
Compiling problem specifications into SAT 95
NP-Spec: An executable specification language for solving all problems in NP 94
k-approximating circuits 86
Compiling problem specifications into SAT 83
The expressive power of binary linear programming 83
Approximate Inference in Default Logic and Circumscription 82
Exploiting functional dependencies in declarative problem specifications 80
Default logic as a query language 78
A SURVEY OF COMPLEXITY RESULTS FOR NONMONOTONIC LOGICS 73
Automated reformulation of specifications by safe delay of constraints 72
SAT as an effective solving technology for constraint problems 71
On the separability of subproblems in Benders decompositions 71
Semantical and computational aspects of Horn approximations 69
Detecting and breaking symmetries by reasoning on problem specifications 69
Combining Relational Algebra, SQL, and Constraint Programming 69
Finite Model Reasoning on UML Class Diagrams Via Constraint Programming 69
Using LPNMR for problem specification and code generation 68
Exploiting functional dependencies in declarative problem specifications 67
Automated reformulation of specifications by safe delay of constraints 66
On the complexity of entailment in propositional multivalued logics 64
Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae 62
Exploiting fixable, removable, and implied values in Constraint Satisfaction Problems 61
Proposal-based negotiation in convex regions 60
Using a Theorem Prover for Reasoning on Constraint Problems 60
Knowledge compilation = Query rewriting + View synthesis 60
Feasibility and unfeasibility of off-line processing 59
Using a theorem prover for reasoning on constraint problems 59
LOCAL++: A C++ framework for local search algorithms 59
The size of a revised knowledge base 59
Evaluating ASP and commercial solvers on the CSPLib 59
Automated reformulation of specifications by safe delay of constraints 57
Approximate entailment 56
Circumscribing datalog: expressive power and complexity 55
Partial Solutions with Unique Completion 54
On Compact Representations of Propositional Circumscription 54
Exploiting functional dependencies in declarative problem specifications 53
Is intractability of nonmonotonic reasoning a real drawback? 51
Size of a revised knowledge base 51
Tractable Reasoning via Approximation 50
An algorithm to evaluate quantified Boolean formulae and its experimental evaluation 50
On compact representations of propositional circumscription 50
Space efficiency of propositional knowledge representation formalisms 49
Is intractability of non-monotonic reasoning a real drawback? 48
Propositional lower bounds: Algorithms and complexity 44
Complexity of nested circumscription and abnormality theories. 44
Complexity of Propositional Nested Circumscription and Abnormality Theories 42
Using a theorem prover for reasoning on constraint problems 41
Preprocessing of intractable problems 41
Algorithm to evaluate Quantified Boolean Formulae 40
Towards automated reformulation of specifications 37
A survey on knowledge compilation 36
Programmazione orientata agli oggetti e Java 35
Esercizi di progettazione di programmi in C++ 33
Detecting and breaking symmetries on specifications 31
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) 30
Finite model reasoning on UML class diagrams via constraint programming 28
CSP properties for Quantified Constraints: Definitions and complexity 28
Evaluating ASP and commercial solvers on the CSPLib – Preliminary report 23
Towards Implementing Finite Model Reasoning in Description Logics 22
iAgree: a system for proposal-based negotiation among intelligent agents 19
Finite Satisfiability of UML class diagrams by Constraint Programming 19
Modeling real requirements for cooperative software development: A case study 19
Using abstract resources to control reasoning 16
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” 14
Totale 3.427
Salva come PNG Salva come JPEG
Categoria #
all - tutte 8.273
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 8.273
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019282 0 0 0 0 0 0 0 0 0 0 158 124
2019/20201.002 122 37 18 56 104 120 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/2024180 24 46 6 5 35 10 4 4 0 27 19 0
Totale 3.427