Since its conception nearly 20 years ago, Logic Programming - the idea of using logic as a programming language - has been developed to the point where it now plays an important role in areas such as database theory, artificial intelligence and software engineering. However, there are still many challenging research issues to be addressed and the UK branch of the Association for Logic Programming was set up to provide a forum where the flourishing research community could discuss important issues (...) of Logic Programming which were often by-passed at the large international conferences. This volume contains the twelve papers which were presented at the ALPUK's 3rd conference which was held in Edinburgh, 10-12 April 1991. The aim of the conference was to give a broad but detailed technical insight into the work currently being done in this field, both in the UK and by researchers as far afield as Canada and Bulgaria. The breadth of interest in this area of Computer Science is reflected in the range of the papers which cover - amongst other areas - massively parallel implementation, constraint logic programming, circuit modelling, algebraic proof of program properties, deductive databases, specialised editors and standardisation. The resulting volume gives a good overview of the current progress being made in the field and will be of interest to researchers and students of any aspects of logic programming, parallel computing or database techniques and management. (shrink)

Computational intelligence techniques are being investigated as an extension of the traditional fault diagnosis methods. This article presents, for the first time, a scheme for fault detection and isolation via artificial neural networks and fuzzy logic. It deals with the sensor fault of a three-link selective compliance assembly robot arm robot. A second scheme is proposed for fault detection and accommodation via analytical redundancy, and it deals with the sensor fault of a three-link SCARA robot. These proposed FDI (...) approaches are implemented on Matlab/simulink software and tested under several types of faults. The results show the importance of this process. Then, the sensor faults are detected and isolated successfully. Also, the actuator faults are detected and a fault tolerance strategy is used for reconfigurable control using a sliding-mode observer. (shrink)

Over the years, the urban heat vulnerability has evolved as a pressing global concern for researchers and policymakers alike. Numerous studies have aimed at mitigating the adverse effects of urban heat vulnerability on public health and safety. However, the critical task of selecting the most fitting indicator for urban heat islands in public spaces is not emphasized in the existing studies, considering the diverse indices available. Beyond identification, studies that delve into the prioritization of these indices and the determination of (...) optimal variables along with their respective weights are scanty. The present study attempts to address these gaps in urban heat vulnerability research through the lens of natural solutions. The study employs a fuzzy analytical hierarchy approach to ascertain the weights of selected criteria, providing a nuanced understanding of the multifaceted factors influencing their applicability. Real-time impact estimation using the fuzzy technique for order of preference by similarity to ideal solutions enhances the practicality of the findings. The results reveal a set of pivotal characteristics crucial for constructing a robust heat vulnerability index, facilitating the prioritization of selected criteria. The implementation of this hybrid methodology culminates in a streamlined, precise, and practical tool for evaluating heat vulnerability in hot urban public spaces. These findings contribute valuable insights to the academic discourse and offer a tangible resource for policymakers and practitioners. The proactive approach provides a roadmap for addressing impending challenges related to urban heat vulnerability, marking a positive step toward creating resilient and sustainable urban environments. (shrink)

Design problems in structural engineering are often modeled as differential equations. These problems are posed as initial or boundary value problems with several possible variations in structural designs. In this paper, we have derived a mathematical model that represents different structures of beam-columns by varying axial load with or without internal forces including bending rigidity. We have also developed a novel solver, the LeNN-NM algorithm, which consists of weighted Legendre polynomials, and a single path following optimizer, the Nelder–Mead algorithm. To (...) evaluate the performance of our solver, we have considered three design problems representing beam-columns. The values of performance indicators, MAD, TIC, NSE, and ENSE, are calculated for a hundred simulations. The outcome of our statistical analysis points to the superiority of the LeNN-NM algorithm. Graphical illustrations are presented to further elaborate on our claims. (shrink)

We present the methodological principles underlying the scientific activities of the DHST Commission on the History and Philosophy of Computing. This volume collects refereed selected papers from the First International Conference organized by the Commission.

