In this paper we show that an essential aspect of solving the problem of uncritical acceptance of expert opinions that is at the root of the ad verecundiam fallacy is the need to disentangle argument from expert opinion from another kind of appeal to authority. Formal and computational argumentation systems enable us to analyze the fault in which an error has occurred by virtue of a failure to meet one or more of the requirements of the argumentation (...) scheme from argument from expert opinion. We present a method for enhancing this capability by showing how arguments from expert opinion are related to, but different from, arguments from deontic authority. (shrink)

Society is becoming increasingly reliant upon the dependability of computerbased systems. Achieving and demonstrating the dependability of systems requires the construction and review of valid and coherent arguments. This paper discusses the need for a variety of classes of arguments in dependable systems and reviews existing approaches to the representation of arguments in each of these classes. The issues surrounding the certification of safety critical systems demonstrate the current need for richer representations of dependability arguments which support tools for their (...) construction and review. The paper discusses how a meta-logical framework, informed by aspects of both formal and informal logic, offers a rich and unified means of representing dependability arguments and of thus addressing this need. (shrink)

This paper aims at comparing and relating belief revision and argumentation as approaches to model reasoning processes. Referring to some prominent literature references in both fields, we will discuss their (implicit or explicit) assumptions on the modeled processes and hence commonalities and differences in the forms of reasoning they are suitable to deal with. The intended contribution is on one hand assessing the (not fully explored yet) relationships between two lively research fields in the broad area of defeasible reasoning (...) and on the other hand pointing out open issues and potential directions for future research. (shrink)

As genetic testing for the presence of potentially health-affecting mutations becomes available for more genetic conditions, many people will soon be faced with the decision of whether or not to have a genetic test. Making an informed decision requires an understanding and evaluation of the arguments for and against having the test. As a case in point, this paper considers argumentation involving the decision of whether to have a BRCA gene test, one of the first commercially available genetic tests. (...) First, argumentation in a five-page patient brochure from a for-profit company that provides BRCA gene testing, is analyzed. Next, for comparison, argumentation on BRCA testing in materials for healthcare consumers written by a not-for-profit health plan and a government organization, is analyzed. In view of the challenges identified by considering these examples, this article discusses how argumentation-oriented computer systems may be able to help the healthcare consumer to make informed decisions about genetic testing. (shrink)

Safe Safety arguments are key components in a safety case. Too often, safety arguments are constructed without proper reasoning. To address this, we argue that informal logic argument schemes have important roles to play in safety argument construction and reviewing process. Ten commonly used reasoning schemes in computer system safety domain are proposed. The role of informal logic dialogue games in computer system safety arguments reviewing is also discussed and the intended work in this area is proposed. It (...) is anticipated that this work will contribute toward the development of computer system safety arguments, and help to move forward the interplay between research in informal logic and research in computer system safety engineering. (shrink)

Recent proposals for computer-assisted argumentation have drawn on dialectical models of argumentation. When used to assist public policy planning, such systems also raise questions of political legitimacy. Drawing on deliberative democratic theory, we elaborate normative criteria for deliberative legitimacy and illustrate their use for assessing two argumentation systems. Full assessment of such systems requires experiments in which system designers draw on expertise from the social sciences and enter into the policy deliberation itself at the level of (...) participants. (shrink)

There are many benefits of using argumentation-based techniques in multi-agent systems, as clearly shown in the literature. Such benefits come not only from the expressiveness that argumentation-based techniques bring to agent communication but also from the reasoning and decision-making capabilities under conditions of conflicting and uncertain information that argumentation enables for autonomous agents. When developing multi-agent applications in which argumentation will be used to improve agent communication and reasoning, argumentation schemes are useful in addressing the (...) requirements of the application domain in regards to argumentation. In this work, we propose an argumentation framework that takes into account the particular structure of argumentation schemes at its core. This paper formally defines such a framework and experimentally evaluates its implementation for both argumentation-based reasoning and dialogues. (shrink)

This paper begins with a brief account of how I started out as a young logician studying modal logic with the hope that it would be useful when applied to evaluating real examples of arguments found in natural language texts. The exposition moves on to relate how my interests shifted to the study of argumentation in informal logic, and from there to computational systems combining defeasible argumentation schemes with argument mapping (diagramming). The story ends by leading to (...) recent collaborations with three young logicians and computer scientists who are continuing on the path of my journey. (shrink)

