1,721,179 research outputs found
COMBINING LOGIC- AND OBJECT-ORIENTED PROGRAMMING LANGUAGE PARADIGMS
No full textThe usefulness and synergetic advantages of combining logic- and object-oriented programming in a declarative framework are explored. Rather than present another specific combination of logic and object programming, the authors discuss different kinds of extensions
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
Performance measurement of interactive CSP search algorithms
No full textThe Constraint Satisfaction Problem (CSP) is a good framework for
dealing with combinatorial problems, but it does not take into
account the interactive acquisition of the problem parameters. For
this reason, an extension of the CSP model, the Interactive CSP
model, has been proposed. Various ICSP solving
algorithms have been discussed as well. In order to verify for
which kind of problems the ICSP model is most promising, we
performed a series of systematic tests
Integrating induction and abduction in logic programming
No full textWe propose an approach for the integration of abduction and induction in
Logic Programming. We define an Abductive Learning Problem as an
extended Inductive Logic Programming problem where both the
background and target theories are abductive theories and where
abductive derivability is used as the coverage relation instead
of deductive derivability. The two main benefits of this
integration are the possibility of learning in presence of
incomplete knowledge and the increased expressive power of the
background and target theories. We present the system LAP
(Learning Abductive Programs) that is able to solve this extended
learning problem and we describe, by means of examples, four
different learning tasks that can be performed by the system:
learning from incomplete knowledge, learning rules with
exceptions, learning from integrity constraints and learning
recursive predicates
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
Coordinating the safe execution of tasks in a constrained multi-agent system
No full textThe problem of ensuring the execution of tasks in a constrained multi-agent system was studied. Some operators were proposed that could be mapped into a library of the languages used to encode the agents in the system. A formalism was also suggested that is used to express the way agents can coordinate the requests of services, and to verify that they do not collide with each other's conditions
Verification of choreographies during execution using the reactive event calculus
No full textThis article presents a run-time verification method of web service behaviour with respect to choreographies. We start from Dec- SerFlow as a graphical choreography description language. We select a core set of DecSerFlow elements and formalize them using a reactive version of the Event Calculus, based on the computational logic SCIFF framework. Our choice enables us to enrich DecSerFlow and the Event Calculus with quantitative time constraints and to model compensation actions
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
- …
