This article discusses how sequential sampling models can be integrated in a cognitive architecture. The new theory Retrieval by Accumulating Evidence in an Architecture (RACE/A) combines the level of detail typically provided by sequential sampling models with the level of task complexity typically provided by cognitive architectures. We will use RACE/A to model data from two variants of a picture–word interference task in a psychological refractory period design. These models will demonstrate how RACE/A enables interactions between sequential sampling and long-term (...) declarative learning, and between sequential sampling and task control. In a traditional sequential sampling model, the onset of the process within the task is unclear, as is the number of sampling processes. RACE/A provides a theoretical basis for estimating the onset of sequential sampling processes during task execution and allows for easy modeling of multiple sequential sampling processes within a task. (shrink)

The speed‐accuracy trade‐off (SAT) effect refers to the behavioral trade‐off between fast yet error‐prone respones and accurate but slow responses. Multiple theories on the cognitive mechanisms behind SAT exist. One theory assumes that SAT is a consequence of strategically adjusting the amount of evidence required for overt behaviors, such as perceptual choices. Another theory hypothesizes that SAT is the consequence of the mixture of multiple categorically different cognitive processes. In this paper, these theories are disambiguated by assessing whether the fixed‐point (...) property of mixture distributions holds, in both simulations and data. I conclude that, at least for perceptual decision making, there is no evidence for a mixture of different cognitive processes to trade off accuracy of responding for speed. (shrink)

Between‐trial effects in Stroop‐like interference tasks are linked to differences in the amount of cognitive control. Trials following an incongruent trial show less interference, an effect suggested to result from the increased control caused by the incongruent previous trial (known as the Gratton effect). In this study, we show that cognitive control not only results in a different amount of interference but also in a different locus of the interference. That is, the stage of the task that shows the most (...) interference changes as a function of the preceding trial. Using computational cognitive modeling, we explain these effects by a difference in the amount of processing of the irrelevant dimension of the stimulus. (shrink)

Parametric cognitive models are increasingly popular tools for analyzing data obtained from psychological experiments. One of the main goals of such models is to formalize psychological theories using parameters that represent distinct psychological processes. We argue that systematic quantitative reviews of parameter estimates can make an important contribution to robust and cumulative cognitive modeling. Parameter reviews can benefit model development and model assessment by providing valuable information about the expected parameter space, and can facilitate the more efficient design of experiments. (...) Importantly, parameter reviews provide crucial—if not indispensable—information for the specification of informative prior distributions in Bayesian cognitive modeling. From the Bayesian perspective, prior distributions are an integral part of a model, reflecting cumulative theoretical knowledge about plausible values of the model's parameters (Lee,2018). In this paper we illustrate how systematic parameter reviews can be implemented to generate informed prior distributions for the Diffusion Decision Model (DDM; Ratcliff and McKoon,2008), the most widely used model of speeded decision making. We surveyed the published literature on empirical applications of the DDM, extracted the reported parameter estimates, and synthesized this information in the form of prior distributions. Our parameter review establishes a comprehensive reference resource for plausible DDM parameter values in various experimental paradigms that can guide future applications of the model. Based on the challenges we faced during the parameter review, we formulate a set of general and DDM-specific suggestions aiming to increase reproducibility and the information gained from the review process. (shrink)

According to logical theories of meaning, a meaning of an expression can be formalized and encoded in truth conditions. Vagueness of the language and individual differences between people are a challenge to incorporate into the meaning representations. In this paper, we propose a new approach to study truth-conditional representations of vague concepts. For a case study, we selected two natural language quantifiers most and more than half. We conducted two online experiments, each with 90 native English speakers. In the first (...) experiment, we tested between-subjects variability in meaning representations. In the second experiment, we tested the stability of meaning representations over time by testing the same group of participants in two experimental sessions. In both experiments, participants performed the verification task. They verified a sentence with a quantifier (e.g., “Most of the gleerbs are feezda.”) based on the numerical information provided in the second sentence, (e.g., “60% of the gleerbs are feezda”). To investigate between-subject and within-subject differences in meaning representations, we proposed an extended version of the Diffusion Decision Model with two parameters capturing truth conditions and vagueness. We fit the model to responses and reaction times data. In the first experiment, we found substantial between-subject differences in representations of most as reflected by the variability in the truth conditions. Moreover, we found that the verification of most is proportion-dependent as reflected in the reaction time effect and model parameter. In the second experiment, we showed that quantifier representations are stable over time as reflected in stable model parameters across two experimental sessions. These findings challenge semantic theories that assume the truth-conditional equivalence of most and more than half and contribute to the representational theory of vague concepts. The current study presents a promising approach to study semantic representations, which can have a wide application in experimental linguistics. (shrink)