This article concerns the curriculum of computer literacy (CL). A strong sense of technical necessity informs the design of the CL curriculum, and as a result, instruction is inadequate at best and dehumanizing at worst. CL curriculum and instruction are informed by a sense of technical determinism and a particular form of masculinity. This article draws mainly from the sociology of education, supplemented by personal observation. The article has two implications. First, to reduce the failure and frustration that many feel (...) as they attempt to become computer literate, greater attention ought to be given in CL curriculum design to the concept of learning as enculturation and to cognitive context. Second, to counter the sense of necessity that leads designers and others to ignore culture and context, the formal CL curriculum must give serious attention to the social construction of educational technology/technique, especially the in fluence of gender. (shrink)

In this modern world, a massive amount of data is processed and broadcasted daily. This includes the use of high energy, massive use of memory space, and increased power use. In a few applications, for example, image processing, signal processing, and possession of data signals, etc., the signals included can be viewed as light in a few spaces. The compressive sensing theory could be an appropriate contender to manage these limitations. “Compressive Sensing theory” preserves extremely helpful while signals are sparse (...) or compressible. It very well may be utilized to recoup light or compressive signals with less estimation than customary strategies. Two issues must be addressed by CS: plan of the estimation framework and advancement of a proficient sparse recovery calculation. The essential intention of this work expects to audit a few ideas and utilizations of compressive sensing and to give an overview of the most significant sparse recovery calculations from every class. The exhibition of acquisition and reconstruction strategies is examined regarding the Compression Ratio, Reconstruction Accuracy, Mean Square Error, and so on. (shrink)

This article attempts to demystify computer vision for novice programmers through a survey of new applications in the arts, system design considerations, and contemporary tools. It introduces the concept and gives a brief history of computer vision within interactive art from Myron Kruger to the present. Basic techniques of computer vision such as detecting motion and object tracking are discussed in addition to various software applications created for exploring the topic. As an example, the results of a one-week machine (...) vision workshop are presented to show how designers are able to apply their skills toward creating novel uses of these technologies. The article concludes with a listing of code for basic computer vision techniques. (shrink)

Programming computers to construct "real types," generally descriptive of a class of societies, makes explicit all steps in the thought process of such constructions because unambiguous instructions to, the computer are needed. The historian uses his judgment to choose a data field and variables that may be relevant in forming a type. He then looks for matches; he divides the data field into groups according to one variable and sees if the other variables differ significantly according to these groups. In (...) this process, he may discover new variables of importance. The selection of interesting types from among the matches can be determined only by the pragmatic interest of the historian; analysis of this selection process involves some of the most difficult problems in the study of historical technique. The computer using a "real type" program may be useful as a quick means to scan data. (shrink)

Spreadsheets are mathematical documents that are heavily employed in administration, financial forecasting, education, and science because of their intuitive, flexible, and direct approach to computation. In this paper we show that spreadsheets are interesting applications for MKM techniques which can alleviate usability and maintenance problems as spreadsheet-based applications grow evermore complex and longlived. We present the software and information architecture of a semantic enhancement of MS Excel spreadsheets that aims at compensating the computational bias in spreadsheets.

This work focuses on the application of machine learning techniques to assist the clinicians in the administration of analgesic drug during general anaesthesia. Specifically, the main objective is to propose the basis of an intelligent system capable of making decisions to guide the opioid dose changes based on a new nociception monitor, the analgesia nociception index. Clinical data were obtained from 15 patients undergoing cholecystectomy surgery. By means of an off-line study, machine learning techniques were applied to analyse (...) the possible relationship between the analgesic dose changes performed by the physician due to the hemodynamic activity of the patients and the evolution of the ANI. After training different classifiers and testing the results under cross validation, a preliminary relationship between the evolution of ANI and the dosage of remifentanil was found. These results evidence the potential of the ANI as a promising index to guide the infusion of analgesia. (shrink)

