|
Dov Gabbay
Dov M. Gabbay (, ; born October 26, 1945) is an Israeli logician. He is Augustus De Morgan Professor Emeritus of Logic at the Group of Logic, Language and Computation, Department of Computer Science, King's College London. Work Gabbay has authored over four hundred and fifty research papers and over thirty research monographs. He is editor of several international journals, and of many reference works and handbooks of logic, including the ''Handbook of Philosophical Logic'' (with Franz Guenthner), the ''Handbook of Logic in Computer Science]'' (with Samson Abramsky and T. S. E. Maibaum), and the ''Handbook of Logic in Artificial Intelligence and Logic Programming'' (with C.J. Hogger and J.A. Robinson). He is well-known for pioneering work on logic in computer science and artificial intelligence, especially the application of (executable) temporal logics in computer science, in particular formal verification, the logical foundations of non-monotonic reasoning and artificial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, applied disciplines (including the design and implementation of Computer architecture, hardware and Software engineering, software). Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Royal Society Of Canada
The Royal Society of Canada (RSC; , SRC), also known as the Academies of Arts, Humanities, and Sciences of Canada (French: ''Académies des arts, des lettres et des sciences du Canada''), is the senior national, bilingual council of distinguished Canadian scholars, humanists, scientists, and artists. The primary objective of the RSC is to promote learning and research in the arts, the humanities, and the sciences. The RSC is Canada's national academy. It promotes Canadian research and scholarly accomplishment in both official languages, recognizes academic and artistic excellence, and advises governments, non-governmental organizations, and Canadians on matters of public interest. History In the late 1870s, the Governor General of Canada, John Campbell, 9th Duke of Argyll, John Campbell, Marquis of Lorne, determined that Canada required a cultural institution to promote national scientific research and development. Since that time, succeeding governors general have remained invol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Verification
In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of a system with respect to a certain formal specification or property, using formal methods of mathematics. Formal verification is a key incentive for formal specification of systems, and is at the core of formal methods. It represents an important dimension of analysis and verification in electronic design automation and is one approach to software verification. The use of formal verification enables the highest Evaluation Assurance Level ( EAL7) in the framework of common criteria for computer security certification. Formal verification can be helpful in proving the correctness of systems such as: cryptographic protocols, combinational circuits, digital circuits with internal memory, and software expressed as source code in a programming language. Prominent examples of verified software systems include the CompCert verified C compiler and the seL ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Temporal Logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am ''always'' hungry", "I will ''eventually'' be hungry", or "I will be hungry ''until'' I eat something"). It is sometimes also used to refer to tense logic, a modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, with important contributions by Hans Kamp. It has been further developed by computer scientists, notably Amir Pnueli, and logicians. Temporal logic has found an important application in formal verification, where it is used to state requirements of hardware or software systems. For instance, one may wish to say that ''whenever'' a request is made, access to a resource is ''eventually'' granted, but it is ''never'' granted to two requestors simultaneously. Such a statement can conveniently be expressed in a temporal logic. Motivation Consider the statement "I am hungry". Though it ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Alan Robinson
John Alan Robinson (9 March 1930 – 5 August 2016) was a philosopher, mathematician, and computer scientist. He was a professor emeritus at Syracuse University. Alan Robinson's major contribution is to the foundations of automated theorem proving. His unification algorithm eliminated one source of combinatorial explosion in resolution provers; it also prepared the ground for the logic programming paradigm, in particular for the Prolog language. Robinson received the 1996 Herbrand Award for Distinguished Contributions to Automated Reasoning. Life Robinson was born in Halifax, Yorkshire, England in 1930 and left for the United States in 1952 with a classics degree from Cambridge University. He studied philosophy at the University of Oregon before moving to Princeton University where he received his PhD in philosophy in 1956. He then worked at DuPont as an operations research analyst, where he learned computer programming and taught himself mathematics. He moved to Rice U ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tom Maibaum
Thomas Stephen Edward Maibaum Fellow of the Royal Society of Arts (FRSA) is a computer scientist. Maibaum has a Bachelor of Science (B.Sc.) undergraduate degree in pure mathematics from the University of Toronto, Canada (1970), and a Doctor of Philosophy (Ph.D.) in computer science from Queen Mary and Royal Holloway Colleges, University of London, England (1974). Maibaum has held academic posts at Imperial College, London, King's College London (UK) and McMaster University (Canada). His research interests have concentrated on the theory of specification, together with its application in different contexts, in the general area of software engineering. From 1996 to 2005, he was involved with developing international standards in programming and informatics, as a member of the International Federation for Information Processing (IFIP) IFIP Working Group 2.1 on Algorithmic Languages and Calculi, which specified, maintains, and supports the programming languages ALGOL 60 and ALGOL 6 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Samson Abramsky
Samson Abramsky (born 12 March 1953) is a British computer scientist who is a Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021. Abramsky's early work included contributions to domain theory and the connections thereof with geometric logic. Since then, his work has covered the lazy lambda calculus, strictness analysis, concurrency theory, interaction categories and geometry of interaction, game semantics and quantum computing. Notably, he co-pioneered categorical quantum mechanics. More recently, he has been applying methods from categorical semantics to finite model theory, with applications to descriptive complexity. Education Abramsky was educated at Hasmonean Grammar School for Boys, Hendon and at King's College, Cambridge (BA 1975, MA Philosophy 1979, Diploma in Computer Science) and Queen Mary, University of London (PhD Computer Science 1988, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Franz Guenthner
Franz Guenthner is a German linguist who is a professor of Computational Linguistics at the Center for Information and Language Processing (CIS) at the Ludwig-Maximilians-Universität (LMU) in Munich, Germany. His background is in philosophy and linguistics. Guenthner's research interests include computational linguistics, and has collaborated to the development of a number of online search platforms since 1996, including AltaVista, Fast Search and Transfer (now purchased by Microsoft), and JobaNova. He was a professor of General and Computational Linguistics at the University of Tübingen (1977–1989) before joining the LMU in 1990. His research interests include all areas of text processing and in particular the transformation of textual corpora in lexical and grammatical representations (i.e. computationally deployable electronic dictionaries and local grammars). He was also instrumental in the design and realization of a number of search engines, in particular of the first la ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, applied disciplines (including the design and implementation of Computer architecture, hardware and Software engineering, software). Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computation
A computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Common examples of computation are mathematical equation solving and the execution of computer algorithms. Mechanical or electronic devices (or, historically, people) that perform computations are known as ''computers''. Computer science is an academic field that involves the study of computation. Introduction The notion that mathematical statements should be 'well-defined' had been argued by mathematicians since at least the 1600s, but agreement on a suitable definition proved elusive. A candidate definition was proposed independently by several mathematicians in the 1930s. The best-known variant was formalised by the mathematician Alan Turing, who defined a well-defined statement or calculation as any statement that could be expressed in terms of the initialisation parameters of a Turing machine. Other (mathematically equivalent) definitions include Alonzo Church's '' lambda-defin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Language
Language is a structured system of communication that consists of grammar and vocabulary. It is the primary means by which humans convey meaning, both in spoken and signed language, signed forms, and may also be conveyed through writing system, writing. Human language is characterized by its cultural and historical diversity, with significant variations observed between cultures and across time. Human languages possess the properties of Productivity (linguistics), productivity and Displacement (linguistics), displacement, which enable the creation of an infinite number of sentences, and the ability to refer to objects, events, and ideas that are not immediately present in the discourse. The use of human language relies on social convention and is acquired through learning. Estimates of the number of human languages in the world vary between and . Precise estimates depend on an arbitrary distinction (dichotomy) established between languages and dialects. Natural languages are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Emeritus
''Emeritus/Emerita'' () is an honorary title granted to someone who retires from a position of distinction, most commonly an academic faculty position, but is allowed to continue using the previous title, as in "professor emeritus". In some cases, the term is conferred automatically upon all persons who retire at a given rank, but in others, it remains a mark of distinguished performance (usually in the area of research) awarded selectively on retirement. It is also used when a person of distinction in a profession retires or hands over the position, enabling their former rank to be retained in their title. The term ''emeritus'' does not necessarily signify that a person has relinquished all the duties of their former position, and they may continue to exercise some of them. In descriptions of deceased professors emeriti listed at U.S. universities, the title ''emeritus'' is replaced by an indication of the years of their appointments, except in obituaries, where it may be us ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