Structured argumentation systems, and their implementation, represent an important research subject in the area of Knowledge Representation and Reasoning. Structured argumentation advances over abstract argumentation frameworks by providing the internal construction of the arguments that are usually defined by a set of (strict and defeasible) rules. By considering the structure of arguments, it becomes possible to analyze reasons for and against a conclusion, and the warrant status of such a claim in the context of a knowledge base (...) represents the main output of a dialectical process. Computing such statuses is a costly process, and any update to the knowledge base could potentially have a huge impact if done naively. In this work, we investigate the case of updates consisting of both additions and removals of pieces of knowledge in the Defeasible Logic Programming (DeLP) framework, first analyzing the complexity of the problem and then identifying conditions under which we can avoid unnecessary computations—central to this is the development of structures (e.g. graphs) to keep track of which results can potentially be affected by a given update. We introduce a technique for the incremental computation of the warrant statuses of conclusions in DeLP knowledge bases that evolve due to the application of (sets of) updates. We present the results of a thorough experimental evaluation showing that our incremental approach yields significantly faster running times in practice, as well as overall fewer recomputations, even in the case of sets of updates performed simultaneously. (shrink)

We developed an on-line intelligent argumentation system which facilitates stakeholders in exchanging dialogues. It provides decision support by capturing stakeholders’ rationale through arguments. As part of the argumentation process, stakeholders tend to both polarise their opinions and form polarisation groups. The challenging issue of assessing argumentation polarisation had not been addressed in argumentation systems until recently. Arvapally, Liu, and Jiang [, ‘Identification of Faction Groups and Leaders in Web-Based Intelligent Argumentation System for Collaborative (...) Decision Support’, in Proceedings of International Conference on Collaborative Technologies and Systems] earlier developed a method to identify polarisation groups. These groups, however, tend to overlap to a certain degree; each stakeholder may be a member of multiple polarisation groups to varied degrees. Quantifying stakeholders’ membership in multiple polarisation groups is an important issue in the argumentation for collaborative decision-making, which is not addressed earlier. We present a novel approach using fuzzy clustering algorithm to address this issue in this article. The method is evaluated using data sets produced from the discussions of 24 stakeholders. Experimental results indicate that our method is effective for both identifying polarisation groups and quantifying stakeholders’ degree of membership in each polarisation group. (shrink)

In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and computers are (...) semiotic systems. Finally, I suggest that minds can be considered as virtual machines implemented in certain semiotic systems, primarily the brain, but also AI computers. In doing so, I take issue with Fetzer’s arguments to the contrary. (shrink)

Argumentation schemes can be described as abstract structures representing the most generic types of argument, constituting the building blocks of the ones used in everyday reasoning. This paper investigates the structure, classification, and uses of such schemes. Three goals are pursued: 1) to describe the schemes, showing how they evolved and how they have been classified in the traditional and the modern theories; 2) to propose a method for classifying them based on ancient and modern developments; and 3) to (...) outline and show how schemes can be used to describe and analyze or produce real arguments. To this purpose, we will build on the traditional distinctions for building a dichotomic classification of schemes, and we will advance a modular approach to argument analysis, in which different argumentation schemes are combined together in order to represent each step of reasoning on which a complex argument relies. Finally, we will show how schemes are applied to formal systems, focusing on their applications to Artificial Intelligence, AI & Law, argument mining, and formal ontologies. (shrink)

This paper compares the features and methods of the two leading implemented systems that offer a tool for helping a user to find or invent arguments to support or attack a designated conclusion, the Carneades Argumentation System and the IBM Watson Debater tool. The central aim is to contribute to the understanding of scholars in informal logic, rhetoric and argumentation on how these two software systems can be useful for them. One contribution of the paper is to (...) explain to these potential users how the two tools are applicable to the task of inventing arguments by using some simple illustrative examples. Another is to redefine the structure of argument invention as a procedure. (shrink)

