|
Ulrike Sattler
Ulrike M. Sattler is a Professor of Computer science in the information management group of the Department of Computer Science at the University of Manchester and a visiting professor at the University of Oslo. Education Sattler completed her PhD in 1998 under the supervision of Franz Baader at RWTH Aachen University in Germany. Career and research Sattler moved to the University of Manchester as Senior Lecturer in 2003, was promoted to reader in 2006 and then to professor in 2007. Sattler's research focuses on logic to support knowledge representation including description logic, Dynamic logic and Modal logic. She is also investigating the inference problems, complexity theory and decision procedures associated with knowledge representation. This research has been important in the development of the Web Ontology Language (OWL) and its use in bioinformatics and molecular biology. Sattler's research has been funded by the Engineering and Physical Sciences Research Counci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Department Of Computer Science, University Of Manchester
The Department of Computer Science at the University of Manchester is the longest established department of Computer Science in the United Kingdom and one of the largest. It is located in the Kilburn Building on the Oxford Road and currently has over 800 students taking a wide range of undergraduate and postgraduate courses and 60 full-time academic staff. Teaching and study Undergraduate The Department currently offers a wide range of undergraduate courses from Bachelor of Science (BSc), Bachelor of Engineering (BEng) and Master of Engineering (MEng). These are available as single honours or as joint honours degrees within the themes of Artificial Intelligence, Computer Science, Computer systems engineering, Software engineering, Mathematics, Internet Computing, Business applications and Management. Industrial placements are offered with all undergraduate courses. Postgraduate At postgraduate level the department offers taught Master of Science (MSc) degrees, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Senior Lecturer
Senior lecturer is an academic rank. In the United Kingdom, Ireland, New Zealand, Australia, Switzerland, and Israel senior lecturer is a faculty position at a university or similar institution. The position is tenured (in systems with this concept) and is roughly equivalent to an advanced assistant professor, post-third year review, in the North American system. Overview Especially in research-intensive universities, lecturers lead research groups and supervise research students, as well as teach. After a number of years, lecturers might be promoted to senior lecturers with increasing research, leadership, and administrative responsibilities. In most research-intensive universities (such as those that are part of the Russell Group and 1994 Group), a senior lecturer position is between a lecturer and a reader, with a strong focus on research. At the same time, in some universities (for instance, University of Leeds), the rank of reader is no longer used for new appointments ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ian Horrocks
Ian Robert Horrocks One or more of the preceding sentences incorporates text from the royalsociety.org website where: is a professor of computer science at the University of Oxford in the UK and a Fellow of Oriel College, Oxford. His research focuses on knowledge representation and reasoning, particularly ontology languages, description logic and optimised tableaux decision procedures. Education Horrocks completed his Bachelor of Science (BSc), Master of Science (MSc) and PhD degrees in the Department of Computer Science at the University of Manchester. Research and career After several years as a lecturer, senior lecturer, reader then Professor in Manchester, Horrocks moved to the University of Oxford in 2008. His work on tableau reasoning for very expressive description logics has formed the basis of most description logic reasoning systems in use today, including Racer, FaCT++, HermiT and Pellet. Horrocks was jointly responsible for development of the OIL and DAML+O ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Research Councils UK
Research Councils UK, sometimes known as RCUK, was a non-departmental public body which coordinated science policy in the United Kingdom from 2002 to 2018. It was an umbrella organisation that coordinated the seven separate research councils that were responsible for funding and coordinating academic research for the arts, humanities, science and engineering. In 2018 Research Councils transitioned into UK Research and Innovation (UKRI). Function The role of the RCUK was to: * Enabling dialogue about research priorities by facilitating an open and collective approach to investing in multidisciplinary research and training * Facilitating cooperation between the research councils and external stakeholders by promoting dialogue, collaboration, and partnership * Communicating the activities and views of the research councils to increase policy influence and collective visibility * Collaborating with academia and other funders to reduce bureaucratic tape for researchers and universi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Engineering And Physical Sciences Research Council
The Engineering and Physical Sciences Research Council (EPSRC) is a British Research Council that provides government funding for grants to undertake research and postgraduate degrees in engineering and the physical sciences, mainly to universities in the United Kingdom. EPSRC research areas include mathematics, physics, chemistry, artificial intelligence and computer science, but exclude particle physics, nuclear physics, space science and astronomy (which fall under the remit of the Science and Technology Facilities Council). Since 2018 it has been part of UK Research and Innovation, which is funded through the Department for Business, Energy and Industrial Strategy. History EPSRC was created in 1994. At first part of the Science and Engineering Research Council (SERC), in 2018 it was one of nine organisations brought together to form UK Research and Innovation (UKRI). Its head office is in Swindon, Wiltshire in the same building (Polaris House) that houses the AHR ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Molecular Biology
Molecular biology is the branch of biology that seeks to understand the molecular basis of biological activity in and between cells, including biomolecular synthesis, modification, mechanisms, and interactions. The study of chemical and physical structure of biological macromolecules is known as molecular biology. Molecular biology was first described as an approach focused on the underpinnings of biological phenomena - uncovering the structures of biological molecules as well as their interactions, and how these interactions explain observations of classical biology. In 1945 the term molecular biology was used by physicist William Astbury. In 1953 Francis Crick, James Watson, Rosalind Franklin, and colleagues, working at Medical Research Council unit, Cavendish laboratory, Cambridge (now the MRC Laboratory of Molecular Biology), made a double helix model of DNA which changed the entire research scenario. They proposed the DNA structure based on previous research done by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bioinformatics
Bioinformatics () is an interdisciplinary field that develops methods and software tools for understanding biological data, in particular when the data sets are large and complex. As an interdisciplinary field of science, bioinformatics combines biology, chemistry, physics, computer science, information engineering, mathematics and statistics to analyze and interpret the biological data. Bioinformatics has been used for '' in silico'' analyses of biological queries using computational and statistical techniques. Bioinformatics includes biological studies that use computer programming as part of their methodology, as well as specific analysis "pipelines" that are repeatedly used, particularly in the field of genomics. Common uses of bioinformatics include the identification of candidates genes and single nucleotide polymorphisms ( SNPs). Often, such identification is made with the aim to better understand the genetic basis of disease, unique adaptations, desirable propertie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Decision Problem
In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm whether a given natural number is prime. Another is the problem "given two numbers ''x'' and ''y'', does ''x'' evenly divide ''y''?". The answer is either 'yes' or 'no' depending upon the values of ''x'' and ''y''. A method for solving a decision problem, given in the form of an algorithm, is called a decision procedure for that problem. A decision procedure for the decision problem "given two numbers ''x'' and ''y'', does ''x'' evenly divide ''y''?" would give the steps for determining whether ''x'' evenly divides ''y''. One such algorithm is long division. If the remainder is zero the answer is 'yes', otherwise it is 'no'. A decision problem which can be solved by an algorithm is called ''decidable''. Decision problems typically appear in ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Complexity Theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of compu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inference
Inferences are steps in reasoning, moving from premises to logical consequences; etymologically, the word '' infer'' means to "carry forward". Inference is theoretically traditionally divided into deduction and induction, a distinction that in Europe dates at least to Aristotle (300s BCE). Deduction is inference deriving logical conclusions from premises known or assumed to be true, with the laws of valid inference being studied in logic. Induction is inference from particular evidence to a universal conclusion. A third type of inference is sometimes distinguished, notably by Charles Sanders Peirce, contradistinguishing abduction from induction. Various fields study how inference is done in practice. Human inference (i.e. how humans draw conclusions) is traditionally studied within the fields of logic, argumentation studies, and cognitive psychology; artificial intelligence researchers develop automated inference systems to emulate human inference. Statistical infer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modal Logic
Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other systems by adding unary operators \Diamond and \Box, representing possibility and necessity respectively. For instance the modal formula \Diamond P can be read as "possibly P" while \Box P can be read as "necessarily P". Modal logics can be used to represent different phenomena depending on what kind of necessity and possibility is under consideration. When \Box is used to represent epistemic necessity, \Box P states that P is epistemically necessary, or in other words that it is known. When \Box is used to represent deontic necessity, \Box P states that P is a moral or legal obligation. In the standard relational semantics for modal logic, formulas are assigned truth values relative to a '' possible world''. A formula's truth value ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dynamic Logic (modal Logic)
In logic, philosophy, and theoretical computer science, dynamic logic is an extension of modal logic capable of encoding properties of computer programs. A simple example of a statement in dynamic logic is :\text \to text\text, which states that if the ground is currently dry and it rains, then afterwards the ground will be wet. The syntax of dynamic logic contains a language of ''propositions'' (like "the ground is dry") and a language of ''actions'' (like "it rains"). The core modal constructs are , which states that after performing action ''a'' the proposition ''p'' should hold, and \langle a \rangle p, which states that after performing action ''a'' it is possible that ''p'' holds. The action language supports operations a\mathbinb (doing one action followed by another), a \cup b (doing one action or another), and iteration a (doing one action zero or more times). The proposition language supports Boolean operations (and, or, and not). The action logic is expressive enoug ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
