Inferential Expressivism and the Negation Problem

We develop a novel solution to the negation version of the Frege-Geach problem by taking up recent insights from the bilateral programme in logic. Bilateralists derive the meaning of negation from a primitive *B-type* inconsistency involving the attitudes of assent and dissent. Some may demand an explanation of this inconsistency in simpler terms, but we argue that bilateralism’s assumptions are no less explanatory than those of *A-type* semantics that only require a single primitive attitude, but must stipulate inconsistency elsewhere. Based on these insights, we develop a version of B-type expressivism called *inferential expressivism*. This is a novel semantic framework that characterises meanings by inferential roles that define which *attitudes* one can *infer* from the use of terms. We apply this framework to normative vocabulary, thereby solving the Frege-Geach problem generally and comprehensively. Our account moreover includes a semantics for epistemic modals, thereby also explaining normative terms under epistemic modals

Proceedings of the 4th Workshop of the MPM4CPS COST Action

Proceedings of the 4th Workshop of the MPM4CPS COST Action with the presentations delivered during the workshop and papers with extended versions of some of them

Capture and Maintenance of Constraints in Engineering Design

The thesis investigates two domains, initially the kite domain and then part of a more demanding Rolls-Royce domain (jet engine design). Four main types of refinement rules that use the associated application conditions and domain ontology to support the maintenance of constraints are proposed. The refinement rules have been implemented in ConEditor and the extended system is known as ConEditor+. With the help of ConEditor+, the thesis demonstrates that an explicit representation of application conditions together with the corresponding constraints and the domain ontology can be used to detect inconsistencies, redundancy, subsumption and fusion, reduce the number of spurious inconsistencies and prevent the identification of inappropriate refinements of redundancy, subsumption and fusion between pairs of constraints.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Quantifying and Mapping Streetspace: a Geocomputational Method for the Citywide Analysis of Pedestrian and Vehicular Streetspace

The purpose of this paper is to present a methodology for quantifying streetspace designation across entire cities. The new street level data is generated using a geocomputational approach that both allows for a quantitative citywide description of streetspace at a micro-scale and that can be replicated across multiple cities. The high spatial resolution description of streetspace covering large urban areas can be valuable to city designers and urban planners in the context of current challenges of street congestion, promoting active travel and rapidly evolving mobility technologies. It is observed that London streetspace is assigned mainly to vehicles and wider streets relate to the street network hierarchy and concentrate in the inner city. The new street level data introduced here can yield important insights for street research, planning and design