Andrzej Szałas – författare
Visar alla böcker från författaren Andrzej Szałas. Handla med fri frakt och snabb leverans.
8 produkter
8 produkter
1 915 kr
Skickas inom 10-15 vardagar
Originally published in 1995 Time and Logic examines understanding and application of temporal logic, presented in computational terms. The emphasis in the book is on presenting a broad range of approaches to computational applications. The techniques used will also be applicable in many cases to formalisms beyond temporal logic alone, and it is hoped that adaptation to many different logics of program will be facilitated. Throughout, the authors have kept implementation-orientated solutions in mind. The book begins with an introduction to the basic ideas of temporal logic. Successive chapters examine particular aspects of the temporal theoretical computing domain, relating their applications to familiar areas of research, such as stochastic process theory, automata theory, established proof systems, model checking, relational logic and classical predicate logic. This is an essential addition to the library of all theoretical computer scientists. It is an authoritative work which will meet the needs both of those familiar with the field and newcomers to it.
511 kr
Skickas inom 10-15 vardagar
Originally published in 1995 Time and Logic examines understanding and application of temporal logic, presented in computational terms. The emphasis in the book is on presenting a broad range of approaches to computational applications. The techniques used will also be applicable in many cases to formalisms beyond temporal logic alone, and it is hoped that adaptation to many different logics of program will be facilitated. Throughout, the authors have kept implementation-orientated solutions in mind. The book begins with an introduction to the basic ideas of temporal logic. Successive chapters examine particular aspects of the temporal theoretical computing domain, relating their applications to familiar areas of research, such as stochastic process theory, automata theory, established proof systems, model checking, relational logic and classical predicate logic. This is an essential addition to the library of all theoretical computer scientists. It is an authoritative work which will meet the needs both of those familiar with the field and newcomers to it.
Second-order Quantifier Elimination
Foundations, Computational Aspects and Applications
Häftad, Engelska, 2008
287 kr
Skickas inom 5-8 vardagar
2 125 kr
Skickas inom 10-15 vardagar
1. 1 Background The basis for the material in this book centers around research done in an ongoing long-term project which focuses on the development of highly au- 1 tonomousunmannedaerialvehiclesystems. Theactualplatformwhichserves as a case study for the research in this book will be described in detail later in this chapter. Before doing that, a brief background of the motivations - hind this research will be provided. One of the main research topics in the project is knowledge representation and reasoning and its use in Uav pl- forms. A very strong constraint has been placed on the nature of research done in the project where theoretical results, to the greatest extent possible, should serve as a basis for tractable reasoning mechanisms for use in a fully deployed autonomous Uav operating under soft real-time constraints asso- ated with the types of mission scenarios envisioned. Considering that much of the work with knowledge representation in this context focuses on application domains where one can only hope for an incomplete characterization of such domains, this methodological constraint has proven to be quite challenging since, in essence, the focus is on tractable approximate and nonmonotonic reasoning systems. As is well known, until recently, nonmonotonic formalisms have had a notorious reputation for lack of tractable and scalable reasoning systems.
Mathematical Foundations of Computer Science 1996
21st International Symposium, MFCS' 96, Crakow, Poland, September 2 - 6, 1996. Proceedings
Häftad, Engelska, 1996
1 098 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996.The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.
Del 202 - Studies in Fuzziness and Soft Computing
Knowledge Representation Techniques
A Rough Set Approach
Häftad, Engelska, 2010
2 125 kr
Skickas inom 10-15 vardagar
1. 1 Background The basis for the material in this book centers around research done in an ongoing long-term project which focuses on the development of highly au- 1 tonomousunmannedaerialvehiclesystems. Theactualplatformwhichserves as a case study for the research in this book will be described in detail later in this chapter. Before doing that, a brief background of the motivations - hind this research will be provided. One of the main research topics in the project is knowledge representation and reasoning and its use in Uav pl- forms. A very strong constraint has been placed on the nature of research done in the project where theoretical results, to the greatest extent possible, should serve as a basis for tractable reasoning mechanisms for use in a fully deployed autonomous Uav operating under soft real-time constraints asso- ated with the types of mission scenarios envisioned. Considering that much of the work with knowledge representation in this context focuses on application domains where one can only hope for an incomplete characterization of such domains, this methodological constraint has proven to be quite challenging since, in essence, the focus is on tractable approximate and nonmonotonic reasoning systems. As is well known, until recently, nonmonotonic formalisms have had a notorious reputation for lack of tractable and scalable reasoning systems.
650 kr
Skickas inom 5-8 vardagar
Del 65 - Studies in Fuzziness and Soft Computing
Relational Methods for Computer Science Applications
Häftad, Engelska, 2012
552 kr
Skickas inom 10-15 vardagar
The origins of relational theories can be found in the work of three 19th cen- tury mathematicians: Augustus de Morgan (1864, On the syllogism IV and on the logic of relations), Charles Sanders Peirce (1882, Brief description of the algebra of relatives) and Ernst Schroder (1895, Vorlesungen iiber die Al- gebra und Logik der Relative). The modern origins of the theory of relations are due to Alfred Tarski (14 January 1902, Warsaw -26 October 1983, Berke- ley). His paper' On the calculus of Relations' published in 1941 gave rise to an algebraic theory of relations which is still extensively studied. In the 1970s, the applications of relational theories to various applied sciences emerged. Nowadays relational theories are experiencing a period of extensive development, with the emergence of new theories and systems allow- ing better understanding and better use of such theories.Relational theories have been used, among others, in the following fields: * Theory of programs: program specification, program verification, mod- elling concurrency, process calculi, semantics of programming languages; * Databases: relational databases, tabular methods, dependency theory, rectangular and difunctional decomposition of databases; * Computational linguistics: relational semantics of natural languages, re- lational grammars, Lambek calculus; * Spatial reasoning: modelling of relationships between space regions; * Handling uncertainty: fuzzy relations, many-valued relations, information relations. Indeed, the concept of relation emerges again and again throughout computer science, from its theoretical foundations to very practical implementations.