|
Moshe Y. Vardi
, honorific_suffix = , image = Moshe Vardi IMG 0010.jpg , birth_date = , birth_place = Israel , workplaces = Rice UniversityIBM ResearchStanford University , alma_mater = , thesis_title = The Implication Problem for Data Dependencies in the Relational Model , thesis_url = , thesis_year = 1981 , doctoral_advisor = Catriel Beeri , doctoral_students = Kristin Yvonne Rozier , fields = LogicComputation , awards = , website = Moshe Ya'akov Vardi ( he, משה יעקב ורדי) is an Israeli mathematician and computer scientist. He is a Professor of Computer Science at Rice University, United States. He is University Professor, the Karen Ostrum George Professor in Computational Engineering, Distinguished Service Professor, and director of the Ken Kennedy Institute for Information Technology. His interests focus on applications of logic to computer science, including database theory, finite mode ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rice University
William Marsh Rice University (Rice University) is a Private university, private research university in Houston, Houston, Texas. It is on a 300-acre campus near the Houston Museum District and adjacent to the Texas Medical Center. Rice is ranked among the top universities in the United States. Opened in 1912 as the Rice Institute after the murder of its namesake William Marsh Rice, Rice is a research university with an undergraduate focus. Its emphasis on undergraduate education is demonstrated by its 6:1 student-faculty ratio. The university has a Research I university, very high level of research activity, with $156 million in sponsored research funding in 2019. Rice is noted for its applied science programs in the fields of artificial heart research, structural chemical analysis, signal processing, space science, and nanotechnology. Rice has been a member of the Association of American Universities since 1985 and is Carnegie Classification of Institutions of Higher Education ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. 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 for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joel Spencer
Joel Spencer (born April 20, 1946) is an American mathematician. He is a combinatorialist who has worked on probabilistic methods in combinatorics and on Ramsey theory. He received his doctorate from Harvard University in 1970, under the supervision of Andrew Gleason. He is currently () a professor at the Courant Institute of Mathematical Sciences of New York University. Spencer's work was heavily influenced by Paul Erdős, with whom he coauthored many papers (giving him an Erdős number of 1). In 1963, while studying at the Massachusetts Institute of Technology, Spencer became a Putnam Fellow. In 1984 Spencer received a Lester R. Ford Award. He was an Erdős Lecturer at Hebrew University of Jerusalem in 2001. In 2012 he became a fellow of the American Mathematical Society. He was elected as a fellow of the Society for Industrial and Applied Mathematics in 2017, "for contributions to discrete mathematics and theory of computing, particularly random graphs and networks, Ramsey ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leonid Libkin
Leonid Libkin is a computer scientist who works in data management, in particular in database theory, and in logic in computer science. Libkin is a professor at the University of Edinburgh, where he is chair of Foundations of Data Management in the School of Informatics, and at the École Normale Supérieure in Paris. He previously worked at the University of Toronto, and at Bell Labs. Libkin is the author of standard textbooks on finite model theory and on data exchange. He is an ACM Fellow, a Fellow of the Royal Society of Edinburgh, and a member of Academia Europaea. He won best paper awards at the Symposium on Principles of Database Systems (ACM PODS) in 1999, 2003, and 2005, at International Conference on Database Theory (ICDT) in 2011, at the Principles of Knowledge Representation and Reasoning Conference in 2014 and 2018., and at the ACM SIGMOD SIGMOD is the Association for Computing Machinery's Special Interest Group on Management of Data, which specializes in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Phokion G
Phokion may refer to: * Phocion Phocion (; grc-gre, Φωκίων ''Phokion''; c. 402 – c. 318 BC; nicknamed The Good (''ὁ χρηστός'')) was an Athenian statesman and strategos, and the subject of one of Plutarch's ''Parallel Lives''. Phocion was a successful politici ... (c. 402 – c. 318 BC), an Athenian statesman and strategos * Phokion J. Tanos (1898 – 1972), a Cypriot dealer of antiques in Cairo {{disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Yoram Moses
Yoram Moses ( he, יוֹרָם מוֹזֶס) is a Professor in the Electrical Engineering Department at the Technion - Israel Institute of Technology. Yoram Moses received a B.Sc. in mathematics from the Hebrew University of Jerusalem in 1981, and a Ph.D. in Computer Science from Stanford University in 1986. Moses is a co-author of the book ''Reasoning About Knowledge'', and is a winner of the 1997 Gödel Prize in theoretical computer science and the 2009 Dijkstra Prize in Distributed Computing. His major research interests are distributed systems and reasoning about knowledge. He is married to the computer scientist Yael Moses Yael Moses ( he, יעל מוזס) is a professor in the Efi Arazi School of Computer Science at the Interdisciplinary Center Herzliya, Israel. Education and career Moses received her Ph.D. in computer science at the Weizmann Institute of Scie .... External linksYoram Moses's homepage Electrical engineering academics Gödel Prize laureates Di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joseph Halpern
Joseph Yehuda Halpern (born 1953) is an Israeli-American professor of computer science at Cornell University. Most of his research is on reasoning about knowledge and uncertainty. Biography Halpern graduated in 1975 from University of Toronto with a B.S. in mathematics. He went on to earn a Ph.D. in mathematics from Harvard University in 1981 under the supervision of Albert R. Meyer and Gerald Sacks. He has written three books, ''Actual Causality'', ''Reasoning about Uncertainty,'' and ''Reasoning About Knowledge'' and is a winner of the 1997 Gödel Prize in theoretical computer science and the 2009 Dijkstra Prize in distributed computing. From 1997 to 2003 he was editor-in-chief of the Journal of the ACM. In 2002 he was inducted as a Fellow of the Association for Computing Machinery and in 2012 he was selected as an IEEE Fellow. In 2011 he was awarded a Senior Fellowship of the Zukunftskolleg at the University of Konstanz. In 2019, Halpern was elected a member of the National ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ronald Fagin
Ronald Fagin (born 1945) is an American mathematician and computer scientist, and IBM Fellow at the IBM Almaden Research Center. He is known for his work in database theory, finite model theory, and reasoning about knowledge. Biography Ron Fagin was born and grew up in Oklahoma City, where he attended Northwest Classen High School. He was later elected to the Northwest Classen Hall of Fame. He completed his undergraduate degree at Dartmouth College. Fagin received his Ph.D. in Mathematics from the University of California, Berkeley in 1973, where he worked under the supervision of Robert Vaught. He joined the IBM Research Division in 1973, spending two years at the Thomas J. Watson Research Center, and then transferred in 1975 to what is now the IBM Almaden Research Center in San Jose, California. He has served as program committee chair for ACM Symposium on Principles of Database Systems 1984, ACM Symposium on Principles of Database Systems 1984, Theoretical Aspects of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
P = NP Problem
The P versus NP problem is a major unsolved problem in theoretical computer science. In informal terms, it asks whether every problem whose solution can be quickly verified can also be quickly solved. The informal term ''quickly'', used above, means the existence of an algorithm solving the task that runs in polynomial time, such that the time to complete the task varies as a polynomial function on the size of the input to the algorithm (as opposed to, say, exponential time). The general class of questions for which some algorithm can provide an answer in polynomial time is " P" or "class P". For some questions, there is no known way to find an answer quickly, but if one is provided with information showing what the answer is, it is possible to verify the answer quickly. The class of questions for which an answer can be ''verified'' in polynomial time is NP, which stands for "nondeterministic polynomial time".A nondeterministic Turing machine can move to a state that is not d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Common Knowledge (logic)
Common knowledge is a special kind of knowledge for a group of agents. There is ''common knowledge'' of ''p'' in a group of agents ''G'' when all the agents in ''G'' know ''p'', they all know that they know ''p'', they all know that they all know that they know ''p'', and so on ''ad infinitum''.Osborne, Martin J., and Ariel Rubinstein. ''A Course in Game Theory''. Cambridge, MA: MIT, 1994. Print. It can be denoted as C_G p. The concept was first introduced in the philosophical literature by David Kellogg Lewis in his study ''Convention'' (1969). The sociologist Morris Friedell defined common knowledge in a 1969 paper. It was first given a mathematical formulation in a set-theoretical framework by Robert Aumann (1976). Computer scientists grew an interest in the subject of epistemic logic in general – and of common knowledge in particular – starting in the 1980s. There are numerous puzzles based upon the concept which have been extensively investigated by mathemat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complexity Of Constraint Satisfaction
The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction problems on finite domains. Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general. Research has shown a number of polynomial-time subcases, mostly obtained by restricting either the allowed domains or constraints or the way constraints can be placed over the variables. Research has also established a relationship between the constraint satisfaction problem and problems in other areas such as finite model theory and databases. Overview Establishing whether a constraint satisfaction problem on a finite domain has solutions is an NP complete problem in general. This is an easy consequence of a number of other NP complete problems being expressible as constraint satisfaction problems. Such other problems ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Model Checking
In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification (also known as correctness). This is typically associated with hardware or software systems, where the specification contains liveness requirements (such as avoidance of livelock) as well as safety requirements (such as avoidance of states representing a system crash). In order to solve such a problem algorithmically, both the model of the system and its specification are formulated in some precise mathematical language. To this end, the problem is formulated as a task in logic, namely to check whether a structure satisfies a given logical formula. This general concept applies to many kinds of logic and many kinds of structures. A simple model-checking problem consists of verifying whether a formula in the propositional logic is satisfied by a given structure. Overview Property checking is used for verification when two desc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Model Checking")