Two analyzes of Spark engine performance strategies to implement the Spark technique in a matrix distributed computational algorithm, the multiplication of a sparse multiplication operational test model. The dimensions of the two input sparse matrices have been fixed to 30,000 × 30,000, and the density of the input matrix have been changed. The experimental results show that when the density reaches about 0.3, the original dense matrix multiplication performance can outperform the sparse-sparse matrix multiplication, which is basically consistent with (...) the relationship between the sparse matrix multiplication implementation in the single-machine sparse matrix test and the computational performance of the local native library. When the density of the fixed sparse matrix is 0.01, the distributed density-sparse matrix multiplication outperforms the same sparsity but uses the density matrix storage, and the acceleration ratio increases from 1.88× to 5.71× with the increase in dimension. The overall performance of distributed operations is improved. (shrink)

The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether defined in different manners, via function algebras (Real Recursive Functions) or via Turing Machines (Computable Analysis). We provide general tools for investigating these issues, using two techniques we call approximation and lifting. We use these methods to obtain two main theorems. First, we provide an alternative proof of the result from Campagnolo (...) et al. (J Complex 18:977–1000, 2002), which precisely relates the Kalmar elementary computable functions to a function algebra over the reals. Second, we build on that result to extend a result of Bournez and Hainry (Theor Comput Sci 348(2–3):130–147, 2005), which provided a function algebra for the ${\mathcal{C}}^2$ real elementary computable functions; our result does not require the restriction to ${\mathcal{C}}^2$ functions. In addition to the extension, we provide an alternative approach to the proof. Their proof involves simulating the operation of a Turing Machine using a function algebra. We avoid this simulation, using a technique we call lifting, which allows us to lift the classic result regarding the elementary computable functions to a result on the reals. The two new techniques bring a different perspective to these problems, and furthermore appear more easily applicable to other problems of this sort. (shrink)

This article explores the social and historical conditions under which “people changing technology” overshadows that of “technology changing people” through its influence on human life, society, and the biosphere. Social construction and determinism are thus two sides of the same coin. However, both ignore the inseparability of thoughts and action from lives, lives from communities, and communities from their historical journeys. This hides from view the possibility of technology becoming a secular myth, in the sense of cultural anthropology. The current (...) discipline-based intellectual and professional division of labor treats the living world as if it were structured the way technology is. As a result, human life has become “digitized,” since the process of industrialization transformed human life and society to make the computer and information revolution both possible and necessary. It has also misdirected our sense of responsibility for technology. (shrink)

Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences. Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary (...) computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The book includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable and lively way. (shrink)

Vesely (experimental physics, U. of Vienna, Austria) provides the basic numerical and computational techniques, followed by an explanation of specific problems of computational physics. Appendices address properties of computing machines and an outline of the technique of Fast Fourier Transformation. The first edition, published by Plenum Press, Ne.

This clear and accessible textbook and its associated website offer a state of the art introduction to the burgeoning field of computer ethics and professional responsibility. Includes discussion of hot topics such as the history of computing; the social context of computing; methods of ethical analysis; professional responsibility and codes of ethics; computer security, risks and liabilities; computer crime, viruses and hacking; data protection and privacy; intellectual property and the “open source” movement; global ethics and the internet Introduces key issues (...) and concepts at the start of each section, and features classroom-tested study questions, and lists of useful websites and further reading Provides a wealth of relevant case studies, and an easy-to learn case-analysis technique Is accompanied by a website, offering sample student answers, additional study questions, example case analyses, and discussion forums. (shrink)

In their simplest form, hybrid languages are propositional modal languages which can refer to states. They were introduced by Arthur Prior, the inventor of tense logic, and played an important role in his work: because they make reference to specific times possible, they remove the most serious obstacle to developing modal approaches to temporal representation and reasoning. However very little is known about the computational complexity of hybrid temporal logics.In this paper we analyze the complexity of the satisfiability problem (...) of a number of hybrid temporal logics: the basic hybrid language over transitive trees; nominal Until logic; and referential interval logic. We discuss the effects of including nominals, the @ operator, the somewhere modality E, and the difference operator D. Adding nominals to tense logic leads for several frame-classes to an increase in complexity of the satisfiability problem from PSPACE to EXPTIME. On transitive trees, however, the satisfiability problem for this language can be decided in PSPACE. Along the way we make a detour through hybrid propositional dynamic logic: we establish upper bounds for a number of temporal logics by generalizing results due to Passy and Tinchev [29] and De Giacomo [16]. We conclude with some remarks on the relevance of our results to description logic, and draw attention to the utility of the spypoint technique for proving upper and lower bounds. (shrink)