In this paper we consider persuasion in the context of practical reasoning, and discuss the problems associated with construing reasoning about actions in a manner similar to reasoning about beliefs. We propose a perspective on practical reasoning as presumptive justification of a course of action, along with critical questions of this justification, building on the account of Walton. From this perspective, we articulate an interaction protocol, which we call PARMA, for dialogues over proposed actions based on this theory. We outline (...) an axiomatic semantics for the PARMA Protocol, and discuss two implementations which use this protocol to mediate a discussion between humans. We then show how our proposal can be made computational within the framework of agents based on the Belief-Desire-Intention model, and illustrate this proposal with an example debate within a multi agent system. (shrink)

The Argument Web is maturing as both a platform built upon a synthesis of many contemporary theories of argumentation in philosophy and also as an ecosystem in which various applications and application components are contributed by different research groups around the world. It already hosts the largest publicly accessible corpora of argumentation and has the largest number of interoperable and cross compatible tools for the analysis, navigation and evaluation of arguments across a broad range of domains, languages and (...) activity types. Such interoperability is key in allowing innovative combinations of tool and data reuse that can further catalyse the development of the field of computational argumentation. The aim of this paper is to summarise the key foundations, the recent advances and the goals of the Argument Web, with a particular focus on demonstrating the relevance to, and roots in, philosophical argumentation theory. (shrink)

In trying to control various aspects concerning utterance production in multi-party human–computer dialogue, argumentative considerations play an important part, particularly in choosing appropriate lexical units so that we fine-tune the degree of persuasion that each utterance has. A preliminary step in this endeavor is the ability to place an ordering relation between semantic forms (that are due to be realized as utterances, by the machine), concerning their persuasion strength, with respect to certain (explicit or implicit) conclusions. Thus, in this article, (...) we propose a mechanism for assessing utterances, in terms of their argumentative force. The framework designed conflates insights from Asher and Lascarides’ SDRT (“Segmented Discourse Representation Theory”), and from Anscombre and Ducrot’s AT (“Argumentation Theory”). These mechanisms are included in a language generation component of a multi-party dialogue system for book reservation applications (i.e., a “virtual librarian”), and thus evaluated via typical human–machine conversations. (shrink)

In this paper we provide a proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi. The idea is to imitate argumentative movements in which certain claims are introduced or withdrawn in the presence of counter-claims. This is done by a dynamic evaluation of sequences of sequents, in which the latter are considered ‘derived’ or ‘not derived’ (...) according to the content of the sequence. We show that decisive conclusions of such a process correspond to well-accepted consequences of the underlying argumentation framework. The outcome is therefore a general and modular proof-theoretical approach for paraconsistent and non-monotonic reasoning with argumentation systems. (shrink)

Part I of this paper outlined the three standard approaches to the teaching of critical thinking: the normative (or philosophical), cognitive psychology, and educational taxonomy approaches. The paper contrasted these with the visualisation approach; in particular, computer-aided argument mapping (CAAM), and presented a detailed account of the CAAM methodology and a theoretical justification for its use. This part develops further support for CAAM. A case is made that CAAM improves critical thinking because it minimises the cognitive burden of prose and (...) the demands that arguments in prose typically place on memory. CAAM also has greater usability, complements the imperfect human cognitive system, and adopts a logic of semi-formality which is both natural and intuitive. The paper claims that CAAM is an important advance given that traditional stand-alone critical thinking courses do not teach critical thinking as well as they as they are assumed to do. It is also important given that tertiary education fails to deliver improvements in critical thinking gains for too many students. The paper outlines results from a number of empirical studies that demonstrate that CAAM yields robust gains in critical thinking as measured by independent tests. Students themselves also believe CAAM to be beneficial as noted in coded responses to surveys. I conclude the paper by comparing the traditional approaches to the teaching of critical thinking to the visualisation approach. I argue that CAAM should taken seriously in the context of contemporary educational practices. (shrink)

The paper describes a computational model that we have implemented in an experimental dialogue system. Communication in a natural language between two participants A and B is considered, where A has a communicative goal that his/her partner B will make a decision to perform an action D. A argues the usefulness, pleasantness, etc. of D, in order to guide B's reasoning in a desirable direction. A computational model of argumentation is developed, which includes reasoning. Our model (...) is based on the studies in the common-sense conception of how the human mind works in such situations. Theoretical considerations are followed by an analysis of Estonian spoken human–human dialogues. First, calls of clients to travel agencies are studied where a travel agent could use various arguments in order to persuade a client to book a trip. The analysis demonstrates that clients are primarily looking for information; argumentation occurs in a small number of dialogues. Secondly, calls of s... (shrink)

