In this paper a way to have structures with partiality in its internal structure in a categorical approach is presented and, with this, a category of partial graphs Grp is given and partial automata are constructed from Grp. With a simple categorical operation, computations of partial automata are given and can be seen as a part of the structure of partial automata. Keyworks: computation, parti...

A reliable newspaper should accommodate heterogeneity regarding geographical and psychological readers. The wider the coverage area of a newspaper, more heterogeneous its readers will be. By putting concerns on these two dimensions, is expected to be in neutral position. This impartiality or neutrality mass media becomes intriguing topic when it associated with theory arguing that language cann...

This chapter is concerned with nonmonotonicity and partiality in the theory of defeasible argumentation. In this theory, a defeasible proof (or argument) establishes warrant for a conclusion only if it is not defeated by better counterarguments. We introduce a formal theory of argumentation, in which the notion of abstract argumentation system is paramount. After that, we discuss the significan...

This research examines the development of children's understanding that people's judgments may be skewed by relationships, and that situational factors may make it difficult to be impartial. One hundred and seventy-one adults and children between kindergarten and eighth grade heard stories about judges in contests with objective or subjective criteria for winning. In Experiment 1, by fourth gra...

In this paper it is shown how a partial semantics for presuppositions can be given which is empirically more satisfactory than its predecessors, and how this semantics can be integrated with a technically sound, compositional grammar in the Montagovian fashion. Additionally, it is argued that the classical objection to partial accounts of presupposition, namely that they lack ‘flexibility’, is ...

Explaining sophisticated machine-learning based systems is an important issue at the foundations of AI. Recent efforts have shown various methods for providing explanations. These approaches can be broadly divided into two schools: those that provide a local and human interpreatable approximation machine learning algorithm, logical exactly characterise one aspect decision. In this paper we focu...

A property-based testing library enables users to perform lightweight verification of software. This paper presents improvements to the Lazy SmallCheck property-based testing library. Users can now test properties that quantify over first-order functional values and nest universal and existential quantifiers in properties. When a property fails, Lazy SmallCheck now accurately expresses the part...

Density functional theory (DFT) is now the most commonly used method of electronic structure calculation in both condensed matter physics and quantum chemistry, thanks in part to the focus it has received over the first 50 years of the Sanibel Symposium. We present a short history, and review fourteen short and easy but important lessons about nonrelativistic DFT, with some partiality but with ...

It is well-known that many relevant aspects of everyday reasoning based on natural language cannot be adequately expressed in classical rst-order logic. In this paper we address two of the problems, rstly that of so-called presuppositions, expressions from which it is possible to draw implicit conclusion, which classical logic normally does not warrant, and secondly the related problem of parti...

Finite-state methods are applied to the Russell-Wiener-Kamp notion of time (based on events) and developed into an account of interval relations and semi-intervals. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by p...