Search

This SpringerBrief is a computational study of significant concerns and their role in forming long-term relationships between intelligent entities. Significant concerns include attitudes, preferences, affinities, and values that are held to be highly valued and meaningful: The means through which a person may find deeply held identity, purpose, and transformation. Significant concerns always engage the emotions and senses in a way that simply holding an opinion may or may not. For example, experiencing a significant concern may provoke deep feelings of awe and wonder in a way that deciding what to have for lunch probably does not, even if the lunch decision involves a rich array of preferences and values. Significant concerns also include what Emmons has called ultimate concerns. The author builds upon this base by considering the hypothetical case of intelligence in androids. An android is defined as a human-like robot that humans would accept as equal to humans in how theyperform and behave in society. An android as defined in this book is not considered to be imitating a human, nor is its purpose to deceive humans into believing that it is a human. Instead, the appropriately programmed android self-identifies as a non-human with its own integrity as a person. Therefore, a computational understanding of personhood and how persons – whether human or android – participate in relationships is essential to this perspective on artificial intelligence. Computational Modelling of Robot Personhood and Relationality describes in technical detail an implementation of a computational model called Affinity that takes the form of a simulation of a population of entities that form, maintain, and break relationships with each other depending upon a rich range of values, motivations, attitudes, and beliefs. Future experimentation and improvements of this model may be used not only to gain a wider understanding of human persons but may also form a preliminary cognitive model of the reasoning process of an android.

This book provides a broad overview of the benefits from a Systems Engineering design philosophy in architecting complex systems composed of artificial intelligence (AI), machine learning (ML) and humans situated in chaotic environments. The major topics include emergence, verification and validation of systems using AI/ML and human systems integration to develop robust and effective human-machine teams—where the machines may have varying degrees of autonomy due to the sophistication of their embedded AI/ML. The chapters not only describe what has been learned, but also raise questions that must be answered to further advance the general Science of Autonomy. The science of how humans and machines operate as a team requires insights from, among others, disciplines such as the social sciences, national and international jurisprudence, ethics and policy, and sociology and psychology. The social sciences inform how context is constructed, how trust is affected when humans and machines depend upon each other and how human-machine teams need a shared language of explanation. National and international jurisprudence determine legal responsibilities of non-trivial human-machine failures, ethical standards shape global policy, and sociology provides a basis for understanding team norms across cultures. Insights from psychology may help us to understand the negative impact on humans if AI/ML based machines begin to outperform their human teammates and consequently diminish their value or importance. This book invites professionals and the curious alike to witness a new frontier open as the Science of Autonomy emerges.

This edited research monograph brings together contributions from computer scientists, biologists, and engineers who are engaged with the study of evolution and how it may be applied to solve real-world problems. It also serves as a Festschrift dedicated to Erik D. Goodman, the founding director of the BEACON Center for the Study of Evolution in Action, a pioneering NSF Science and Technology Center headquartered at Michigan State University. The contributing authors are leading experts associated with the center, and they serve in top research and industrial establishments across the US and worldwide. Part I summarizes the history of the BEACON Center, with refreshingly personal chapters that describe Erik's working and leadership style, and others that discuss the development and successes of the center in the context of research funding, projects, and careers. The chapters in Part II deal with the evolution of genomes and evolvability. The contributionsin Part III discuss the evolution of behavior and intelligence. Those in Part IV concentrate on the evolution of communities and collective dynamics. The chapters in Part V discuss selected evolutionary computing applications in domains such as arts and science, automated program repair, cybersecurity, mechatronics, and genomic prediction. Part VI deals with evolution in the classroom, using creativity in research, and responsible conduct in research training. The book concludes with a special chapter from Erik Goodman, a short biography that concentrates on his personal positive influences and experiences throughout his long career in academia and industry.

This book constitutes the refereed post-conference proceedings of the 28th International Workshopon Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms.

This book constitutes the thoroughly refereed post-workshop proceedings for the 26 International Workshop on combinatorial Algorithms, IWOCA 2015, held in Verona, Italy, in October 2015.The 29 revised full papers presented were carefully reviewed and selected from a total of 90 submissions. The topics of the papers include algorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms), algorithms on strings and graphs; applications (bioinformatics, music analysis, networking, and others); combinatorics on words; combinatorial enumeration; combinatorial optimization; complexity theory; computational biology; compression and information retrieval; cryptography and information security; decompositions and combinatorial designs; discrete and computational geometry; graph drawing and labeling; graph theory.