There has been increasing use of argument-based approaches in the development of safety-critical systems. Within this approach, a safety case plays a key role in the system development life cycle. The key components in a safety case are safety arguments, which are designated to demonstrate that the system is acceptably safe. Inappropriate reasoning in safety arguments could undermine a system's safety claims which in turn contribute to safety-related failures of the system. The review of safety arguments (...) is therefore a crucial step in the development of safety-critical systems. Reviews are conducted using dialogues where elements of the argument and their relations are proposed and scrutinised. This paper investigates an approach of conducting argument review using dialectical models. After studying five established dialectical models with varying strengths and drawbacks, a new dialectical model specially designed to support persuasion and information-seeking dialogues has been proposed to suit the requir... (shrink)

This chapter proposes a dialectical approach to legal interpretation, consisting of three dimensions: a formalization of the canons of interpretation in terms of argumentation schemes; a dialectical classification of interpretive schemes; and a logical and computational model for comparing the arguments pro and contra an interpretation. The traditional interpretive maxims or canons used in both common and civil law are translated into defeasible patterns of arguments, which can be evaluated through sets of corresponding critical questions. These interpretive (...) class='Hi'>argumentation schemes are classified in general categories and a distinction is drawn between schemes supporting and rebutting an interpretation. This framework allows conceiving statutory interpretation as a dialectical procedure consisting in weighing arguments pro and contra an interpretation. This procedure is formalized and represented computationally through tools from formal argumentation systems. (shrink)

This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes (...) is built. (shrink)

The proper treatment of computationalism, as the thesis that cognition is computable, is presented and defended. Some arguments of James H. Fetzer against computationalism are examined and found wanting, and his positive theory of minds as semiotic systems is shown to be consistent with computationalism. An objection is raised to an argument of Selmer Bringsjord against one strand of computationalism, namely, that Turing-Test± passing artifacts are persons, it is argued that, whether or not this objection holds, such artifacts will inevitably (...) be persons. (shrink)

This book focuses on dialog from a varied combination of fields: Linguistics, Philosophy of Language and Computation. It builds on the hypothesis that meaning in human communication arises at the discourse level rather than at the word level. The book offers a complex analytical framework and integration of the central areas of research around human communication. The content revolves around meaning but it also gives evidence of the connection among different points of view. Besides discussing issues of general interest to (...) the field, the book triggers theoretical argumentation that is currently under scientific discussion. It examines such topics as immanent reasoning joined with Recanati's lekta and free enrichment, challenges of internet conversation, inner dialogs, cognition and language, and the relation between assertion and denial. It proposes a dialogical framework for intra-negotiation and gives a geolinguistic perspective on spoken discourse. Finally, it examines dialog and abduction and sheds light on a generation of dialog contexts by means of multimodal logic applied to speech acts. (shrink)

The comments accompanying Proposition (Prop.) 11 (“God... necessarily exists”) in Part I of Spinoza’s The Ethics contain sketches of what appear to be at least three more or less distinct ontological arguments. The first of these is problematic even on its own terms. More is true: even the proposition “God exists” (GE), a consequence of Prop. 11, cannot be derived from the definitions and axioms of Part I (the “DAPI”) of The Ethics; thus, Prop. 11 cannot be derived from the (...) DAPI, either. To prove these claims, I use an automated deduction system (ADS) to show that Prop. 11 is independent of the DAPI. I then augment the DAPI with some auxiliary assumptions I believe Spinoza would accept and that sustain an automated derivation of (GE). The results illustrate how an ADS can facilitate the analysis of arguments and yield an apparently novel argument cast in the style of Spinoza. (shrink)

This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes (...) is built. (shrink)

In this paper we describe a method for the specification of computationalmodels of argument using dialogue games. The method, which consists ofsupplying a set of semantic definitions for the performatives making upthe game, together with a state transition diagram, is described in full.Its use is illustrated by some examples of varying complexity, includingtwo complete specifications of particular dialogue games, Mackenzie's DC,and the authors' own TDG. The latter is also illustrated by a fully workedexample illustrating all the features of the game.

