MARATEA, MARCO
 Distribuzione geografica
Continente #
EU - Europa 10.992
AS - Asia 40
SA - Sud America 29
NA - Nord America 4
Totale 11.065
Nazione #
IT - Italia 10.992
BR - Brasile 25
SG - Singapore 15
CN - Cina 14
VN - Vietnam 9
AR - Argentina 2
US - Stati Uniti d'America 2
AE - Emirati Arabi Uniti 1
CL - Cile 1
EC - Ecuador 1
HN - Honduras 1
ID - Indonesia 1
MX - Messico 1
Totale 11.065
Città #
Genova 6.804
Genoa 2.594
Rapallo 783
Vado Ligure 783
Bordighera 26
Ho Chi Minh City 5
Beijing 4
Belo Horizonte 2
Brasília 2
Da Nang 2
Hanoi 2
Marília 2
Rio de Janeiro 2
Andradina 1
Angra dos Reis 1
Atibaia 1
Betim 1
Capivari 1
Caruaru 1
Catanduva 1
Des Moines 1
Divinópolis 1
Farroupilha 1
Guayaquil 1
Hortolândia 1
Itabuna 1
Jaboatão dos Guararapes 1
Lajinha 1
Longchamps 1
Palhoça 1
Porto Alegre 1
Puebla City 1
Rio Verde 1
San Juan 1
Santiago 1
Sharjah 1
Singapore 1
Surabaya 1
São José dos Campos 1
Tegucigalpa 1
Turin 1
West Plains 1
Totale 11.040
Nome #
Algorithms for Solving Satisfiability Problems with Qualitative Preferences 200
SAT-Based Planning with Minimal-#actions Plans and "soft" Goals 186
(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver 174
Computing All Optimal Solutions in Satisfiability Problems with Preferences 166
A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints 160
Abstract Solvers for Quantified Boolean Formulas and their Applications 159
Cautious reasoning in ASP via minimal models and unsatisfiable cores 158
Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs 153
On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) 152
Dependent and Independent Variables in Propositional Satisfiability 152
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming 150
Automated Selection of Grounding Algorithm in Answer Set Programming 149
Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions 148
A Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences 146
Improving Plan Quality in SAT-Based Planning 146
Introducing Preferences in Planning as Satisfiability 145
Solving satisfiability problems with preferences 143
The Multi-Engine ASP Solver ME-ASP 143
Experimenting with Look-Back Heuristics for Hard ASP Programs 142
Answer Set Programming based on Propositional Satisfiability 141
Abstract solvers for dung’s argumentation frameworks 140
An ontology for historical research documents 135
Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming 134
TSAT++: an Open Platform for Satisfiability Modulo Theories 133
OPTSAT: A Tool for Solving SAT Related Optimization Problems 132
DLVMC: Enhanced Model Checking in DLV 132
Automated planning techniques for robot manipulation tasks involving articulated objects 130
Look-back Techniques for ASP Programs with Aggregates 128
Evaluating search heuristics and optimization techniques in propositional satisfiability 128
The Sixth Answer Set Programming Competition 128
Advances in Multi-engine ASP Solving 127
The SAT-based Approach to Separation Logic 127
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers 125
Introducing the second international competition on computational models of argumentation 125
Systems, Engineering Environments, and Competitions 121
Design and Results of the Fifth Answer Set Programming Competition 119
Shared aggregate sets in answer set programming 119
An Action-based Approach to the Formal Specification and Automated Analysis of Business Processes under Authorization Constraints 117
On the manipulation of articulated objects in human-robot cooperation scenarios 117
The Design of the Seventh Answer Set Programming Competition 113
An advanced answer set programming encoding for nurse scheduling 113
On the Relation among Answer Set Solvers 112
Disjunctive answer set solvers via templates 112
Abstract Answer Set Solvers for Cautious Reasoning 111
Multi-level Algorithm Selection for ASP. 111
Special issue: Selected papers from the 15th International Conference of the Italian Association for Artificial Intelligence 111
An ASP-Based Framework for the Manipulation of Articulated Objects Using Dual-Arm Robots 111
A multi-engine approach to answer-set programming 110
Experimental evaluation of algorithms for solving problems with combinatorial explosion 110
Solving Disjunctive Temporal Problems with Preferences using Maximum Satisfiability 108
A domain ontology for historical research documents 106
Translation-based approaches for solving disjunctive temporal problems with preferences 102
20th RCRA International workshop on "experimental evaluation of algorithms for solving problems with combinatorial explosion" 101
An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems 101
What should an ASP Solver output? A Multiple Position Paper 98
Efficient Decision Procedures for the Integration of Planning and Formal Verification in Advanced Systems 97
Multi-engine ASP solving with policy adaptation 97
Planning as Satisfiability with IPC Simple Preferences and Action Costs 96
A new Approach for Solving Satisfiability Problems with Qualitative Preferences 93
An Ontology-Based Archive for Historical Research 92
Operating Room Scheduling via Answer Set Programming 92
Design and results of the Second International Competition on Computational Models of Argumentation 87
Solving Optimization Problems with DLL 86
A generate-and-test approach for computing "optimal" plans in SAT-based planning 86
Nurse scheduling via answer set programming 86
Abstract Disjunctive Answer Set Solvers 85
Efficient DTPP solving with a reduction-based approach 85
Evaluation Techniques and Systems for Answer Set Programming: a Survey 85
KR&R approaches for robot manipulation tasks with articulated objects 83
A SAT-based polynomial space algorithm for answer set programming 80
Abstract Solvers for Computing Cautious Consequences of ASP programs 79
In-Station Train Dispatching: A PDDL+ Planning Approach 79
SAT-Based Answer Set Programming 78
Planning as Satisfiability with Preferences 78
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving 78
Applying Machine Learning Techniques to ASP Solving 77
A Pseudo-Boolean approach for solving planning problems with IPC simple preferences 76
Special issue of the 22nd RCRA international workshop on "Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion" Preface 76
Prefazione agli Atti del Convegno Italiano di Logica Computazionale Trentesima Edizione, CILC 2015 Genova, 1-3 Luglio 2015 75
Eighth ASPOCP International Workshop on "Answer Set Programming and Other Computing Paradigms": Preface 75
Computational analysis of freeway traffic control based on a linearized prediction model 74
A Planning-based Approach for In-Station Train Dispatching 74
Modeling and Reasoning about Business Processes under Authorization Constraints: a Planning-based Approach. 71
A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract) 71
Computing answer sets of a logic program via-enumeration of SAT certificates 70
In-Station Train Movements Prediction: from Shallow to Deep Multi Scale Models 70
Automated Planning Encodings for the Manipulation of Articulated Objects in 3D with Gravity 69
An Efficient Hybrid Planning Framework for In-Station Train Dispatching 66
Solving Train Load Planning Problems with Boolean Optimization 65
Special Issue on the 30th Italian Conference on Computational Logic: CILC 2015 65
An ASP-based Solution for Operating Room Scheduling with Beds Management 65
An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic 65
Maximum likelihood approach to HF radar performance characterization 64
Chemotherapy Treatment Scheduling via Answer Set Programming 64
CASP Solutions for Planning in Hydrid Domains 63
An overview of ASP applications in the health-care domain 62
The Design of the Sixth Answer Set Programming Competition -- Report -- 60
On the Configuration of {SAT} Formulae 60
A Two-Phase ASP Encoding for Solving Rehabilitation Scheduling 59
A Simple Proof-theoretic Characterization of Stable Models: Reduction to Difference Logic and Experiments 47
Totale 10.665
Categoria #
all - tutte 40.121
article - articoli 12.765
book - libri 0
conference - conferenze 22.095
curatela - curatele 282
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 4.979
Totale 80.242


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021783 0 0 0 66 26 180 72 94 108 98 66 73
2021/20221.316 40 61 126 243 26 87 60 284 88 108 39 154
2022/2023994 117 60 12 92 132 189 44 45 191 1 107 4
2023/2024597 19 60 15 84 45 110 38 45 33 31 37 80
2024/20251.839 65 138 43 86 305 226 171 268 53 76 223 185
2025/2026885 368 72 202 243 0 0 0 0 0 0 0 0
Totale 11.313