This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its (...) applications and thus presents the state of the art in the area. (shrink)

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)

The Fifth International Congress of Logic, Methodology and Philosophy of Science was held at the University of Western Ontario, London, Canada, 27 August to 2 September 1975. The Congress was held under the auspices of the International Union of History and Philosophy of Science, Division of Logic, Methodology and Philosophy of Science, and was sponsored by the National Research Council of Canada and the University of Western Ontario. As those associated closely with the work of the Division (...) over the years know well, the work undertaken by its members varies greatly and spans a number of fields not always obviously related. In addition, the volume of work done by first rate scholars and scientists in the various fields of the Division has risen enormously. For these and related reasons it seemed to the editors chosen by the Divisional officers that the usual format of publishing the proceedings of the Congress be abandoned in favour of a somewhat more flexible, and hopefully acceptable, method of pre sentation. Accordingly, the work of the invited participants to the Congress has been divided into four volumes appearing in the University of Western Ontario Series in Philosophy of Science. The volumes are entitled, Logic, Foundations of Mathematics and Computability Theory, Foun dational Problems in the Special Sciences, Basic Problems in Methodol ogy and Linguistics, and Historical and Philosophical Dimensions of Logic, Methodology and Philosophy of Science. (shrink)

Colburn (computer science, U. of Minnesota-Duluth) has a doctorate in philosophy and an advanced degree in computer science; he's worked as a philosophy professor, a computer programmer, and a research scientist in artificial intelligence. Here he discusses the philosophical foundations of artificial intelligence; the new encounter of science and philosophy (logic, models of the mind and of reasoning, epistemology); and the philosophy of computer science (touching on math, abstraction, software, and ontology).

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational (...) semantics, infinitary queries, Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others. (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)

I critically review Raymond Turner’s Computational Artifacts – Towards a Philosophy of Computer Science by placing beside his position a rather different one, according to which computer science is a branch of, and is therefore subsumed by, immaterial formal logic.

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 workshop on stochastic theory and adaptive control assembled many of the leading researchers on stochastic control and stochastic adaptive control to increase scientific exchange and cooperative research between these two subfields of stochastic analysis. The papers included in the proceedings include survey and research. They describe both theoretical results and applications of adaptive control. There are theoretical results in identification, filtering, control, adaptive control and various other related topics. Some applications to manufacturing systems, queues, networks, medicine and other topics (...) are gien. (shrink)

This paper aims to connect Stiegler’s reflections on theoretical computer science with his practical propositions for the design of digital technologies. Indeed, Stiegler’s theory of exosomatization implies a new conception of artificial intelligence, which is not based on an analogical paradigm (which compares organisms and machines, as in cybernetics, or which compares thought and computing, as in cognitivism) but on an organological paradigm, which studies the co-evolution of living organisms (individuals), artificial organs (tools), and social organizations (institutions). Such (...) a perspective does not compare human capacities to machine performances but studies the way in which the evolution of material and technical supports affects and transforms psychological, cognitive or noetic faculties (intuition, memory, understanding, imagination, sensibility, reason, etc.), as well as the constitution of different kinds of knowledge. This new theoretical paradigm implies a new ‘design’ for digital technologies, which considers their social role and their impact on psychological, cognitive or noetic faculties. (shrink)

There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title. Surprisingly, the philosophy of computer science is not nearly as well-developed. This article proposes topics that might constitute the philosophy of computer science and describes a course covering those topics, along with suggested readings and assignments.

The prelims comprise: Introduction Computer Science and Mathematics The Formal Verification Debate Abstraction in Computer Science Conclusion.

We characterize abstraction in computer science by first comparing the fundamental nature of computer science with that of its cousin mathematics. We consider their primary products, use of formalism, and abstraction objectives, and find that the two disciplines are sharply distinguished. Mathematics, being primarily concerned with developing inference structures, has information neglect as its abstraction objective. Computer science, being primarily concerned with developing interaction patterns, has information hiding as its abstraction objective. We show that (...) abstraction through information hiding is a primary factor in computer science progress and success through an examination of the ubiquitous role of information hiding in programming languages, operating systems, network architecture, and design patterns. (shrink)

The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation hypothesis. In particular, building on Kleene's second (...) recursion theorem, I prove that it is mathematically possible for us to be in a simulation that is being run on a computer \textit{by us}. In such a case, there would be two identical instances of us; the question of which of those is ``really us'' is meaningless. I also show how Rice's theorem provides some interesting impossibility results concerning simulation and self-simulation; briefly describe the philosophical implications of fully homomorphic encryption for (self-)simulation; briefly investigate the graphical structure of universes simulating universes simulating universes, among other issues. I end by describing some of the possible avenues for future research that this preliminary investigation reveals. (shrink)

