Alain Colmerauer was a French computer scientist. He was a professor at Aix-Marseille University, and the creator of the logic programming language Prolog.
Database theory encapsulates a broad range of topics related to the study and research of the theoretical realm of databases and database management systems.
Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of all complexity classes in the polynomial hierarchy, is precisely the class of languages expressible by statements of second-order logic. This connection between complexity and the logic of finite structures allows results to be transferred easily from one area to the other, facilitating new proof methods and providing additional evidence that the main complexity classes are somehow "natural" and not tied to the specific abstract machines used to define them.
Finite model theory is a subarea of model theory. Model theory is the branch of logic which deals with the relation between a formal language (syntax) and its interpretations (semantics). Finite model theory is a restriction of model theory to interpretations on finite structures, which have a finite universe.
In computer science, the expressive power of a language is the breadth of ideas that can be represented and communicated in that language. The more expressive a language is, the greater the variety and quantity of ideas it can be used to represent.
Codd's theorem states that relational algebra and the domain-independent relational calculus queries, two well-known foundational query languages for the relational model, are precisely equivalent in expressive power. That is, a database query can be formulated in one language if and only if it can be expressed in the other.
Oscar Peter Buneman, is a British computer scientist who works in the areas of database systems and database theory.
Dan Suciu is a full professor of computer science at the University of Washington. He received his Ph.D. from the University of Pennsylvania in 1995 under the supervision of Val Tannen. After graduation, he was a principal member of the technical staff at AT&T Labs until he joined the University of Washington in 2000. Suciu does research in data management, with an emphasis on Web data management and managing uncertain data. He is a co-author of an influential book on managing semistructured data.
David Maier is the Maseeh Professor of Emerging Technologies in the Department of Computer Science at Portland State University. Born in Eugene, OR, he has also been a computer science faculty member at the State University of New York at Stony Brook (1978–82), Oregon Graduate Center, University of Wisconsin, Oregon Health & Science University (2001–present) and National University of Singapore (2012–15). He holds a B.A. in Mathematics and Computer Science from the University of Oregon and a Ph.D. in Electrical Engineering and Computer Science from Princeton University (1978).
Victor Vianu is a computer scientist, a professor of computer science and engineering at the University of California, San Diego. He served as editor-in-chief of the Journal of the ACM from 2009 to 2015.
Tova Milo is a full Professor of Computer Science at Tel Aviv University and the Dean of the Faculty of Exact Sciences. She served as the head of the Computer Science Department from 2011 to 2014. Milo is the head of the data management group in Tel Aviv University, and her research focuses on Web data management. She received her PhD from the Hebrew University in 1992 under the supervision of Catriel Beeri, and was a postdoctoral fellow at the University of Toronto and INRIA, France, prior to joining Tel Aviv University.
In relational database theory, a tuple-generating dependency (TGD) is a certain kind of constraint on a relational database. It is a subclass of the class of embedded dependencies (EDs).
Leonid Libkin is a computer scientist who works in data management, in particular in database theory, and in logic in computer science.
Laure Murat, born 4 June 1967, in Paris, is a French historian, writer, and professor at the University of California, Los Angeles.
Marc Fontecave is a French chemist. An international specialist in bioinorganic chemistry, he currently teaches at the Collège de France in Paris, where he heads the Laboratory of Chemistry of Biological Processes.
Véronique Cortier is a French mathematician and computer scientist specializing in cryptography. Her research has applied mathematical logic in the formal verification of cryptographic protocols, and has included the development of secure electronic voting systems. She has also contributed to the public dissemination of knowledge about cryptography through a sequence of posts on the binaire blog of Le Monde. She is a director of research with CNRS, associated with the Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) at the University of Lorraine in Nancy.
Olivier Gascuel is a French researcher in bioinformatics. He is a research director at the CNRS. His work focuses in particular on phylogeny. He was the director of the Centre for Bioinformatics, Biostatistics and Integrative Biology at the Pasteur Institute from 2015 till 2020. In 2021, he joined the Institute of Systematics, Evolution, Biodiversity (ISYEB) at the National Museum of Natural History, France.
Sihem Amer-Yahia is an Algerian-French-American computer scientist. She is a CNRS Research Director at the Laboratoire d’Informatique de Grenoble. She leads the SLIDE research team. Sihem Amer-Yahia works on data management, declarative languages and query processing algorithms. Her publication topics include crowdsourcing, computational complexity, data analysis, data handling, data visualisation, information science, and addresses new data management problems in emerging internet and big data applications.
In database theory, the query evaluation problem is the problem of determining the answers to a query on a database. Research in database theory aims at determining the computational complexity of answering different kinds of queries over databases, in particular over relational databases.
Relational transducers are a theoretical model for studying computer systems through the lens of database relations. This model extends the transducer model in formal language theory. They were first introduced in 1998 by Abiteboul et al for the study of electronic commerce applications. The computation model treats the input and output as sequences of relations. The state of the transducer is a state of a database and transitions through the state machine can be thought of as updates to the database state. The model was inspired by the design of active databases and motivated by a desire to be able to express business applications declaratively via logical formulas.