The parameters governing our behavior are in constant flux. Accurately capturing these dynamics in cognitive models poses a challenge to modelers. Here, we demonstrate a mapping of ACT-R's declarative memory onto the linear ballistic accumulator (LBA), a mathematical model describing a competition between evidence accumulation processes. We show that this mapping provides a method for inferring individual ACT-R parameters without requiring the modeler to build and fit an entire ACT-R model. Existing parameter estimation methods for the LBA can be used, (...) instead of the computationally expensive parameter sweeps that are traditionally done. We conduct a parameter recovery study to confirm that the LBA can recover ACT-R parameters from simulated data. Then, as a proof of concept, we use the LBA to estimate ACT-R parameters from an empirical dataset. The resulting parameter estimates provide a cognitively meaningful explanation for observed differences in behavior over time and between individuals. In addition, we find that the mapping between ACT-R and LBA lends a more concrete interpretation to ACT-R's latency factor parameter, namely as a measure of response caution. This work contributes to a growing movement towards integrating formal modeling approaches in cognitive science. (shrink)

John Pell worked in the Netherlands from 1643 until 1652. He therefore deserves a place in a survey of mathematics c. 1650 in the Netherlands. During his stay he was mainly concerned with refuting a quadrature of the circle that was published in 1644 in Amsterdam by the Danish astronomer and mathematician Longomontanus. We therefore make Pell's refutation the main theme of this paper, but other aspects of Pell's work and some biographical information will be discussed within this framework. This (...) paper includes a discussion of the refuted quadrature, and the first publication of a copy of the original one-leaf refutation, which was thought to be lost. In addition, we survey Pell's correspondence about the affair and in that connection discuss some unknown letters from Mersenne. (shrink)

Recensie van Miriam Rasch Frictie: Ethiek in tijden van dataïsme. Amsterdam: De Bezige Bij (2020).

Hans van Maanen is professor of art and society at the Department of Arts, Culture & Media Studies of the University of Groningen, the Netherlands.

Amsterdam University Press is a leading publisher of academic books, journals and textbooks in the Humanities and Social Sciences. Our aim is to make current research available to scholars, students, innovators, and the general public. AUP stands for scholarly excellence, global presence, and engagement with the international academic community.

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty ; and to provide evidence that logic-based methods can well support reasoning with uncertainty. For the latter claim, two paradigmatic examples are presented: logic programming with Kleene semantics for modelling reasoning from information in a discourse, to an interpretation of the state of affairs of the intended model, and a neural-symbolic implementation of input/output logic for dealing with uncertainty in dynamic (...) normative contexts. (shrink)

The speed-accuracy trade-off effect refers to the behavioral trade-off between fast yet error-prone respones and accurate but slow responses. Multiple theories on the cognitive mechanisms behind SAT exist. One theory assumes that SAT is a consequence of strategically adjusting the amount of evidence required for overt behaviors, such as perceptual choices. Another theory hypothesizes that SAT is the consequence of the mixture of multiple categorically different cognitive processes. In this paper, these theories are disambiguated by assessing whether the fixed-point property (...) of mixture distributions holds, in both simulations and data. I conclude that, at least for perceptual decision making, there is no evidence for a mixture of different cognitive processes to trade off accuracy of responding for speed. (shrink)

A letter written by Christiaan Huygens to David Gregory is published here for the first time. After an introduction about the contacts between the two correspondents, an annotated English translation of the letter is given. The letter forms part of the wider correspondence about the ‘new calculus’, in which L'Hospital and Leibniz also participated, and gives some new evidence about Huygens's ambivalent attitude towards the new developments. Therefore, two mathematical passages in the letter are discussed separately. An appendix contains the (...) original Latin text. (shrink)

We study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language (both for classical and intuitionistic fragment), we then prove that in order (...) to express well-known properties like 'speaks-for' or 'hand- off', defined in terms of says, we do not need second-order logic (unlike previous approaches) but a decidable fragment of first-order logic suffices. We propose a model-driven study of the says axiomatization by constraining the Kripke models in order to respect desirable security properties, we study how existing access control logics can be translated into FSL and we give completeness for the logic. (shrink)