Computational philosophy is the use of mechanized computational techniques to unearth philosophical insights that are either difficult or impossible to find using traditional philosophical methods. Computational metaphysics is computational philosophy with a focus on metaphysics. In this paper, we (a) develop results in modal metaphysics whose discovery was computer assisted, and (b) conclude that these results work not only to the obvious benefit of philosophy but also, less obviously, to the benefit of computer science, since (...) the new computational techniques that led to these results may be more broadly applicable within computer science. The paper includes a description of our background methodology and how it evolved, and a discussion of our new results. (shrink)

Computational methods such as computer simulations, Monte Carlo methods, and agent-based modeling have become the dominant techniques in many areas of science. Extending Ourselves contains the first systematic philosophical account of these new methods, and how they require a different approach to scientific method. Paul Humphreys draws a parallel between the ways in which such computational methods have enhanced our abilities to mathematically model the world, and the more familiar ways in which scientific instruments have expanded our (...) access to the empirical world. This expansion forms the basis for a new kind of empiricism, better suited to the needs of science than the older anthropocentric forms of empiricism. Human abilities are no longer the ultimate standard of epistemological correctness.Humphreys also includes arguments for the primacy of properties rather than objects, the need to consider technological constraints when appraising scientific methods, and a detailed account of how the path from computational template to scientific application is constructed. This last feature allows us to hold a form of selective realism in which anti-realist arguments based on formal reconstructions of theories can be avoided. One important consequence of the rise of computational methods is that the traditional organization of the sciences is being replaced by an organization founded on computational templates.Extending Ourselves will be of interest to philosophers of science, epistemologists, and to anyone interested in the role played by computers in modern science. (shrink)

This unique volume introduces and discusses the methods of validating computer simulations in scientific research. The core concepts, strategies, and techniques of validation are explained by an international team of pre-eminent authorities, drawing on expertise from various fields ranging from engineering and the physical sciences to the social sciences and history. The work also offers new and original philosophical perspectives on the validation of simulations. Topics and features: introduces the fundamental concepts and principles related to the validation of computer (...) simulations, and examines philosophical frameworks for thinking about validation; provides an overview of the various strategies and techniques available for validating simulations, as well as the preparatory steps that have to be taken prior to validation; describes commonly used reference points and mathematical frameworks applicable to simulation validation; reviews the legal prescriptions, and the administrative and procedural activities related to simulation validation; presents examples of best practice that demonstrate how methods of validation are applied in various disciplines and with different types of simulation models; covers important practical challenges faced by simulation scientists when applying validation methods and techniques; offers a selection of general philosophical reflections that explore the significance of validation from a broader perspective. This truly interdisciplinary handbook will appeal to a broad audience, from professional scientists spanning all natural and social sciences, to young scholars new to research with computer simulations. Philosophers of science, and methodologists seeking to increase their understanding of simulation validation, will also find much to benefit from in the text. (shrink)

Computational techniques comparing co-occurrences of city names in texts allow the relative longitudes and latitudes of cities to be estimated algorithmically. However, these techniques have not been applied to estimate the provenance of artifacts with unknown origins. Here, we estimate the geographic origin of artifacts from the Indus Valley Civilization, applying methods commonly used in cognitive science to the Indus script. We show that these methods can accurately predict the relative locations of archeological sites on the basis (...) of artifacts of known provenance, and we further apply these techniques to determine the most probable excavation sites of four sealings of unknown provenance. These findings suggest that inscription statistics reflect historical interactions among locations in the Indus Valley region, and they illustrate how computational methods can help localize inscribed archeological artifacts of unknown origin. The success of this method offers opportunities for the cognitive sciences in general and for computational anthropology specifically. (shrink)