We have added new material to Chapter 3 to give an account of up-to-date programming techniques using accumulators and difference structures. Chapter 8 contains some new information on syntax errors. Operator precedences are now compatible with the most widely-used implementations. We have made further reorganisations and improvements in presentation, and have corrected a number of minor errors. We thank the many people who brought typographical errors in the previous edition to our attention, and we thank A.R.C. for careful proofreading. Cambridge, England W.F.C. January,1987 C.S.M. PREFACE TO THE SECOND EDITION (1984) Since the first publishing of Programming in Prolog in 1981, Prolog has continued to attract an unexpectedly great deal of interest in the computer science community and is now seen as a potential basis for an important new generation of programming languages and systems. We hope that Programming in Prolog has partially satisfied the increasing need for an easy, yet comprehensive introduction to the language as a tool for practical programming. In this second edition we have taken the opportunity to improve the presentation and to correct various minor errors in the original. We thank the many people who have given us suggestions for corrections and improvement. Cambridge, England W.F.C.

Originally published in 1981, this was the first textbook on programming in the Prolog language and is still the definitive introductory text on Prolog. Though many Prolog textbooks have been published since, this one has withstood the test of time because of its comprehensiveness, tutorial approach, and emphasis on general programming applications. Prolog has continued to attract a great deal of interest in the computer science community, and has turned out to be a basis for an important new generation of programming languages and systems for Artificial Intelligence. Since the previous edition of Programming in Prolog, the language has been standardised by the International Organization for Standardization (ISO) and this book has been updated accordingly. The authors have also introduced some new material, clarified some explanations, corrected a number of minor errors, and removed appendices about Prolog systems that are now obsolete.

This book is for people who have done some programming, either in Prolog or in a language other than Prolog, and who can find their way around a reference manual. The emphasis of this book is on a simplified and disciplined methodology for discerning the mathematical structures related to a problem, and then turning these structures into Prolog programs. This book is therefore not concerned about the particular features of the language nor about Prolog programming skills or techniques in general. A relatively pure subset of Prolog is used, which includes the'cut', but no input/output, no assert/retract, no syntactic extensions such as if­ then-else and grammar rules, and hardly any built-in predicates apart from arithmetic operations. I trust that practitioners of Prolog program­ ming who have a particular interest in the finer details of syntactic style and language features will understand my purposes in not discussing these matters. The presentation, which I believe is novel for a Prolog programming text, is in terms of an outline of basic concepts interleaved with worksheets. The idea is that worksheets are rather like musical exercises. Carefully graduated in scope, each worksheet introduces only a limited number of new ideas, and gives some guidance for practising them. The principles introduced in the worksheets are then applied to extended examples in the form of case studies.

The continued popularity of Prolog and oflogic programming in general has called for a new edition in which we have corrected a few minor errors found in the previous edition. Since the previous edition of this book, the development of Prolog has proceeded with much vigour and creativity on the part of hundreds of researchers around the world. For example, the International Conference on Logic Programming will meet in 1995 for the twelfth time; the Internet newsgroup comp. 1 ang. pro log exchanges many messages daily; and there are numerous World-Wide Web resources of interest to Prolog users. It is no longer posssible to track the many books on Prolog and implementations of Prolog that are now available. The Prolog idea has been extended to new languages for manipulating sets of constraints, functional expressions, type hierarchies, and object-oriented programs. And yet throughout this time the Edinburgh Prolog syntax and semantics have served as a standard and as a base of stability. In tum, we hope that this book can continue to serve as an introduction to the language and its use. Cambridge, England W. F. C. July 1994 C. S. M. PREFACE TO THE THIRD EDITION We have added new material to Chapter 3 to give an account of up-to-date programming techniques using accumulators and difference structures. Chapter 8 contains some new information on syntax errors. Operator precedences are now compatible with the most widely-used implementations.

This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Victoria, BC, Canada, in July 2011. The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.