Input/output logics are abstract structures designed to represent conditional obligations and goals. In this paper we use them to study conditional permission. This perspective provides a clear separation of the familiar notion of negative permission from the more elusive one of positive permission. Moreover, it reveals that there are at least two kinds of positive permission. Although indistinguishable in the unconditional case, they are quite different in conditional contexts. One of them, which we call static positive permission, guides the citizen (...) and law enforcement authorities in the assessment of specific actions under current norms, and it behaves like a weakened obligation. Another, which we call dynamic positive permission, guides the legislator. It describes the limits on the prohibitions that may be introduced into a code, and under suitable conditions behaves like a strengthened negative permission. (shrink)

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, (...) considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourr6n/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step. (shrink)

In a range of contexts, one comes across processes resembling inference, but where input propositions are not in general included among outputs, and the operation is not in any way reversible. Examples arise in contexts of conditional obligations, goals, ideals, preferences, actions, and beliefs. Our purpose is to develop a theory of such input/output operations. Four are singled out: simple-minded, basic (making intelligent use of disjunctive inputs), simple-minded reusable (in which outputs may be recycled as inputs), and basic reusable. They (...) are defined semantically and characterised by derivation rules, as well as in terms of relabeling procedures and modal operators. Their behaviour is studied on both semantic and syntactic levels. (shrink)

In a range of contexts, one comes across processes resembling inference, but where input propositions are not in general included among outputs, and the operation is not in any way reversible. Examples arise in contexts of conditional obligations, goals, ideals, preferences, actions, and beliefs. Our purpose is to develop a theory of such input/output operations. Four are singled out: simple-minded, basic (making intelligent use of disjunctive inputs), simple-minded reusable (in which outputs may be recycled as inputs), and basic reusable. They (...) are defined semantically and characterised by derivation rules, as well as in terms of relabeling procedures and modal operators. Their behaviour is studied on both semantic and syntactic levels. (shrink)

This article seeks to address the problem of the ‘resource consumption bottleneck’ of creating legal semantic technologies manually. It describes a semantic role labeling based information extraction system to extract definitions and norms from legislation and represent them as structured norms in legal ontologies. The output is intended to help make laws more accessible, understandable, and searchable in a legal document management system.

The principle-based approach is a methodology to classify and analyse argumentation semantics. In this paper we classify seven of the main alternatives for argumentation semantics using a set of new robustness principles. These principles complement Baroni and Giacomin’s original classification and deal with the behaviour of a semantics when the argumentation framework changes due to the addition or removal of an attack between two arguments. We distinguish so-called persistence principles and monotonicity principles, where the former deal with the question of (...) whether a labelling or extension of an argumentation framework under a given semantics persists after a change, and the latter with the question of whether new labellings or extensions are created after a change. We furthermore show in which sense labelling-based and extension-based semantics lead to subtly different principles and results. Our results can be used for choosing a semantics for a particular application, or to guide the search for new argumentation semantics, but they have been used also in the design of algorithms. (shrink)

In the present work we illustrate how two sorts of defeasible reasoning that are fundamental in the normative domain, that is, reasoning about exceptions and reasoning about violations, can be simulated via monotonic propositional theories based on a bimodal language with primitive operators representing knowledge and obligation. The proposed theoretical framework paves the way to using native theorem provers for multimodal logic, such as MleanCoP, in order to automate normative reasoning.

Realism for agents with unconditional beliefs, desires and intentions has been analyzed in modal logic. This paper provides a logical analysis of realism for agents with conditional beliefs and desires in a rule based approach analogous to Reiter's default logic. We distinguish two types of realism, which we call ‘a priori' and ‘a posteriori' realism. We analyze whether these two new properties are compatible with other properties discussed in the literature, such as existence of extensions. We show that Reiter's default (...) logic is too strong, in the sense that a weaker notion of maximality of extensions is needed to satisfy realism. Finally we show that several existing approaches do not satisfy the new realism properties, and we introduce a new construction that does satisfy them. (shrink)

In this paper I propose violation games as the basis of formal logics to represent and reason about norms, i.e. as the foundation of deontic logic. Deontic logic is an applied non-classical logic reflecting a way in which we conceptualize normative reasoning. By introducing violation games as a fundamental principle of deontic logic, I am introducing a new way of looking at familiar problems in normative reasoning, with the aim of introducing a new approach for handling norms in intelligent systems.

Formal arguments are often represented by pairs, but in this paper we consider normative arguments represented by sequences of triples, where constitutive norms derive institutional facts from brute facts, and regulative norms derive deontic facts like obligations and permissions from institutional facts. The institutional facts may be seen as the reasons explaining or warranting the deontic obligations and permissions, and therefore they can be attacked by other normative arguments too. We represent different aspects of normative reasoning by different kinds of (...) consistency checks among these triples, and we use formal argumentation theory to resolve conflicts among such normative arguments. In particular, we introduce various requirements for arguing about norms concerning violations, contrary-to-duty obligations, dilemmas, conflict resolution and different kinds of norms, and we introduce a formal argumentation theory satisfying the requirements. In order to illustrate our framework, we introduce a running example based on university regulations for prospective and actual students. (shrink)

