Measuring What’s Valued Or Valuing What’s Measured? Knowledge Production and the Research Assessment Exercise

Power is everywhere. But what is it and how does it infuse personal and institutional relationships in higher education? Power, Knowledge and the Academy: The Institutional is Political takes a close-up and critical look at both the elusive and blatant workings and consequences of power in a range of everyday sites in universities. Authors work with multi-layered conceptions of power to disturb the idea of the academy as a haven of detached reason and instead reveal the ways in which power shapes personal and institutional relationships, the production of knowledge and the construction of academic careers. Chapters focus on, among other areas, student-supervisor relationships, personal PhD journeys, power in research teams, networking, the Research Assessment Exercise in the UK, and the power to construct knowledge in literature reviews. This chapter does not address which mechanism of research assessment provides a more truthful account of the value of a set of ‘research outputs’. Instead, it focuses on the power of any such mechanism to reinforce particular values and to inscribe hierarchies regarding knowledge. Regardless of what replaces it, the UK's RAE will have been productive, not just reflective of academic values. Some of the negative consequences of the RAE for UK academic life are considered, focusing on the operation of power through processes of knowledge production

Three epistemic paralogisms, one logic of utterances

Assuming that a paralogism is an unintentionally invalid reasoning, we give an exampl

Default Logic in a Coherent Setting

In this talk - based on the results of a forthcoming paper (Coletti, Scozzafava and Vantaggi 2002), presented also by one of us at the Conference on "Non Classical Logic, Approximate Reasoning and Soft-Computing" (Anacapri, Italy, 2001) - we discuss the problem of representing default rules by means of a suitable coherent conditional probability, defined on a family of conditional events. An event is singled-out (in our approach) by a proposition, that is a statement that can be either true or false; a conditional event is consequently defined by means of two propositions and is a 3-valued entity, the third value being (in this context) a conditional probability

Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation

In this paper, by adopting a coherence-based probabilistic approach to default reasoning, we focus the study on the logical operation of quasi conjunction and the Goodman-Nguyen inclusion relation for conditional events. We recall that quasi conjunction is a basic notion for defining consistency of conditional knowledge bases. By deepening some results given in a previous paper we show that, given any finite family of conditional events F and any nonempty subset S of F, the family F p-entails the quasi conjunction C(S); then, given any conditional event E|H, we analyze the equivalence between p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some nonempty subset of F. We also illustrate some alternative theorems related with p-consistency and p-entailment. Finally, we deepen the study of the connections between the notions of p-entailment and inclusion relation by introducing for a pair (F,E|H) the (possibly empty) class K of the subsets S of F such that C(S) implies E|H. We show that the class K satisfies many properties; in particular K is additive and has a greatest element which can be determined by applying a suitable algorithm

Precise Propagation of Upper and Lower Probability Bounds in System P

In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional assertions of a given knowledge base, automatically obtaining the precise probability bounds for the derived conclusions of the inference rules. This allows a more flexible and realistic use of System P in default reasoning and provides an exact illustration of the degradation of the inference rules when interpreted in probabilistic terms. We also examine the disjunctive Weak Rational Monotony of System P+ proposed by Adams in his extended probability logic.Comment: 8 pages -8th Intl. Workshop on Non-Monotonic Reasoning NMR'2000, April 9-11, Breckenridge, Colorad

Epistemic Pluralism

The present paper wants to promote epistemic pluralism as an alternative view of non-classical logics. For this purpose, a bilateralist logic of acceptance and rejection is developed in order to make an important di erence between several concepts of epistemology, including information and justi cation. Moreover, the notion of disagreement corresponds to a set of epistemic oppositions between agents. The result is a non-standard theory of opposition for many-valued logics, rendering total and partial disagreement in terms of epistemic negation and semi-negations

Therapeutic target discovery using Boolean network attractors: avoiding pathological phenotypes

Target identification, one of the steps of drug discovery, aims at identifying biomolecules whose function should be therapeutically altered in order to cure the considered pathology. This work proposes an algorithm for in silico target identification using Boolean network attractors. It assumes that attractors of dynamical systems, such as Boolean networks, correspond to phenotypes produced by the modeled biological system. Under this assumption, and given a Boolean network modeling a pathophysiology, the algorithm identifies target combinations able to remove attractors associated with pathological phenotypes. It is tested on a Boolean model of the mammalian cell cycle bearing a constitutive inactivation of the retinoblastoma protein, as seen in cancers, and its applications are illustrated on a Boolean model of Fanconi anemia. The results show that the algorithm returns target combinations able to remove attractors associated with pathological phenotypes and then succeeds in performing the proposed in silico target identification. However, as with any in silico evidence, there is a bridge to cross between theory and practice, thus requiring it to be used in combination with wet lab experiments. Nevertheless, it is expected that the algorithm is of interest for target identification, notably by exploiting the inexpensiveness and predictive power of computational approaches to optimize the efficiency of costly wet lab experiments.Comment: Since the publication of this article and among the possible improvements mentioned in the Conclusion, two improvements have been done: extending the algorithm for multivalued logic and considering the basins of attraction of the pathological attractors for selecting the therapeutic bullet

Framing Outcomes and Program Assessment for Digital Scholarship Services: A Logic Model Approach

This is an Accepted Manuscript of an article published by the Association of College and Research Libraries in College and Research Libraries in March 2021, available online: https://doi.org/10.5860/crl.82.2.142Assessing digital scholarship services offered either through academic libraries or elsewhere on campuses is important for both program development and service refinement. Digital scholarship support is influenced by fluid campus priorities and limited resources, including staffing, service models, infrastructure, and partnership opportunities available at a university. Digital scholarship support is built upon deep, ongoing relationships and there is an intrinsic need to balance these time-intensive collaborations with scalable service offerings. Therefore, typical library assessment methods do not adequately capture the sustained engagement and impacts to research support and collaboration that come from digital scholarship services. This article discusses the creation of a logic model as one approach to frame assessment of digital scholarship services in the university environment.Publisher allows immediate open acces