Relational Methods in Computer Science


Book Description

The calculus of relations has been an important component of the development of logic and algebra since the middle of the nineteenth century, when Augustus De Morgan observed that since a horse is an animal we should be able to infer that the head of a horse is the head of an animal. For this, Aristotelian syllogistic does not suffice: We require relational reasoning. George Boole, in his Mathematical Analysis of Logic of 1847, initiated the treatment of logic as part of mathematics, specifically as part of algebra. Quite the opposite conviction was put forward early this century by Bertrand Russell and Alfred North Whitehead in their Principia Mathematica (1910 - 1913): that mathematics was essentially grounded in logic. Logic thus developed in two streams. On the one hand algebraic logic, in which the calculus of relations played a particularly prominent part, was taken up from Boole by Charles Sanders Peirce, who wished to do for the "calculus of relatives" what Boole had done for the calculus of sets. Peirce's work was in turn taken up by Schroder in his Algebra und Logik der Relative of 1895 (the third part of a massive work on the algebra of logic). Schroder's work, however, lay dormant for more than 40 years, until revived by Alfred Tarski in his seminal paper "On the calculus of binary relations" of 1941 (actually his presidential address to the Association for Symbolic Logic).




Ewa Orłowska on Relational Methods in Logic and Computer Science


Book Description

This book is a tribute to Professor Ewa Orłowska, a Polish logician who was celebrating the 60th year of her scientific career in 2017. It offers a collection of contributed papers by different authors and covers the most important areas of her research. Prof. Orłowska made significant contributions to many fields of logic, such as proof theory, algebraic methods in logic and knowledge representation, and her work has been published in 3 monographs and over 100 articles in internationally acclaimed journals and conference proceedings. The book also includes Prof. Orłowska’s autobiography, bibliography and a trialogue between her and the editors of the volume, as well as contributors' biographical notes, and is suitable for scholars and students of logic who are interested in understanding more about Prof. Orłowska’s work.




Relational and Algebraic Methods in Computer Science


Book Description

This book constitutes the proceedings of the 18th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2020, which was due to be held in Palaiseau, France, in April 2020. The conference was cancelled due to the COVID-19 pandemic. The 20 full papers presented together with 3 invited abstracts were carefully selected from 29 submissions. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.




Relational and Algebraic Methods in Computer Science


Book Description

This book constitutes the proceedings of the 16th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2017, held in Lyon, France, in May 2017. The 17 revised full papers and 2 invited papers presented together with 1 invited abstract were carefully selected from 28 submissions. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.




Relational Methods in Computer Science


Book Description

This volume is the post conference proceedings of the 8th International Seminar on Relational Methods in Computer Science (RelMiCS 8), held in conjunction with the 3rd International Workshop on Applications of Kleene Algebra and a COST Action 274 (TARSKI) Workshop. This combined meeting took place in St. Catharines, Ontario, Canada, from February 22 to February 26, 2005.




Relational and Algebraic Methods in Computer Science


Book Description

This book constitutes the proceedings of the 15th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2015, held in Braga, Portugal, in September/October 2015. The 20 revised full papers and 3 invited papers presented were carefully selected from 25 submissions. The papers deal with the theory of relation algebras and Kleene algebras, process algebras; fixed point calculi; idempotent semirings; quantales, allegories, and dynamic algebras; cylindric algebras, and about their application in areas such as verification, analysis and development of programs and algorithms, algebraic approaches to logics of programs, modal and dynamic logics, interval and temporal logics.




Relational and Algebraic Methods in Computer Science


Book Description

This book constitutes the proceedings of the 12 International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011, held in Rotterdam, The Netherlands, in May/June 2011. This conference merges the RelMICS (Relational Methods in Computer Science) and AKA (Applications of Kleene Algebra) conferences, which have been a main forum for researchers who use the calculus of relations and similar algebraic formalisms as methodological and conceptual tools. Relational and algebraic methods and software tools turn out to be useful for solving problems in social choice and game theory. For that reason this conference included a special track on Computational Social Choice and Social Software. The 18 papers included were carefully reviewed and selected from 27 submissions. In addition the volume contains 2 invited tutorials and 5 invited talks.




Relational and Algebraic Methods in Computer Science


Book Description

This book constitutes the proceedings of the 20th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2023, which took place in Augsburg, Germany, during April 3–6, 2023. The 17 papers presented in this book were carefully reviewed and selected from 26 submissions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond. Apart from the submitted articles, this volume features the abstracts of the presentations of the three invited speakers.




Relational Methods for Computer Science Applications


Book Description

This volume addresses all current aspects of relational methods and their applications in computer science. It presents a broad variety of fields and issues in which theories of relations provide conceptual or technical tools. The contributions address such subjects as relational methods in programming, relational constraints, relational methods in linguistics and spatial reasoning, relational modelling of uncertainty. All contributions provide the readers with new and original developments in the respective fields. The reader thus gets an interdisciplinary spectrum of the state of the art of relational methods and implementation-oriented solutions of problems related to these areas.




Relational Methods in Computer Science


Book Description

The calculus of relations has been an important component of the development of logic and algebra since the middle of the nineteenth century, when Augustus De Morgan observed that since a horse is an animal we should be able to infer that the head of a horse is the head of an animal. For this, Aristotelian syllogistic does not suffice: We require relational reasoning. George Boole, in his Mathematical Analysis of Logic of 1847, initiated the treatment of logic as part of mathematics, specifically as part of algebra. Quite the opposite conviction was put forward early this century by Bertrand Russell and Alfred North Whitehead in their Principia Mathematica (1910 - 1913): that mathematics was essentially grounded in logic. Logic thus developed in two streams. On the one hand algebraic logic, in which the calculus of relations played a particularly prominent part, was taken up from Boole by Charles Sanders Peirce, who wished to do for the "calculus of relatives" what Boole had done for the calculus of sets. Peirce's work was in turn taken up by Schroder in his Algebra und Logik der Relative of 1895 (the third part of a massive work on the algebra of logic). Schroder's work, however, lay dormant for more than 40 years, until revived by Alfred Tarski in his seminal paper "On the calculus of binary relations" of 1941 (actually his presidential address to the Association for Symbolic Logic).