The subject of this study is the problem of the failure of attempts by the scientific community to come to a common understanding of what exactly information can be as something encoded into material structures and moved along with them. At the same time, the following aspects of this problem are considered in detail: what is the immediate cause of the information problem; what are the objective and subjective prerequisites for its appearance; why the unresolved nature of this problem does (...) not interfere with the creation and development of communication systems, control and other "smart" devices; is there any general guideline for finding solutions to such problems, and what is it; what role did the philosophy of information play in turning the problem of information from a private scientific problem into a problem of the ideological level. The main results of the conducted research are as follows: the immediate cause of the information problem has been identified and a comprehensively substantiated solution to this problem has been given; it has been revealed that the incompleteness of the materialistic theory of cognition has become a fertile ground for the appearance of this problem; the circumstances that prevented its completion have been identified; the natural mechanism of control and cognition has been revealed, as a result of which the materialistic theory of cognition has been further developed the source of the ideal in the material world is revealed; it is shown that the mechanistic idea of information coding made the concept of information incompatible with the presence of any objective content; it is revealed what is actually hidden behind the words about information coding and its measurement; the nature of signals and signs is revealed; a kind of bias of the philosophy of information and a general error is revealed all known concepts of information. (shrink)

The process of constructing mathematical models is examined and a case made that the construction process is an integral part of the justification for the model. The role of heuristics in testing and modifying models is described and some consequences for scientific methodology are drawn out. Three different ways of constructing the same model are detailed to demonstrate the claims made here.

This paper contains a discussion of striking similarities between influential philosophical concepts of the past and the approaches currently employed in selected areas of computer science. In particular, works of the Pythagoreans, Plato, Abelard, Ash’arites, Malebranche and Berkeley are presented and contrasted with such computer science ideas as digital computers, object-oriented programming, the modelling of an object’s actions and causality in virtual environments, and 3D graphics rendering. The intention of this paper is to provoke the (...) class='Hi'>computer science community to go off the beaten path in order to find inspiration for the development of new approaches in software engineering. (shrink)

There is a widely extended image of computer software as some sort of ‘black box,’ where it does not matter how it internally works, but rather what sort of results are obtained given certain input values. By approaching computer software this way, many philosophical issues are hidden, neglected, or simply misunderstood. This article discusses three units of analysis of computer software, namely, specifications, algorithms, and computer processes. The aim is to understand the scientific and engineering practices (...) supporting each unit of analysis, as well as to analyze their methodology, ontology, and epistemology. (shrink)

What is computer-science about? CS is obviously the science of computers. But what exactly are computers? We know that there are physical computers, and, perhaps, also abstract computers. Let us limit the discussion here to physical entities and ask: What are physical computers? What does it mean for a physical entity to be a computer? The answer, it seems, is that physical computers are physical dynamical systems that implement formal entities such as Turing-machines. I do not (...) think that this answer is false. But it invites another, and troubling, question: What distinguishes computers from other physical dynamical systems? The difficulty is that, on the one hand, every physical system im-plements abstract formal entities such as sets of differential equations, while on the other hand we certainly do not want to count every dynamical system as a computer. After all, if CS is somehow distinctive, then there must be a difference between computers and other systems such as solar systems, stomachs, and carburetors. But what is the difference? (shrink)

This book looks at the ways in which conditionals, an integral part of philosophy and logic, can be of practical use in computer programming. It analyzes the different types of conditionals, including their applications and potential problems. Other topics include defeasible logics, the Ramsey test, and a unified view of consequence relation and belief revision. Its implications will be of interest to researchers in logic, philosophy, and computer science, particularly artificial intelligence.

The article deals with Russian scientific classifications (GRNTI, VAK) of computer science in comparison with Western scien­tific classifications Fields of Science and Technology (FOS) and Universal Decimal Classification (UDS). The author analyzes the basics and principles of these classifications, identifies their strong and weak points as well as their influence on the devel­opment of computer sciences. She also provides some recom­mendations on adjustments of Russian scientific classifications aiming to make them more flexible and adaptive to the (...) faster scientific and technological development and interdisciplinary cooperation. (shrink)

We examine the philosophical disputes among computer scientists concerning methodological, ontological, and epistemological questions: Is computer science a branch of mathematics, an engineering discipline, or a natural science? Should knowledge about the behaviour of programs proceed deductively or empirically? Are computer programs on a par with mathematical objects, with mere data, or with mental processes? We conclude that distinct positions taken in regard to these questions emanate from distinct sets of received beliefs or paradigms within (...) the discipline: – The rationalist paradigm, which was common among theoretical computer scientists, defines computer science as a branch of mathematics, treats programs on a par with mathematical objects, and seeks certain, a priori knowledge about their ‘correctness’ by means of deductive reasoning. – The technocratic paradigm, promulgated mainly by software engineers and has come to dominate much of the discipline, defines computer science as an engineering discipline, treats programs as mere data, and seeks probable, a posteriori knowledge about their reliability empirically using testing suites. – The scientific paradigm, prevalent in the branches of artificial intelligence, defines computer science as a natural (empirical) science, takes programs to be entities on a par with mental processes, and seeks a priori and a posteriori knowledge about them by combining formal deduction and scientific experimentation. We demonstrate evidence corroborating the tenets of the scientific paradigm, in particular the claim that program-processes are on a par with mental processes. We conclude with a discussion in the influence that the technocratic paradigm has been having over computer science. (shrink)

The Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22–25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer (...) Science at the University of Edinburgh. The CSL 2002 Programme Committee considered 111 submissions from 28 countries during a two week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 37 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Susumu Hayashi, Frank Neven, and Damian Niwinski; ́ the papers provided by the invited speakers appear at the front of this volume. In addition to the main conference, two tutorials – ‘Introduction to Mu- Calculi’ and ‘Parametrized Complexity’ – were given on the previous day. (shrink)

This reader contains the extended abstracts of the seminars organised for the “Computer Science and IT with/for Biology” Seminar Series, held at the Faculty of Computer Science, Free University of Bozen-Bolzano, from October to December 2005. Slides of the presentations are available online at: www.inf.unibz.it/krdb/biology.

Investigations into inter-level relations in computer science, biology and psychology call for an *empirical* turn in the philosophy of mind. Rather than concentrate on *a priori* discussions of inter-level relations between 'completed' sciences, a case is made for the actual study of the way inter-level relations grow out of the developing sciences. Thus, philosophical inquiries will be made more relevant to the sciences, and, more importantly, philosophical accounts of inter-level relations will be testable by confronting them with what (...) really happens in science. Hence, close observation of the ever-changing reduction relations in the developing sciences, and revision of philosophical positions based on these empirical observations, may, in the long run, be more conducive to an adequate understanding of inter-level relations than a traditional *a priori* approach. (shrink)

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems.The logical systems presented are:- Propositional calculus (including binary decision diagrams);- Predicate calculus;- (...) Resolution;- Hoare logic;- Z;- Temporal logic.Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5 Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency, programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education. (shrink)

This festschrift volume is dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday. For over half a century, Trakhtenbrot has been making seminal contributions to virtually all of the central areas of theoretical computer science. He is universally admired as a founding father and long-standing pillar of the discipline of computer science. On Friday, 28 April 2006, the School of Computer Science at Tel Aviv University held a “Computation Day Celebrating Boaz (...) (Boris) Trakhtenbrot's Eighty-Fifth Birthday”. As a follow-up to that event, his students and colleagues were asked to contribute to a volume in his honor and in recognition of his grand contributions to the field. The book opens with two historical overviews and a bibliography. These are followed by 33 thoroughly reviewed technical contributions. The broad range of topics covered include mathematical logic, logics for computer science, mathematics for computer science, automata and formal languages, asynchronous computation, semantics of programming languages, verification, and software engineering. This tapestry of subjects stands as testimony to the vast scope of Trakhtenbrot's achievements and the profound influence he has had on the field. (shrink)

This paper presents folk impressions of the University of Manchester’s difficulties in becoming a great university, but by means of a fiction imitating a distinguished writer from the Indian subcontinent. The impressions concern past efforts and the difficulties they faced.

The related fields of fractal image encoding and fractal image analysis have blossomed in recent years. This book, originating from a NATO Advanced Study Institute held in 1995, presents work by leading researchers. It is developing the subjects at an introductory level, but it also has some recent and exciting results in both fields. The book contains a thorough discussion of fractal image compression and decompression, including both continuous and discrete formulations, vector space and hierarchical methods, and algorithmic optimizations. The (...) book also discusses multifractal approaches to image analysis, segmentation, and recognition, including medical applications. (shrink)

Recently, information retrieval is shown to be a science by mapping information retrieval scientific study to scientific study abstracted from physics. The exercise was rather tedious and lengthy. Instead of dealing with the nitty gritty, this paper looks at the insights into how computer science can be made into a science by using that methodology. That is by mapping computer science scientific study to the scientific study abstracted from physics. To show the mapping between (...) computer science and physics, we need to define what is engineering science which computer science belongs to. Some principles and assumptions of engineering science theory are presented. To show computer science is a science, we presented two approaches. Approach 1 considers computer science as simulation of human behaviour similar to the goal of artificial intelligence. Approach 2 is closely related to the actual activities in computer science, and this approach considers computer science based on the theory of computation. Finally, we answer some of the common outstanding issues about computer science to convince our reader that computer science is a science. (shrink)

What is computer-science about? CS is obviously the science of computers. But what exactly are computers? We know that there are physical computers, and, perhaps, also abstract computers. Let us limit the discussion here to physical entities and ask: What are physical computers? What does it mean for a physical entity to be a computer? The answer, it seems, is that physical computers are physical dynamical systems that implement formal entities such as Turing-machines. I do not (...) think that this answer is false. But it invites another, and troubling, question: What distinguishes computers from other physical dynamical systems? The difficulty is that, on the one hand, every physical system im-plements abstract formal entities such as sets of differential equations, while on the other hand we certainly do not want to count every dynamical system as a computer. After all, if CS is somehow distinctive, then there must be a difference between computers and other systems such as solar systems, stomachs, and carburetors. But what is the difference? (shrink)