Over the past two decades, researchers have made great advances in the area of computational methods for extracting meaning from text. This research has to a large extent been spurred by the development of latent semantic analysis (LSA), a method for extracting and representing the meaning of words using statistical computations applied to large corpora of text. Since the advent of LSA, researchers have developed and tested alternative statistical methods designed to detect and analyze meaning in text corpora. This (...) research exemplifies how statistical models of semantics play an important role in our understanding of cognition and contribute to the field of cognitive science. Importantly, these models afford large-scale representations of human knowledge and allow researchers to explore various questions regarding knowledge, discourse processing, text comprehension, and language. This topic includes the latest progress by the leading researchers in the endeavor to go beyond LSA. (shrink)

We give a systematic technical exposition of the foundations of the theory of computably compact metric spaces. We discover several new characterizations of computable compactness and apply these characterizations to prove new results in computable analysis and effective topology. We also apply the technique of computable compactness to give new and less combinatorially involved proofs of known results from the literature. Some of these results do not have computable compactness or compact spaces in their statements, and thus these applications are (...) not necessarily direct or expected. (shrink)

influence. One of the principal characteristics that distinguishes Cognitive Science from more traditional studies of cognition within Psychology, is the extent to which it has been influenced by both the ideas and the techniques of computing. It may come as a surprise to the outsider, then, to discover that there is no unanimity within the discipline on either (a) the nature (and in some cases the desireabilty) of the influence and (b) what computing is –- or at least on (...) its. (shrink)

Computing as a science is the study of computers, both the hardware and their programs, and all that goes with them (Newell and Simon 1976). The philosophy of computer science is concerned with problems of a philosophical kind raised by the discipline's goals, fundamental ideas, techniques or methods, and findings. It parallels other parts of philosophy ‐ for example, the philosophy of economics or linguistics or biology ‐ in primarily considering problems raised by one discipline, rather than issues raised (...) by a group of disciplines, as does the philosophy of science in general. (shrink)

Logic and Computation is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of statements in a programming language. This book consists of two parts. Part I outlines the mathematical preliminaries: elementary logic and domain theory. They are explained at an intuitive level, giving (...) references to more advanced reading. Part II provides enough detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Astrology, Computers, and the VolksgeistDenis DuttonCarroll Righter is not a name you will recognize, unless, perhaps, you’re old enough and you grew up reading the Los Angeles Times. Righter was the Times’s astrologer, and encountering his name recently brought back a couple of memories from the early 1950s. I remember finding it strange that a man (he was pictured alongside his column) was called Carroll, though he didn’t spell (...) it like the girl who lived across the street. But especially I recall the fun we had when my father would read the horoscopes out loud and we’d compare them with the day’s events. Ours was a tough family for an astrologer to please, with rather different things happening to too many Aquarians, and a robust skepticism about anything of the sort later to be called “New Age.”How could I know that while we laughed and debated, somewhere else out there in the urban sprawl, Righter’s prognostications were being subjected to subtle and portentous analysis by that kingpin of the Frankfurt School, Theodor W. Adorno? Mirabile dictu, Adorno was living in L.A. at the time, and we now have his examination of Righter in The Stars Down to Earth, and Other Essays on the Irrational in Culture, edited with an excellent introduction by Stephen Crook (Routledge, $16.95). The result seems, now in the fullness of time, of mixed value and relevance. Adorno has produced an admirably accessible rhetoric of astrology, what he terms “content analysis.” In this, he is finding out for himself about the so-called cold-reading techniques of psychic consultation, practices long known to magicians and astrologers and only really understood by psychologists since Bertram Forer’s work in the 1940s. But beyond that, Adorno uses astrology to support and exemplify his theory of authoritarian irrationalism. As you might expect, this is more questionable. [End Page 424]To be sure, there are many intriguing observations throughout this mostly readable essay. In a passage perhaps even more true today than when it was written, Adorno says that a “climate of semi-erudition is the fertile breeding ground for astrology.” He refers to people who have gone just beyond the naive acceptance of the authority of science, but who don’t know enough, or who have not sufficiently developed “the power of thinking,” that they can replace such acceptance with anything better: “The semi-erudite vaguely wants to understand and is also driven by the narcissistic wish to prove superior to the plain people but he is not in a position to carry through complicated and detached intellectual operations.” In other words, quantum mechanics is pretty tough, but astrology offers sophisticated understanding of all reality in a few easy steps. Besides, astronomy is about those remote stars and planets out there—rather cold and impersonal. In Adorno’s apt title phrase, astrology brings it all down to earth, because it’s about the single most important thing in the universe: me. In an analogy that isn’t too far-fetched, he says that to the semi-erudite individual “astrology, just as other irrational creeds like racism, provides a short-cut by bringing the complex to a handy formula and offering at the same time the pleasant gratification that he who feels excluded from educational privileges nevertheless belongs to the minority of those who are ‘in the know.’” Someone once remarked that Scientology boosts self-esteem largely by giving semi-educated, degreeless persons impressive certificates to hang on their walls, and Adorno is right that there’s a similar syndrome at work with most New Age esoterica, including astrology. (In literary theory, there are no certificates, of course—you just have to learn the jargon.)Much to his credit, Adorno independently identifies many of the features of cold reading described by Forer and later writers, such as the persistent tendency of the client to personalize the general message. Of Righter’s “Follow up that intuition of yours,” or “Display that keen mind of yours,” Adorno says, “People who have any affinity at all to occultism are usually prepared to react to the information they are craving in such a way... (shrink)