N. Bostrom’s simulation argument and two additional assumptions imply that we likely live in a computer simulation. The argument is based upon the following assumption about the workings of realistic brain simulations: The hardware of a computer on which a brain simulation is run bears a close analogy to the brain itself. To inquire whether this is so, I analyze how computer simulations trace processes in their targets. I describe simulations as fictional, mathematical, pictorial, and material models. Even though the (...) computer hardware does provide a material model of the target, this does not suffice to underwrite the simulation argument because the ways in which parts of the computer hardware interact during simulations do not resemble the ways in which neurons interact in the brain. Further, there are computer simulations of all kinds of systems, and it would be unreasonable to infer that some computers display consciousness just because they simulate brains rather than, say, galaxies. (shrink)

The counterfactual account of physical computation is simple and, for the most part, very attractive. However, it is usually thought to trivialize the notion of physical computation insofar as it implies ‘limited pancomputationalism’, this being the doctrine that every deterministic physical system computes some function. Should we bite the bullet and accept limited pancomputationalism, or reject the counterfactual account as untenable? Jack Copeland would have us do neither of the above. He attempts to thread a path between the two (...) horns of the dilemma by buttressing the counterfactual account with extra conditions intended to block certain classes of deterministic physical systems from qualifying as physical computers. His theory is called the ‘algorithm execution account’. Here we show that the algorithm execution account entails limited pancomputationalism, despite Copeland’s argument to the contrary. We suggest, partly on this basis, that the counterfactual account should be accepted as it stands, pancomputationalist warts and all. (shrink)

This paper explains the importance of classifying argumentation schemes, and outlines how schemes are being used in current research in artificial intelligence and computational linguistics on argument mining. It provides a survey of the literature on scheme classification. What are so far generally taken to represent a set of the most widely useful defeasible argumentation schemes are surveyed and explained systematically, including some that are difficult to classify. A new classification system covering these centrally important schemes (...) is built. (shrink)

The dialogue develops arguments for and against a broad new world system - info-computationalist naturalism - that is supposed to overcome the traditional mechanistic view. It would make the older mechanistic view into a special case of the new general info-computationalist framework (rather like Euclidian geometry remains valid inside a broader notion of geometry). We primarily discuss what the info-computational paradigm would mean, especially its pancomputationalist component. This includes the requirements for a the new generalized notion of computing (...) that would include sub-symbolic information processing. We investigate whether pancomputationalism can provide the basic causal structure to the world and whether the overall research program of info-computationalist naturalism appears productive, especially when it comes to new approaches to the living world, including computationalism in the philosophy of mind. (shrink)

John Pollock (1940?2009) was an influential American philosopher who made important contributions to various fields, including epistemology and cognitive science. In the last 25 years of his life, he also contributed to the computational study of defeasible reasoning and practical cognition in artificial intelligence. He developed one of the first formal systems for argumentation-based inference and he put many issues on the research agenda that are still relevant for the argumentation community today. This paper presents an appreciation (...) of Pollock's work on defeasible reasoning and its relevance for the computational study of argument. In our opinion, Pollock deserves to be remembered as one of the founding fathers of the field of computational argument, while, moreover, his work contains important lessons for current research in this field, reminding us of the richness of its object of study. (shrink)

Argumentation, which can be abstractly defined as the interaction of different arguments for and against some conclusion, is an important skill to learn for everyday life, law, science, politics and business. The best way to learn it is to try it out on real instances of arguments found in everyday conversational exchanges and legal argumentation. The introductory chapter of this book gives a clear general idea of what the methods of argumentation are and how they work as (...) tools that can be used to analyze arguments. Each subsequent chapter then applies these methods to a leading problem of argumentation. Today the field of computing has embraced argumentation as a paradigm for research in artificial intelligence and multi-agent systems. Another purpose of this book is to present and refine tools and techniques from computing as components of the methods that can be handily used by scholars in other fields. (shrink)

This monograph poses a series of key problems of evidential reasoning and argumentation. It then offers solutions achieved by applying recently developed computational models of argumentation made available in artificial intelligence. Each problem is posed in such a way that the solution is easily understood. The book progresses from confronting these problems and offering solutions to them, building a useful general method for evaluating arguments along the way. It provides a hands-on survey explaining to the reader how (...) to use current argumentation methods and concepts that are increasingly being implemented in more precise ways for the application of software tools in computational argumentation systems. It shows how the use of these tools and methods requires a new approach to the concepts of knowledge and explanation suitable for diverse settings, such as issues of public safety and health, debate, legal argumentation, forensic evidence, science education, and the use of expert opinion evidence in personal and public deliberations. (shrink)

