Representation Theorems in Computer Science


Book Description

Formal specifications are an important tool for the construction, verification and analysis of systems, since without it is hardly possible to explain whether a system worked correctly or showed an expected behavior. This book proposes the use of representation theorems as a means to develop an understanding of all models of a specification in order to exclude possible unintended models, demonstrating the general methodology with representation theorems for applications in qualitative spatial reasoning, data stream processing, and belief revision. For qualitative spatial reasoning, it develops a model of spatial relatedness that captures the scaling context with hierarchical partitions of a spatial domain, and axiomatically characterizes the resulting relations. It also shows that various important properties of stream processing, such as prefix-determinedness or various factorization properties can be axiomatized, and that the axioms are fulfilled by natural classes of stream functions. The third example is belief revision, which is concerned with the revision of knowledge bases under new, potentially incompatible information. In this context, the book considers a subclass of revision operators, namely the class of reinterpretation operators, and characterizes them axiomatically. A characteristic property of reinterpretation operators is that of dissolving potential inconsistencies by reinterpreting symbols of the knowledge base. Intended for researchers in theoretical computer science or one of the above application domains, the book presents results that demonstrate the use of representation theorems for the design and evaluation of formal specifications, and provide the basis for future application-development kits that support application designers with automatically built representations.




Representation and Invariance of Scientific Structures


Book Description

A fundamental reason for using formal methods in the philosophy of science is the desirability of having a fixed frame of reference that may be used to organize the variety of doctrines at hand. This book—Patrick Suppes's major work, and the result of several decades of research—examines how set-theoretical methods provide such a framework, covering issues of axiomatic method, representation, invariance, probability, mechanics, and language, including research on brain-wave representations of words and sentences. This is a groundbreaking, essential text from a distinguished philosopher.




A Course in Finite Group Representation Theory


Book Description

This graduate-level text provides a thorough grounding in the representation theory of finite groups over fields and rings. The book provides a balanced and comprehensive account of the subject, detailing the methods needed to analyze representations that arise in many areas of mathematics. Key topics include the construction and use of character tables, the role of induction and restriction, projective and simple modules for group algebras, indecomposable representations, Brauer characters, and block theory. This classroom-tested text provides motivation through a large number of worked examples, with exercises at the end of each chapter that test the reader's knowledge, provide further examples and practice, and include results not proven in the text. Prerequisites include a graduate course in abstract algebra, and familiarity with the properties of groups, rings, field extensions, and linear algebra.




Relational and Algebraic Methods in Computer Science


Book Description

This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 13, held in Cambridge, UK, in September 2012. The 23 revised full papers presented were carefully selected from 39 submissions in the general area of relational and algebraic methods in computer science, adding special focus on formal methods for software engineering, logics of programs and links with neighboring disciplines. The papers are structured in specific fields on applications to software specification and correctness, mechanized reasoning in relational algebras, algebraic program derivation, theoretical foundations, relations and algorithms, and properties of specialized relations.




Mathematical Foundations of Computer Science 1995


Book Description

This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.




Relations and Kleene Algebra in Computer Science


Book Description

The book constitutes the joint refereed proceedings of the 10th International Conference on Relational Methods in Computer Science, RelMiCS 2008, and the 5th International Conference on Applications of Kleene Algebras, AKA 2008, held in Manchester, UK in April 2008. The 26 revised full papers presented together with 2 invited papers were carefully reviewed and selected from numerous submissions. The papers describe the calculus of relations and similar algebraic formalisms as methodological and conceptual tools with special focus on formal methods for software engineering, logics of programs and links to neighbouring disciplines. Their scope comprises relation algebra, fixpoint calculi, semiring theory, iteration algebras, process algebras and dynamic algebras. Applications include formal algebraic modeling, the semantics, analysis and development of programs, formal language theory and combinatorial optimization.




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 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.




Logic, Language, and Computation


Book Description

This book constitutes the refereed proceedings of the 11th International Tbilisi Symposium on Logic, Language and Computation, TbiLLC 2015, held in Tbilisi, Georgia, in September 2015. The 18 papers in this book were selected from the invited submissions of full, revised versions of the 37 short papers presented at the conference, and one invited talk. Each paper has passed through a rigorous peer-review process before being accepted for publication. The biennial conference series and the proceedings are representative of the aims of the organizing institutes: to promote the integrated study of logic, information and language. The scientific program consisted of tutorials, invited lectures, contributed talks, and two workshops.




Relations and Kleene Algebra in Computer Science


Book Description

The book constitutes the joint refereed proceedings of the 9th International Conference on Relational Methods in Computer Science, RelMiCS 2006, and the 4th International Workshop on Applications of Kleene Algebras, AKA 2006, held in Manchester, UK in August/September 2006. The 25 revised full papers presented together with two invited papers and the abstract of an invited talk were carefully reviewed and selected from 44 submissions.