Computer Science Foundations and Applied Logic – serie
Visar alla böcker i serien Computer Science Foundations and Applied Logic. Handla med fri frakt och snabb leverans.
20 produkter
20 produkter
Häftad, Engelska, 2024
885 kr
Skickas inom 5-8 vardagar
This unique textbook, in contrast to a standard logic text, provides the reader with a logic that actually can be used in practice to express and reason about mathematical ideas.The book is an introduction to simple type theory, a classical higher-order version of predicate logic that extends first-order logic. It presents a practice-oriented logic called Alonzo that is based on Alonzo Church's formulation of simple type theory known as Church's type theory. Unlike traditional predicate logics, Alonzo admits undefined expressions. The book illustrates, using Alonzo, how simple type theory is suited ideally for reasoning about mathematical structures and constructing libraries of mathematical knowledge.Topics and features:Offers the first book-length introduction to simple type theory as a predicate logicProvides the reader with a logic that is close to mathematical practicePresents the tools needed to build libraries of mathematical knowledgeEmploys two semantics, one for mathematics and one for logicEmphasizes the model-theoretic view of predicate logicIncludes several important topics, such as definite description and theory morphisms, not usually found in standard logic textbooksAimed at students of computing and mathematics at the graduate or upper-undergraduate level, this book is also well-suited for mathematicians, computing professionals, engineers, and scientists who need a practical logic for expressing and reasoning about mathematical ideas.William M. Farmer is a Professor in the Department of Computing and Software at McMaster University in Hamilton, Ontario, Canada.
Inbunden, Engelska, 2023
653 kr
Skickas inom 10-15 vardagar
Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal.Topics and features:· All other books in this field focus on the mathematical results, rather than on the algorithms.· There are many exercises here, most of which relate to details of the algorithms.· The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature.· The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms.· In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas.Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it.Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.
Häftad, Engelska, 2024
653 kr
Skickas inom 10-15 vardagar
Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal.Topics and features:· All other books in this field focus on the mathematical results, rather than on the algorithms.· There are many exercises here, most of which relate to details of the algorithms.· The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature.· The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms.· In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas.Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it.Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.
Inbunden, Engelska, 2024
2 375 kr
Skickas inom 5-8 vardagar
This is the first book that sums up test-related modeling of digital circuits and systems by a new structural-decision-diagrams model. The model represents structural and functional information jointly and opens a new area of research.The book introduces and discusses applications of two types of structural decision diagrams (DDs): low-level, structurally synthesized binary DDs (SSBDDs) and high-level DDs (HLDDs) that enable diagnostic modeling of complex digital circuits and systems.Topics and features:Provides the definition, properties and techniques for synthesis, compression and optimization of SSBDDs and HLDDsProvides numerous working examples that illustrate the key points of the textDescribes applications of SSBDDs and HLDDs for various electronic design automation (EDA) tasks, such as logic-level fault modeling and simulation, multi-valued simulation, timing-critical path identification, and test generationDiscusses the advantages of the proposed model to traditional binary decision diagrams and other traditional design representationsCombines SSBDDs with HLDDs for multi-level representation of digital systems for enabling hierarchical and cross-level solving of complex test-related tasksThis unique book is aimed at researchers working in the fields of computer science and computer engineering, focusing on test, diagnosis and dependability of digital systems. It can also serve as a reference for graduate- and advanced undergraduate-level computer engineering and electronics courses.Three authors are affiliated with the Dept. of Computer Systems at the Tallinn University of Technology, Estonia: Raimund Ubar is a retired Professor, Jaan Raik and Maksim Jenihhin are tenured Professors. Artur Jutman, PhD, is a researcher at the same university and the CEO of Testonica Lab Ltd., Estonia.
Häftad, Engelska, 2025
2 375 kr
Skickas inom 10-15 vardagar
This is the first book that sums up test-related modeling of digital circuits and systems by a new structural-decision-diagrams model. The model represents structural and functional information jointly and opens a new area of research.The book introduces and discusses applications of two types of structural decision diagrams (DDs): low-level, structurally synthesized binary DDs (SSBDDs) and high-level DDs (HLDDs) that enable diagnostic modeling of complex digital circuits and systems.Topics and features:Provides the definition, properties and techniques for synthesis, compression and optimization of SSBDDs and HLDDsProvides numerous working examples that illustrate the key points of the textDescribes applications of SSBDDs and HLDDs for various electronic design automation (EDA) tasks, such as logic-level fault modeling and simulation, multi-valued simulation, timing-critical path identification, and test generationDiscusses the advantages of the proposed model to traditional binary decision diagrams and other traditional design representationsCombines SSBDDs with HLDDs for multi-level representation of digital systems for enabling hierarchical and cross-level solving of complex test-related tasksThis unique book is aimed at researchers working in the fields of computer science and computer engineering, focusing on test, diagnosis and dependability of digital systems. It can also serve as a reference for graduate- and advanced undergraduate-level computer engineering and electronics courses.Three authors are affiliated with the Dept. of Computer Systems at the Tallinn University of Technology, Estonia: Raimund Ubar is a retired Professor, Jaan Raik and Maksim Jenihhin are tenured Professors. Artur Jutman, PhD, is a researcher at the same university and the CEO of Testonica Lab Ltd., Estonia.
Inbunden, Engelska, 2024
922 kr
Skickas inom 10-15 vardagar
Petri nets model concurrent and distributed systems where active components communicate through the production and absorption of various kinds of resources. Although the dynamic properties of such systems may be very complex, they may sometimes be connected to the static structure of a Petri net. Many properties are decidable, but their complexity may be huge. It is often opportune to restrict oneself to classes of systems, to partial algorithms, and to similar but simpler properties. Instead of analysing a given system, it is also possible to search for a system satisfying some desired properties by construction. This comprehensive textbook/reference presents and discusses these issues in-depth in the context of one of the most fundamental Petri net models, called place/transition nets. The presentation is fortified by means of many examples and worked exercises. Among topics addressed: • In which order may actions may be generated and scheduled? • What states and configurations may be reached in a concurrent system? • Which interesting classes of systems can be analysed relatively efficiently? • Is it possible to synthesise a system of some class from its behaviour? • How can systems be represented algebraically, compositionally, and concisely? This unique text, based on introductory as well as on advanced courses on distributed systems, will serve as an invaluable guide for students and (future) researchers interested in theoretical—as well as in practical—aspects of Petri nets and related system models. Eike Best has been a full professor (now retired) affiliated to Carl von Ossietzky Universität Oldenburg, Germany. Raymond Devillers has been a full professor (now retired) affiliated to Université Libre de Bruxelles, Belgium. The authors have a long record as collaborators in the fields of Petri nets and the semantics of concurrency.
Häftad, Engelska, 2025
653 kr
Skickas inom 10-15 vardagar
Petri nets model concurrent and distributed systems where active components communicate through the production and absorption of various kinds of resources. Although the dynamic properties of such systems may be very complex, they may sometimes be connected to the static structure of a Petri net. Many properties are decidable, but their complexity may be huge. It is often opportune to restrict oneself to classes of systems, to partial algorithms, and to similar but simpler properties. Instead of analysing a given system, it is also possible to search for a system satisfying some desired properties by construction. This comprehensive textbook/reference presents and discusses these issues in-depth in the context of one of the most fundamental Petri net models, called place/transition nets. The presentation is fortified by means of many examples and worked exercises. Among topics addressed: • In which order may actions may be generated and scheduled? • What states and configurations may be reached in a concurrent system? • Which interesting classes of systems can be analysed relatively efficiently? • Is it possible to synthesise a system of some class from its behaviour? • How can systems be represented algebraically, compositionally, and concisely? This unique text, based on introductory as well as on advanced courses on distributed systems, will serve as an invaluable guide for students and (future) researchers interested in theoretical—as well as in practical—aspects of Petri nets and related system models. Eike Best has been a full professor (now retired) affiliated to Carl von Ossietzky Universität Oldenburg, Germany. Raymond Devillers has been a full professor (now retired) affiliated to Université Libre de Bruxelles, Belgium. The authors have a long record as collaborators in the fields of Petri nets and the semantics of concurrency.
Inbunden, Engelska, 2024
783 kr
Skickas inom 5-8 vardagar
Frama-C is a popular open-source toolset for analysis and verification of C programs, largely used for teaching, experimental research, and industrial applications.With the growing complexity and ubiquity of modern software, there is increasing interest in code analysis tools at various levels of formalization to ensure safety and security of software products. Acknowledging the fact that no single technique will ever be able to fit all software verification needs, the Frama-C platform features a wide set of plug-ins that can be used or combined for solving specific verification tasks. This guidebook presents a large panorama of basic usages, research results, and concrete applications of Frama-C since the very first open-source release of the platform in 2008. It covers the ACSL specification language, core verification plug-ins, advanced analyses and their combinations, key ingredients for developing new plug-ins, as well as successful industrial case studies in which Frama-C has helped engineers verify crucial safety or security properties. Topics and features:* Gentle, example-based introduction to software specification and verification * Wide panorama of state-of-the-art specification and analysis techniques * Step-by-step guide to develop your own, tailor-made analysis on top of the platform* Inspiring success stories of Frama-C deployment on industrial code* More than 15 years of R&D on analysis and verification of C codeThis book is firmly rooted on the practice of software analysis, with numerous examples, exercises and application guidelines. As such, it is particularly well suited for software verification practitioners wishing to deploy verification on their code, as well as for undergraduate students with little or no experience in code analysis techniques. More advanced sections on the theoretical underpinnings of the analyzers will be of interest for graduate students and researchers.Nikolai Kosmatov is a Senior Researcher at Thales Research & Technology, France. Virgile Prevosto is a Senior Researcher and Julien Signoles is a Research Director, both at Université Paris-Saclay, CEA, List, France.
Häftad, Engelska, 2025
545 kr
Skickas inom 10-15 vardagar
Frama-C is a popular open-source toolset for analysis and verification of C programs, largely used for teaching, experimental research, and industrial applications.With the growing complexity and ubiquity of modern software, there is increasing interest in code analysis tools at various levels of formalization to ensure safety and security of software products. Acknowledging the fact that no single technique will ever be able to fit all software verification needs, the Frama-C platform features a wide set of plug-ins that can be used or combined for solving specific verification tasks. This guidebook presents a large panorama of basic usages, research results, and concrete applications of Frama-C since the very first open-source release of the platform in 2008. It covers the ACSL specification language, core verification plug-ins, advanced analyses and their combinations, key ingredients for developing new plug-ins, as well as successful industrial case studies in which Frama-C has helped engineers verify crucial safety or security properties. Topics and features:* Gentle, example-based introduction to software specification and verification * Wide panorama of state-of-the-art specification and analysis techniques * Step-by-step guide to develop your own, tailor-made analysis on top of the platform* Inspiring success stories of Frama-C deployment on industrial code* More than 15 years of R&D on analysis and verification of C codeThis book is firmly rooted on the practice of software analysis, with numerous examples, exercises and application guidelines. As such, it is particularly well suited for software verification practitioners wishing to deploy verification on their code, as well as for undergraduate students with little or no experience in code analysis techniques. More advanced sections on the theoretical underpinnings of the analyzers will be of interest for graduate students and researchers.Nikolai Kosmatov is a Senior Researcher at Thales Research & Technology, France. Virgile Prevosto is a Senior Researcher and Julien Signoles is a Research Director, both at Université Paris-Saclay, CEA, List, France.
Inbunden, Engelska, 2024
2 160 kr
Skickas inom 10-15 vardagar
This unique book offers an introductory course on category theory, which became a working language in algebraic geometry and number theory in the 1950s and began to spread to logic and computer science soon after it was created.Offering excellent use of helpful examples in Haskell, the work covers (among other things) concepts of functors, natural transformations, monads, adjoints, universality, category equivalence, and many others. The main goal is to understand the Yoneda lemma, which can be used to reverse-engineer the implementation of a function. Later chapters offer more insights into computer science, including computation with output, nondeterministic computation, and continuation passing. Topics and features:Contains rigorous mathematical arguments to support the theoryProvides numerous Haskell code-implementing examplesEngages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small piecesOffers insights into category theory to quantum computing and the foundation of computing disciplineServes as a preparatory course for monoidal categories and higher categoriesThe work will be useful to undergraduate students in computer science who have enough background in college mathematics such as linear algebra and basics in Haskell polymorphic functions. Further, it will appeal to graduate students and researchers in computing disciplines who want to newly acquire serious knowledge of category theory.
Häftad, Engelska, 2025
1 514 kr
Skickas inom 10-15 vardagar
This unique book offers an introductory course on category theory, which became a working language in algebraic geometry and number theory in the 1950s and began to spread to logic and computer science soon after it was created.Offering excellent use of helpful examples in Haskell, the work covers (among other things) concepts of functors, natural transformations, monads, adjoints, universality, category equivalence, and many others. The main goal is to understand the Yoneda lemma, which can be used to reverse-engineer the implementation of a function. Later chapters offer more insights into computer science, including computation with output, nondeterministic computation, and continuation passing. Topics and features:Contains rigorous mathematical arguments to support the theoryProvides numerous Haskell code-implementing examplesEngages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small piecesOffers insights into category theory to quantum computing and the foundation of computing disciplineServes as a preparatory course for monoidal categories and higher categoriesThe work will be useful to undergraduate students in computer science who have enough background in college mathematics such as linear algebra and basics in Haskell polymorphic functions. Further, it will appeal to graduate students and researchers in computing disciplines who want to newly acquire serious knowledge of category theory.
Inbunden, Engelska, 2025
2 160 kr
Skickas inom 10-15 vardagar
Multi-valued and fuzzy logics provide mathematical and computational tools for handling imperfect information and decision-making with rational collective reasoning and irrational individual judgements. The suggested implementation of multi-valued logics is based on the uninorm and absorbing norm with generating functions defined by probability distributions. Natural extensions of these logics result in non-commutative and non-distributive logics. In addition to Boolean truth values, these logics handle subjective truth and false values and model irrational decisions. Dynamics of decision-making are specified by the subjective Markov process and learning – by neural network with extended Tsetlin neurons. Application of the suggested methods is illustrated by modelling of irrational economic decisions and biased reasoning in the wisdom-of-the-crowd method, and by control of mobile robots and navigation of their groups.Topics and features:Bridges the gap between fuzzy and probability methodsIncludes examples in the field of machine-learning and robots’ controlDefines formal models of subjective judgements and decision-makingPresents practical techniques for solving non-probabilistic decision-making problemsInitiates further research in non-commutative and non-distributive logicsThe book forms a basis for theoretical studies and practice of decision-making under uncertainty and will be useful for computer scientists and mathematicians interested in multi-valued and fuzzy logic, as well as for engineers working in the field of data mining and data analysis.
Häftad, Engelska, 2026
1 514 kr
Skickas inom 10-15 vardagar
Multi-valued and fuzzy logics provide mathematical and computational tools for handling imperfect information and decision-making with rational collective reasoning and irrational individual judgements. The suggested implementation of multi-valued logics is based on the uninorm and absorbing norm with generating functions defined by probability distributions. Natural extensions of these logics result in non-commutative and non-distributive logics. In addition to Boolean truth values, these logics handle subjective truth and false values and model irrational decisions. Dynamics of decision-making are specified by the subjective Markov process and learning – by neural network with extended Tsetlin neurons. Application of the suggested methods is illustrated by modelling of irrational economic decisions and biased reasoning in the wisdom-of-the-crowd method, and by control of mobile robots and navigation of their groups.Topics and features:Bridges the gap between fuzzy and probability methodsIncludes examples in the field of machine-learning and robots’ controlDefines formal models of subjective judgements and decision-makingPresents practical techniques for solving non-probabilistic decision-making problemsInitiates further research in non-commutative and non-distributive logicsThe book forms a basis for theoretical studies and practice of decision-making under uncertainty and will be useful for computer scientists and mathematicians interested in multi-valued and fuzzy logic, as well as for engineers working in the field of data mining and data analysis.
Inbunden, Engelska, 2026
707 kr
Skickas inom 10-15 vardagar
Fault tree analysis is key tool in risk analysis. It is a widely used industry standard with applications in amongst others, the aerospace, automotive, chemical and nuclear industries.Society depends on complex engineering systems such as (nuclear) power plants, airplanes, and data centers, and this dependency is only increasing with developments like smart grids and self-driving cars. In this light, risk analysis is essential to ensure that these systems are reliable. Fault tree analysis is a powerful, commonly used tool for such risk analysis. This book provides a comprehensive overview of what fault trees are and how they are applied, looking at their role in risk management, illustrating techniques for their construction, and describing their analysis in both practical and mathematical terms.Topics and features:Delivers a crystal-clear overview of techniques for building and analyzing fault treesOffers numerous illustrative examples of methods and industry applicationsProvides solid mathematical descriptions for exact and approximate analysisIncludes an overview of modern extensions of fault treesExamines and explains the whole fault tree analysis process, including the application of resultsWith its comprehensive overview of the practice of fault tree analysis, this book is eminently suitable for industrial and academic professionals in risk management. Furthermore, the overview of analysis techniques will be of great interest to researchers working to advance the field.
Inbunden, Engelska, 2026
868 kr
Skickas inom 11-20 vardagar
Proof assistants are computer programs that help users formally describe mathematical statements and proofs, making them amenable to mechanical checking. Today they are used to verify operating systems, compilers, and cryptographic protocols, as well as landmark results in mathematics such as the Feit-Thompson theorem or the Kepler conjecture. Contemporary proof assistants rely on a sophisticated interaction between theoretical investigations in metamathematics and the efficient implementation of a portfolio of algorithms, without which these systems would not usable on a large scale. During the last decade, the use of proof assistants has grown steadily, and they are now at the same time a research topic in its own right and a tool for researchers in other domains. Yet no reference book is available today that covers the entire domain. This book is an introduction and reference for the various topics related to the underlying logical formalisms, architectures, and applications.The main audience is graduate students entering the field of interactive theorem proving, the secondary audience is more established researchers in computer science, mathematics, and philosophy, as well as practicing engineers, engaged with proof assistants.
Inbunden, Engelska, 2025
868 kr
Skickas inom 10-15 vardagar
This unique textbook, in contrast to a standard logic text, provides the reader with a logic that can be used in practice to express and reason about mathematical ideas. The book is an introduction to simple type theory, a classical higher-order version of predicate logic that extends first-order logic. It presents a practice-oriented logic called Alonzo that is based on Alonzo Church's formulation of simple type theory known as Church's type theory. Unlike traditional predicate logics, Alonzo admits undefined expressions. The book illustrates using Alonzo how simple type theory is suited ideally for reasoning about mathematical structures and constructing libraries of mathematical knowledge. For this second edition, more than 400 additions, corrections, and improvements have been made, including a new chapter on inductive sets and types.Topics and features:· Offers the first book-length introduction to simple type theory as a predicate logic· Provides the reader with a logic that is close to mathematical practice· Includes a module system for building libraries of mathematical knowledge· Employs two semantics, one for mathematics and one for logic· Emphasizes the model-theoretic view of predicate logic· Presents several important topics, such as definite description and theory morphisms, not usually found in standard logic textbooksAimed at students of mathematics and computing at the graduate or upper-undergraduate level, this book is well suited for mathematicians, computing professionals, engineers, and scientists who need a practical logic for expressing and reasoning about mathematical ideas.William M. Farmer is a Professor in the Department of Computing and Software at McMaster University in Hamilton, Ontario, Canada.
Häftad, Engelska, 2026
653 kr
Skickas inom 10-15 vardagar
This unique textbook, in contrast to a standard logic text, provides the reader with a logic that can be used in practice to express and reason about mathematical ideas. The book is an introduction to simple type theory, a classical higher-order version of predicate logic that extends first-order logic. It presents a practice-oriented logic called Alonzo that is based on Alonzo Church's formulation of simple type theory known as Church's type theory. Unlike traditional predicate logics, Alonzo admits undefined expressions. The book illustrates using Alonzo how simple type theory is suited ideally for reasoning about mathematical structures and constructing libraries of mathematical knowledge. For this second edition, more than 400 additions, corrections, and improvements have been made, including a new chapter on inductive sets and types.Topics and features:· Offers the first book-length introduction to simple type theory as a predicate logic· Provides the reader with a logic that is close to mathematical practice· Includes a module system for building libraries of mathematical knowledge· Employs two semantics, one for mathematics and one for logic· Emphasizes the model-theoretic view of predicate logic· Presents several important topics, such as definite description and theory morphisms, not usually found in standard logic textbooksAimed at students of mathematics and computing at the graduate or upper-undergraduate level, this book is well suited for mathematicians, computing professionals, engineers, and scientists who need a practical logic for expressing and reasoning about mathematical ideas.William M. Farmer is a Professor in the Department of Computing and Software at McMaster University in Hamilton, Ontario, Canada.
Inbunden, Engelska, 2025
922 kr
Skickas inom 10-15 vardagar
This book presents an overview of causal discovery, an emergent field with important developments in the last few years, and multiple applications in several fields.The book is divided into three parts. The first part provides the necessary background on causal graphical models and causal reasoning. The second describes the main algorithms and techniques for causal discovery: (a) causal discovery from observational data, (b) causal discovery from interventional data, (c) causal discovery from temporal data, and (d) causal reinforcement learning. The third part provides several examples of causal discovery in practice, including applications in biomedicine, social sciences, artificial intelligence and robotics.Topics and features:Includes the necessary background material: a review of probability and graph theory, Bayesian networks, causal graphical models and causal reasoningCovers the main types of causal discovery: learning from observational data, learning from interventional data, and learning from temporal dataIllustrates the application of causal discovery in practical problemsIncludes some of the latest developments in the field, such as continuous optimization, causal event networks, causal discovery under subsampling, subject specific causal models, and causal reinforcement learningProvides chapter exercises, including suggestions for research and programming projectsThis book can be used as a textbook for an advanced undergraduate or a graduate course on causal discovery for students of computer science, engineering, social sciences, etc. It can also be used as a complement to a course on causality, together with another text on causal reasoning. It could also serve as a reference book for professionals that want to apply causal models in different areas, or anyone who is interested in knowing the basis of these techniques. The intended audience are students and professionals in computer science, statistics andengineering who want to know the principles of causal discovery and / or applied them in differentdomains. It could also be of interest to students and professionals in other areas who want to applycausal discovery, for instance in medicine and economics.
Inbunden, Engelska, 2026
1 729 kr
Skickas inom 5-8 vardagar
Schemata are formal tools for describing inductive reasoning. They opened a new area in the analysis of inductive proofs.The book introduces schemata for first-order terms, first-order formulas and first-order inference systems. Based on general first-order schemata, the cut-elimination-by-resolution (CERES) method—developed around the year 2000—is extended to schematic proofs. This extension requires the development of schematic methods for resolution and unification which are defined in this book. The added value of proof schemata compared to other inductive approaches consists in the extension of Herbrand’s theorem to inductive proofs (in the form of Herbrand systems, which can be constructed effectively). An application to an analysis of mathematical proof is given. The work also contains and extends the newest results on schematic unification and corresponding algorithms.Core topics covered:first-order schematacut-elimination by resolutionpoint transition systemsschematic resolutionHerbrand systemsinductive proof analysisThis volume is the first comprehensive work on first-order schemata and their applications. As such, it will be eminently suitable for researchers and PhD students in logic and computer science either working or with an interest in proof theory, inductive reasoning and automated deduction. Prerequisites are a firm knowledge of first-order logic, basic knowledge of automated deduction and a background in theoretical computer science.Alexander Leitsch and Anela Lolic are affiliated with the Institute of Logic and Computation of the Technische Universität Wien, David M. Cerna with the Czech Academy of Sciences, Institute of Computer Science (Ústav informatiky AV ČR, v.v.i.).
Inbunden, Engelska, 2026
562 kr
Skickas inom 10-15 vardagar
The formal verification of multi-agent systems aimed at proving that such systems meet their specifications has given rise to a very active field of research at the crossroads of formal methods, knowledge representation and artificial intelligence. Alternating-time temporal logics are considered as one of the most popular and influential logical formalisms for strategic reasoning in multi-agent systems and have been introduced by Rajeev Alur, Thomas Henzinger and Orna Kupferman about 25 years ago. This textbook provides a concise presentation of alternating-time temporal logics dedicated to strategic reasoning in multi-agent systems. Dedicated mainly to the model-checking problem, the work examines developments about basic semantical properties of such logics, decision procedures and computational complexity. It provides results for solving optimally the model-checking problem on concurrent game structures by taking advantage of—or adapting proof methods from—temporal logics, games in theoretical computer science and automata theory.Topics and features:Provides a unique teaching resource (typically for M1, M2 or PhD students), suitable for many courses such as Logic in Computer Science, Multi-Agent Systems, Formal Methods and Basics to VerificationFills a gap in the literature by presenting the standard results voluntarily exposed in a pedestrian style, as well as a few more recent results developed in full depth to prepare readers for examining more elaborate logical formalismsIncludes detailed chapter examples, exercises (with solutions at the end), and a wealth of bibliographical references, thereby supporting self-studyOffers a first unified presentation of alternating-time temporal logics in relation to games, automata and complexityThe textbook/guide’s target audience includes master students, PhD students and researchers that wish to have a thorough presentation of such logics and their relationships with automata theory, temporal logics, model-checking, energy games and complexity theory.Stéphane Demri is a CNRS directeur de recherche at the Laboratoire Méthodes Formelles (LMF) and adjunct professor at the Computer Science Department, ENS Paris-Saclay, Gif-sur-Yvette, France.