Various algorithms have been proposed for learning (partial) genetic regulatory networks through systematic measurements of differential expression in wild type versus strains in which expression of specific genes has been suppressed or enhanced, as well as for determining the most informative next experiment in a sequence. While the behavior of these algorithms has been investigated for toy examples, the full computational complexity of the problem has not received sufficient attention. We show that finding the true regulatory network requires (in (...) the worst-case) exponentially many experiments (in the number of genes). Perhaps more importantly, we provide an algorithm for determining the set of regulatory networks consistent with the observed data. We then show that this algorithm is infeasible for realistic data (specifically, nine genes and ten experiments). This infeasibility is not due to an algorithmic flaw, but rather to the fact that there are far too many networks consistent with the data (10 18 in the provided example). We conclude that gene perturbation experiments are useful in confirming regulatory network models discovered by other techniques, but not a feasible search strategy. (shrink)

This paper explores the application of an affective content analysis to a selection of nanotechnology news articles gathered from selected newspapers. Thematic content analyses dominate current efforts to mine large text collections of popular science media; the addition of an affective analysis element can yield useful information to supplement future content analysis efforts. Using Whissell’s Dictionary of Affect in Language , the analysis rates news articles gathered over a twenty-two year period for their pleasantness, activeness, and imagery, determining the mean (...) affective tone in each category for the entire collection, four ‘content themes’ (business, national security, health, and environment), and the change in affective tone over the twenty-two year period these articles represent. Whereas the entire collection analyzed as a whole rates very similarly to the average found for everyday English language use and the ‘content themes’ show similar results, the change in affective tone over the years has been both significant and striking. A sample of results from three years of the twenty-two year period is then qualitatively explored to demonstrate to the reader the connection between the quantitative results of the Dictionary and the qualitative effect of the article’s word use and phrasing. The paper ends with a review of the technique’s success, implications for policymaking and public dialogue, and avenues for future use. (shrink)

We study computable Polish spaces and Polish groups up to homeomorphism. We prove a natural effective analogy of Stone duality, and we also develop an effective definability technique which works up to homeomorphism. As an application, we show that there is a $\Delta ^0_2$ Polish space not homeomorphic to a computable one. We apply our techniques to build, for any computable ordinal $\alpha $, an effectively closed set not homeomorphic to any $0^{}$-computable Polish space; this answers a question of (...) Nies. We also prove analogous results for compact Polish groups and locally path-connected spaces. (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)

