Artificial Intelligence and algorithms are increasingly able to replace human workers in cognitively sophisticated tasks, including ones related to justice. Many governments and international organizations are discussing policies related to the application of algorithmic judges in courts. In this paper, we investigate the public perceptions of algorithmic judges. Across two experiments (N = 1,822), and an internal meta-analysis (N = 3,039), our results show that even though court users acknowledge several advantages of algorithms (i.e., cost and speed), they trust human (...) judges more and have greater intentions to go to the court when a human (vs. an algorithmic) judge adjudicates. Additionally, we demonstrate that the extent that individuals trust algorithmic and human judges depends on the nature of the case: trust for algorithmic judges is especially low when legal cases involve emotional complexities (vs. technically complex or uncomplicated cases). (shrink)

Efforts to formalize qualitative accounts of inference to the best explanation (IBE) confront two obstacles: the imprecise nature of such accounts and the unusual logical properties that explanations exhibit, such as contradiction-intolerance and irreflexivity. This paper aims to surmount these challenges by utilising a new, more precise theory that treats explanations as expressions that codify defeasible inferences. To formalise this account, we provide a sequent calculus in which IBE serves as an elimination rule for a connective that exhibits many (...) of the properties associated with the behaviour of the English expression ‘That... best explains why ... ’. We first construct a calculus that encodes these properties at the level of the turnstile, i.e. as a metalinguistic expression for classes of defeasible consequence relations. We then show how this calculus can be conservatively extended over a language that contains a best-explains-why operator. (shrink)

In this paper we introduce hypersequent-based frameworks for the modelling of defeasible reasoning by means of logic-based argumentation and the induced entailment relations. These structures are an extension of sequent-based argumentation frameworks, in which arguments and the attack relations among them are expressed not only by Gentzen-style sequents, but by more general expressions, called hypersequents. This generalization allows us to overcome some of the known weaknesses of logical argumentation frameworks and to prove several desirable properties of the entailments that (...) are induced by the extended frameworks. It also allows us to incorporate as the deductive base of our formalism some well-known logics, which lack cut-free sequent calculi, and so are not adequate for standard sequent-based argumentation. We show that hypersequent-based argumentation yields robust defeasible variants of these logics, with many desirable properties. (shrink)

The unique properties of nanotechnology have made nanotechnology education and its related subjects increasingly important not only for students but for mankind at large. This particular technology brings educators to work together to prepare and produce competent engineers and scientists for this field. One of the key challenges in nanotechnology engineering is to produce graduate students who are not only competent in technical knowledge but possess the necessary attitude and awareness toward the social and ethical issues related to nanotechnology. (...) In this paper, a research model has been developed to assess Malaysian nanotechnology engineering students’ attitudes and whether their perspectives have attained the necesary objectives of ethical education throughout their programme of study. The findings from this investigation show that socio ethical education has a strong influence on the students’ knowledge, skills and attitudes pertaining to socio ethical issues related to nanotechnology. (shrink)

This paper studies the properties of eight semantic consequence relations defined from a Tarski-logic L and a preference relation ≺. They are equivalent to Shoham’s so-called preferential entailment for smooth model structures, but avoid certain problems of the latter in non-smooth configurations. Each of the logics can be characterized in terms of what we call multi-selection semantics. After discussing this type of semantics, we focus on some concrete proposals from the literature, checking a number of meta-theoretic properties and (...) elaborating on their intuitive motivation. As it turns out, many of their meta-properties only hold in case ≺ is transitive. To tackle this problem, we propose slight modifications of each of the systems, showing the resulting logics to behave better at the intuitive level and in metatheoretic terms, for arbitrary ≺. (shrink)