Diagnosis theory reasons about incomplete knowledge and only considers the past. It distinguishes between violations and non-violations. Qualitative decision theory reasons about decision variables and considers the future. It distinguishes between fulfilled goals and unfulfilled goals. In this paper we formalize normative diagnoses and decisions in the special purpose formalism DIO(DE)2 as well as in extensions of the preference-based deontic logic PDL. The DIagnostic and DEcision-theoretic framework for DEontic reasoning DIO(DE)2 formalizes reasoning about violations and fulfillments, and is used to (...) characterize the distinction between normative diagnosis theory and (qualitative) decision theory. The extension of the preference-based deontic logic PDL shows how normative diagnostic and decision-theoretic reasoning — i.e. reasoning about violations and fulfillments — can be formalized as an extension of deontic reasoning. (shrink)

Sounds are heard, sometimes even felt, but in most cases they remain unseen. This ephemeral and invisible nature of sound was already considered a problem when the science of acoustics took form in the seventeenth century. The fact that sound could not be seen was described as a significant hindrance to its understanding. But it was precisely during this time that a wide variety of sounds attracted broad scientific attention across Europe. Scholars, natural philosophers, and mathematicians investigated and experimented with (...) sound and musical instruments and developed theories of hearing. This article looks at the role of images, diagrams, and visualization techniques in late seventeenth-century acoustics, bringing together the history of sound and the history of scientific images. Focusing on water and light as the dominant analogies for sound, the article demonstrates that visualization was an important tool for thinking about sound and allowed for the circulation of theories and experiments. At the same time, the epistemic status of these images remained contested, as there was no single model that could explain the different ways sound behaves as it moves through space and that could be visualized. (shrink)

Knowledge based privacy policies are more declarative than traditional action based ones, because they specify only what is permitted or forbidden to know, and leave the derivation of the permitted actions to a security monitor. This inference problem is already non trivial with a static privacy policy, and becomes challenging when privacy policies can change over time. We therefore introduce a dynamic modal logic that permits not only to reason about permitted and forbidden knowledge to derive the permitted actions, but (...) also to represent explicitly the declarative privacy policies together with their dynamics. The logic can be used to check both regulatory and behavioral compliance, respectively by checking that the permissions and obligations set up by the security monitor of an organization are not in conflict with the privacy policies, and by checking that these obligations are indeed enforced. (shrink)

A single global authority is not sufficient to regulate heterogenous agents in multiagent systems based on distributed architectures, due to idiosyncratic local situations and to the need to regulate new issues as soon as they arise. On the one hand institutions should be structured as normative systems with a hierarchy of authorities able to cope with the dynamics of local situations, but on the other hand higher authorities should be able to delimit the autonomy of lower authorities to issue valid (...) norms. In this paper, we study the interplay of obligations and strong permissions in the context of hierarchies of authorities using input/output logic, because its explicit norm base facilitates reasoning about norm base maintenance, and it covers a variety of conditional obligations and permissions. We combine the logic with constraints, priorities and hierarchies of authorities. In this setting, we observe that Makinson and van der Torre’s notion of prohibition immunity for permissions is no longer sufficient, and we introduce a new notion of permission as exception and a new distinction between static and dynamic norms. We show how strong permissions can dynamically change an institution by adding exceptions to obligations, provide an explicit representation of what is permitted to the subjects of the normative system and allow higher level authorities to limit the power of lower level authorities to change the normative system. (shrink)

The Handbook of Formal Argumentation is a community effort aimed at providing a comprehensive and up-to-date view of the state of the art and current trends in the lively research field of formal argumentation. The first volume of the Handbook is organised into five parts, containing nineteen chapters in all, each written by leading experts in the field. The first part provides a general and historical perspective on the field. The second part gives a comprehensive coverage of the argumentation formalisms (...) available in the literature at various levels of abstraction. The third part is devoted to cover some of the many dialogical aspects of argumentation, while the fourth one deals with algorithmic, computational and implementation issues. Finally, the fifth part provides some deeper analyses on the previously introduced topics. The Handbook of Formal Argumentation is an open-ended initiative of which the present volume is the first outcome. Further volumes are planned to cover topics not included in the present one and the initiative is conceived to grow by the support and feeding it receives from the community members. (shrink)

In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to (...) rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research. (shrink)