1,721,013 research outputs found
RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
No full textTheory and experimentation are two roots common to many scientific disciplines such as Physics,
Medicine, and Computer Science. In all these disciplines theory and experimentation are tightly intertwined: they grow together and together make Science progress and evolve.
Computer science is often faced with problems of combinatorial nature which are studied in the NP-
completeness theory. For those problems, in many cases, experiments help us to point-out interesting
phenomena and to derive efficient solutions.
Rappresentazione della Conoscenza e Ragionamento Automatico (RCRA,
rcra.aixia.it)
is a scientific community interested in Knowledge Representation and Automated Reasoning. It is part of the Italian Association for Artificial Intelligence (AI*IA, www.aixia.it).
In the last few years, the yearly workshop of RCRA was devoted to the experimental evaluation of algorithms with very large
search space.
In this issue we present a selection of the papers presented in the 2009 edition, held in Reggio Emilia (Italy) the 11th and 12th of December in conjunction with the XI conference of AI*IA. Beside organizing
the workshop, RCRA was responsible for one session of the conference. 14 papers were presented at the workshop, and 4 papers were selected for the RCRA session at the AI*IA conference. The authors of
these 18 papers were invited to submit an extended version of their article for possible publication in this special issue, and, after a further selection and two rounds of reviews, eight articles have been accepted
18th RCRA international workshop on "experimental evaluation of algorithms for solving problems with combinatorial explosion"
No full text[No abstract available
Automated reasoning.
No full textKnowledge representation and automated reasoning are two of the pillars of Artificial Intelligence but, differently from
other pillars, they are strictly intertwined. Depending on how knowledge is represented, different types of reasoning can be applied
and, on the other hand, new developments in the automated reasoning column fosters new ideas on the knowledge representation
side. The Italian community has been always very involved in these fascinating themes, and this is witnessed by the lively group of
knowledge representation and automated reasoning (Rappresentazione della Conoscenza e Ragionamento Automatico, RCRA)
of AI*IA.
In this paper we survey the developments on automated reasoning in the last 25 years, with particular emphasis on the research
of the Italian community and of the RCRA group. The focus will be mainly on the algorithmic side, while a companion paper
focuses more on the knowledge representation side, and on the vast area of semantic technologies
17th RCRA international workshop on "Experimental evaluation of algorithms for solving problems with combinatorial explosion"
Full text link[No abstract available
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
ConSQL simulator
No full textUn risolutore di problemi combinatori e di ottimizzazione modellati nel linguaggio ConSQL (dello stesso autore) con istanze memorizzate in basi di dati relazionali.
La risoluzione avviene mediante tecniche di ricerca locale.
Il sistema si affida ad un DBMS relazionale per la verifica dei vincoli e la valutazione delle mosse.
I vantaggi dell'approccio sono descritti negli articoli:
- Marco Cadoli and Toni Mancini. Combining Relational Algebra, sql, Constraint Modelling, and local search. Theory and Practice of Logic Programming, 7(1):1–29, 2006
- Toni Mancini, Pierre Flener, Amir Hossein Monshi, Justin Pearson. Constrained Optimi- zation Over Massive Databases. In Marco Gavanelli and Toni Mancini, editors, Proceedings of the Sixteenth RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2009), volume 589 of CEUR Workshop Proceedings, Reggio Emilia, Italy, 2009. CEUR-WS.org.
- Toni Mancini, Pierre Flener, Justin Pearson.
Local Search over Relational Databases
In proceedings of the 7th Workshop on Local Search techniques in Constraint Satisfaction (LSCS 2010), held at the 16th International Conference on Principles and Practice of Constraint Programming (CP 2010).
St Andrews, Scotland (UK), 2010
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
