Hasil Pencarian  ::  Simpan CSV :: Kembali

"This Festschrift volume is published in honor of Dexter Kozen on the occasion of his 60th birthday. Dexter Kozen has been a leader in the development of Kleene Algebras (KAs). The contributions in this volume reflect the breadth of his work and influence. The volume includes 19 full papers related to Dexter Kozen's research. They deal with coalgebraic methods, congruence closure, the completeness of various programming logics, decision procedure for logics, alternation, algorithms and complexity, and programming languages and program analysis. "

"This festschrift volume, published in honor of Bernd Krämer on the occasion of his 65th birthday, contains 11 contributions by close scientific companions. Covering topics like Petri nets and theoretical computer science, software and service engineering, cloud computing, and e-learning, the articles presented span the range of the scientific work of Bernd Krämer."

"The festschrift includes several reminiscences and introductory essays describing Professor Sergot's achievements, followed by a series of articles on logic programming, temporal reasoning and action languages, artificial intelligence and law, deontic logic and norm-governed systems, and logical approaches to policies."

"This festschrift contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. "

"The research interests of Cristian Calude are reflected in the topics covered by the 32 papers included in this book, namely, algorithmic information theory, algorithms, automata and formal languages, computing and natural sciences, computability and applications, logic and applications, philosophy of computation, physics and computation, and unconventional models of computation. They have been organized into four parts. The first part consists of papers discussing his life achievements. This is followed by papers in the three general areas of complexity, computability, and randomness; physics, philosophy (and logic), and computation; and algorithms, automata, and formal models (including unconventional computing)."

"This festschrift volume, published in honor of Jürgen Dassow on the occasion of his 65th birthday, contains 19 contributions by leading researchers, colleagues, and friends. Covering topics on picture languages, cooperating distributed systems of automata, quantum automata, grammar systems, online computation, word equations, biologically motivated formal systems, controlled derivations, descriptional complexity, as well as 'classical' topics of automata and language theory, the articles presented span the range of the scientific work of Jürgen Dassow."

"This Festschrift volume, published in honor of Jean-Jaques Quisquater on the occasion of his 65th Birthday, contains 33 papers from colleagues all over the world and deals with all the fields to which Jean-Jaques dedicated his work during his academic career. Focusing on personal tributes and re-visits of Jean-Jaques Quisquater's legacy, the volume addresses the following central topics: symmetric and asymmetric cryptography, side-channels attacks, hardware and implementations, smart cards, and information security. In addition there are four more contributions just "as diverse as Jean-Jacques' scientific interests"."

"This monograph deals with aspects of the computer programming process that involve techniques derived from mathematical logic. The author focuses on proving that a given program produces the intended result whenever it halts, that a given program will eventually halt, that a given program is partially correct and terminates, and that a system of rewriting rules always halts. Also, the author describes the intermediate behavior of a given program, and discusses constructing a program to meet a given specification."

"We specifically focus on the following issues: 1. An important question when modeling continuous optimization problems is how we should handle overconstrained problems, i.e. problems that have no solutions. 2. Users of a programming language often want a rich language that is easy to model in. 3. A well-known technique for solving ASP consists of translating a program P to a propositional theory whose models exactly correspond to the answer sets of P. "