. A heuristic search procedure for inventing legal arguments is built on two tools already widely in use in argumentation. Argumentation schemes are forms of argument representing premise‐conclusion and inference structures of common types of arguments. Schemes especially useful in law represent defeasible arguments, like argument from expert opinion. Argument diagramming is a visualization tool used to display a chain of connected arguments linked together. One such tool, Araucaria, available free at , helps a user display an argument (...) on the computer screen as an inverted tree structure with an ultimate conclusion as the root of the tree. These argumentation tools are applicable to analyzing a mass of evidence in a case at trial, in a manner already known in law using heuristic methods and Wigmore diagrams . In this paper it is shown how they can be automated and applied to the task of inventing legal arguments. One important application is to proof construction in trial preparation. (shrink)

This survey is the first to review the combination of computational trust and argumentation. The combination of the two approaches seems like a natural match, with the two areas tackling different aspects of reasoning in an uncertain, social environment. We discuss the different areas of research and describe the approaches taken so far, analysing both how they address the problems and the challenges that are unaddressed.

The paper presents an extended argument for the claim that mental content impacts the computational individuation of a cognitive system (section 2). The argument starts with the observation that a cognitive system may simultaneously implement a variety of different syntactic structures, but that the computational identity of a cognitive system is given by only one of these implemented syntactic structures. It is then asked what are the features that determine which of implemented syntactic structures is (...) the computational structure of the system, and it is contended that these features are certain aspects of mental content. The argument helps (section 3) to reassess the thesis known as computational externalism, namely, the thesis that computational theories of cognition make essential reference to features in the individual's environment. It is suggested that the familiar arguments for computational externalism?which rest on thought experiments and on exegesis of Marr's theories of vision?are unconvincing, but that they can be improved. A reconstruction of the visex/audex thought experiment is offered in section 3.1. An outline of a novel interpretation of Marr's theories of vision is presented in section 3.2. The corrected arguments support the claim that computational theories of cognition are intentional. Computational externalism is still pending, however, upon the thesis that psychological content is extrinsic. (shrink)

The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988) monograph, “Representation & Reality”, which if correct, has important (...) implications for turing machine functionalism and the prospect of ‘conscious’ machines. In the paper, instead of seeking to develop Putnam’s claim that, “everything implements every finite state automata”, I will try to establish the weaker result that, “everything implements the specific machine Q on a particular input set (x)”. Then, equating Q (x) to any putative AI program, I will show that conceding the ‘strong AI’ thesis for Q (crediting it with mental states and consciousness) opens the door to a vicious form of panpsychism whereby all open systems, (e.g. grass, rocks etc.), must instantiate conscious experience and hence that disembodied minds lurk everywhere. (shrink)

Computer simulations and experiments share many important features. One way of explaining the similarities is to say that computer simulations just are experiments. This claim is quite popular in the literature. The aim of this paper is to argue against the claim and to develop an alternative explanation of why computer simulations resemble experiments. To this purpose, experiment is characterized in terms of an intervention on a system and of the observation of the reaction. Thus, if computer simulations are (...) experiments, either the computer hardware or the target system must be intervened on and observed. I argue against the first option using the non-observation argument, among others. The second option is excluded by e.g. the over-control argument, which stresses epistemological differences between experiments and simulations. To account for the similarities between experiments and computer simulations, I propose to say that computer simulations can model possible experiments and do in fact often do so. (shrink)

The ‘received view’ about computation is that all computations must involve representational content. Egan and Piccinini argue against the received view. In this paper, I focus on Egan’s arguments, claiming that they fall short of establishing that computations do not involve representational content. I provide positive arguments explaining why computation has to involve representational content, and how that representational content may be of any type. I also argue that there is no need for computational psychology to be individualistic. Finally, (...) I draw out a number of consequences for computational individuation, proposing necessary conditions on computational identity and necessary and sufficient conditions on computational I/O equivalence of physical systems.Keywords: Computation; Representation; Computational identity; Explanation; Narrow content; Physical computation. (shrink)