This book provides an overview of computer techniques and tools — especially from artificial intelligence (AI) — for handling legal evidence, police intelligence, crime analysis or detection, and forensic testing, with a sustained discussion of methods for the modelling of reasoning and forming an opinion about the evidence, methods for the modelling of argumentation, and computational approaches to dealing with legal, or any, narratives. By the 2000s, the modelling of reasoning on legal evidence has emerged as a significant (...) area within the well-established field of AI & Law. An overview such as this one has never been attempted before. It offers a panoramic view of topics, techniques and tools. It is more than a survey, as topic after topic, the reader can get a closer view of approaches and techniques. One aim is to introduce practitioners of AI to the modelling legal evidence. Another aim is to introduce legal professionals, as well as the more technically oriented among law enforcement professionals, or researchers in police science, to information technology resources from which their own respective field stands to benefit. Computer scientists must not blunder into design choices resulting in tools objectionable for legal professionals, so it is important to be aware of ongoing controversies. A survey is provided of argumentation tools or methods for reasoning about the evidence. Another class of tools considered here is intended to assist in organisational aspects of managing of the evidence. Moreover, tools appropriate for crime detection, intelligence, and investigation include tools based on link analysis and data mining. Concepts and techniques are introduced, along with case studies. So are areas in the forensic sciences. Special chapters are devoted to VIRTOPSY (a procedure for legal medicine) and FLINTS (a tool for the police). This is both an introductory book (possibly a textbook), and a reference for specialists from various quarters. (shrink)

Over the past thirty years, it is been common to hear the mind likened to a digital computer. This essay is concerned with a particular philosophical view that holds that the mind literally is a digital computer (in a specific sense of “computer” to be developed), and that thought literally is a kind of computation. This view—which will be called the “Computational Theory of Mind” (CTM)—is thus to be distinguished from other and broader attempts to connect the mind with (...) computation, including (a) various enterprises at modeling features of the mind using computational modeling techniques, and (b) employing some feature or features of production-model computers (such as the stored program concept, or the distinction between hardware and software) merely as a guiding metaphor for understanding some feature of the mind. This entry is therefore concerned solely with the Computational Theory of Mind (CTM) proposed by Hilary Putnam [1961] and developed most notably for philosophers by Jerry Fodor [1975, 1980, 1987, 1993]. The senses of ‘computer’ and ‘computation’ employed here are technical; the main tasks of this entry will therefore be to elucidate: (a) the technical sense of ‘computation’ that is at issue, (b) the ways in which it is claimed to be applicable to the mind, (c) the philosophical problems this understanding of the mind is claimed to solve, and (d) the major criticisms that have accrued to this view. (shrink)

This chapter provides an overview of the basic research strategies and analytic techniques deployed in computational cognitive neuroscience. On the one hand, “top-down” strategies are used to infer, from formal characterizations of behavior and cognition, the computational properties of underlying neural mechanisms. On the other hand, “bottom-up” research strategies are used to identify neural mechanisms and to reconstruct their computational capacities. Both of these strategies rely on experimental techniques familiar from other branches of neuroscience, including (...) functional magnetic resonance imaging, single-cell recording, and electroencephalography. What sets computational cognitive neuroscience apart, however, is the explanatory role of analytic techniques from disciplines as varied as computer science, statistics, machine learning, and mathematical physics. These techniques serve to describe neural mechanisms computationally, but also to drive the process of scientific discovery by influencing which kinds of mechanisms are most likely to be identified. For this reason, understanding the nature and unique appeal of computational cognitive neuroscience requires not just an understanding of the basic research strategies that are involved, but also of the formal methods and tools that are being deployed, including those of probability theory, dynamical systems theory, and graph theory. (shrink)

Electronic computers form an integral part of modern mathematical practice. Several high-profile results have been proven with techniques where computer calculations form an essential part of the proof. In the traditional philosophical literature, such proofs have been taken to constitute a posteriori knowledge. However, this traditional stance has recently been challenged by Mark McEvoy, who claims that computer calculations can constitute a priori mathematical proofs, even in cases where the calculations made by the computer are too numerous to be (...) surveyed by human agents. In this article we point out the deficits of the traditional literature that has called for McEvoy’s correction. We also explain why McEvoy’s defence of mathematical apriorism fails and we discuss how the debate over the epistemological status of computer-assisted mathematics contains several unfortunate conceptual reductions. (shrink)