Arguments for extended cognition and the extended mind are typically directed at human-centred forms of cognitive extension—forms of cognitive extension in which the cognitive/mental states/processes of a given human individual are subject to a form of extended or wide realization. The same is true of debates and discussions pertaining to the possibility of Web-extended minds and Internet-based forms of cognitive extension. In this case, the focus of attention concerns the extent to which the informational and technological elements of the online (...) environment form part of the machinery of the (individual) human mind. In this paper, we direct attention to a somewhat different form of cognitive extension. In particular, we suggest that the Web allows human individuals to be incorporated into the computational/cognitive routines of online systems. These forms of computational/cognitive extension highlight the potential of the Web and Internet to support bidirectional forms of computational/cognitive incorporation. The analysis of such bidirectional forms of incorporation broadens the scope of philosophical debates in this area, with potentially important implications for our understanding of the foundational notions of extended cognition and the extended mind. (shrink)

For over 50 years, since the development of nuclear-armed ICBMs, the USA has sought a way to defend against them. These efforts evolved through various strategies and technologies: from nuclear-tipped rockets through space-based laser weapons to today’s system of ground-based kinetic-kill interceptors. Public debate around these issues reached a peak in the 1980s with President Reagan’s Strategic Defense Initiative, popularly known as Star Wars.Rebecca Slayton examines this history in Arguments that Count, a valuable and well-told account of a particular (...) aspect of missile defense: computer software. Missile defense required identifying a hostile missile launch, keeping track of thousands of incoming warheads on their ballistic trajectories, and directing interceptors to the right place—and doing all this in less than 30 minutes. From the outset, designers turned to computers to do the complex calculations quickly enough. But missile defense presented an additional factor, in that any m .. (shrink)

Various argumentation analysis tools permit the analyst to represent functional components of an argument (e.g., data, claim, warrant, backing), how arguments are composed of subarguments and defenses against potential counterarguments, and argumentation schemes. In order to facilitate a study of argument presentation in a biomedical corpus, we have developed a hybrid scheme that enables an analyst to encode argumentation analysis within the framework of Rhetorical Structure Theory (RST), which can be used to represent the discourse structure of (...) a text. This paper describes the hybrid representation scheme and illustrates its use for investigation of contexts that license omission of elements of an argument. The analyses given in the paper involve reconstruction of enthymemes. Defeasible argumentation schemes serve as a constraint on reconstruction. In addition, the examples illustrate several other types of contextual constraints on reconstruction of enthymemes. (shrink)

This paper connects information with computation and cognition via concept of agents that appear at variety of levels of organization of physical/chemical/cognitive systems – from elementary particles to atoms, molecules, life-like chemical systems, to cognitive systems starting with living cells, up to organisms and ecologies. In order to obtain this generalized framework, concepts of information, computation and cognition are generalized. In this framework, nature can be seen as informational structure with computational dynamics, where an (info-computational) agent is needed (...) for the potential information of the world to actualize. Starting from the definition of information as the difference in one physical system that makes a difference in another physical system – which combines Bateson and Hewitt’s definitions, the argument is advanced for natural computation as a computational model of the dynamics of the physical world, where information processing is constantly going on, on a variety of levels of organization. This setting helps us to elucidate the relationships between computation, information, agency and cognition, within the common conceptual framework, with special relevance for biology and robotics. (shrink)

I articulate and defend a new theory of what it is for a physical system to implement an abstract computational model. According to my descriptivist theory, a physical system implements a computational model just in case the model accurately describes the system. Specifically, the system must reliably transit between computational states in accord with mechanical instructions encoded by the model. I contrast my theory with an influential approach to computational implementation espoused by (...) Chalmers, Putnam, and others. I deploy my theory to illuminate the relation between computation and representation. I also rebut arguments, propounded by Putnam and Searle, that computational implementation is trivial. (shrink)

This paper starts from the observation that the standard arguments for compositionality are really arguments for the computability of semantics. Since computability does not entail compositionality, the question of what justifies compositionality recurs. The paper then elaborates on the idea of recursive semantics as corresponding to computable semantics. It is then shown by means of time complexity theory and with the use of term rewriting as systems of semantic computation, that syntactically unrestricted, noncompositional recursive semantics leads to computational explosion (...) (factorial complexity). Hence, with combinatorially unrestricted syntax, semantics with tractable time complexity is compositional. (shrink)