Blanck, J. In Data Analytics and Decision Support for Cybersecurity. Journal of Computers in Education 5(4), 415-434. This type of research includes theorizing or defining how a cyber system and its environment behave and then exploring or playing out the implications of how it is defined. LNAI 10207, pages 277-284. There are different type of issues that may be considered theoretical computer science. Heule, M. & Kullmann, O. A university-based model for supporting computer science curriculum reform. And there are many other application areas, where large "logical puzzles" have to be solved (think "big Sudokus") such railway safety, argumentation, AI in general, and logic and complexity. We design such formalisms and study their intrinsic properties as well as their real-life applications. Berlin: Springer Verlag. Areas of particular interest include the theory of algorithms and optimization, graph theory, scalable algorithms, theory of machine learning, computational geometry, complex analysis, computational complexity, algorithmic number theory and cryptography. Theoretical computer science is a term generally used to refer to parts of the computer science world that are less “hands-on” or demonstrable and more theoretical in nature. History and heritage: What are the causes of changes? Moller, F. & Crick, T. (2016).A National Engagement Model for Developing Computer Science Education in Wales. Berger, U., James, P., Lawrence, A., Roggenbach, M. & Seisenberger, M. (2017). In propositional proof complexity the major open problem is to prove strong lower bounds for expressive propositional proof systems. It concerns itself with computational questions in the presence of self-interested agents. Computational complexity theory has its origin in logic. Phatic systems in digital society. Betts, J. cryptography) to social issues involved in social engineering (e.g. In PRIMA 2018: Principles and Practice of Multi-Agent Systems. TCS also assesses the inherent difficulty of computing problems, develops efficient new methods to solve hard computing problems and provides powerful methodologies for the development of correct and reliable software. View profiles here- http://www.cs.swansea.ac.uk/theory/index.php/people/. 31-59). Beckmann, A. Mathematical Structures in Computer Science, 1-22. Presented at Sailing Routes in the World of Computation,, 228-337. doi:10.1007/978-3-319-94418-0_33. Indiana University Bloomington An even more dangerous activity than driving is programming. Future Care Capital. The Swansea Theory Group is internationally renowned for its research in Logic in Computer Science. It concerns itself with computational questions in the presence of self-interested agents. Surveillance and identity: conceptual framework and formal models. Senses of ‘argument’ in instantiated argumentation frameworks. We introduce a calculus describing the movement of processes and devices, including movement through administrative domains. Wyner, A., Bench-Capon, T., Dunne, P. & Cerutti, F. (2015). Automated Verification of Signalling Principles in Railway Interlocking Systems. Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. TCS owes much of its success to Alan Turing (1912-1954), whom many consider the father of TCS, and to Kurt Gödel (1906-1978), the founder of modern logic. Science of Computer Programming. Dybjer, P. & Setzer, A. The emergence of a dazzling range of digital technologies have transformed fundamentally many aspects of our political, economic, social and personal lives. For instance, the type of handlers of a graphical user interface can be defined as a type which depends on the user interface itself. In the last decade, the area of research on enumeration algorithms has grown rapidly. Vesely, F. (2016). At Swansea University, there is expertise in argumentation theory, argumentation and natural language processing, argumentation schemes, and planning. -204). In these respects, logic becomes more interdisciplinary, relating to AI and Law, NLP, and argumentation. The field of algorithmic game theory lies at the intersection of computer science and economics. In CS, there is expertise in logic, knowledge representation, machine learning, natural language processing, case-based reasoning, dialogue/discourse, chatbots, and social simulation. The research interests of faculty in Theoretical Foundations of Computer Science cover a wide spectrum of topics. Computer science is the study of algorithmic processes, computational machines and computation itself. Moller, B. Kiel, Germany: Springer. The explanatory power of argumentation has been explored in argumentation-based decision making and planning in both legal and medical settings. Argumentation provides a powerful mechanism for dealing with inconsistent, incomplete information using defeasible/non-monotonic reasoning; it provides a means for representing and helping to resolve conflicts and differences of opinion amongst different parties. Since computer programs control aircrafts, nuclear power plants, medical devices and banking systems, bugs introduced by programmers can cause catastrophic loss of life and livelihood. In Software Engineering and Formal Methods. Mathematical Structures in Computer Science 20(02), 107. This is the homepage of Theoretical Computer Science group at Aalto University, Finland. Parameterized Games and Parameterized Automata. (2018) Cube-and-Conquer for Satisfiability. Berger, U. CiteScore: 2.3 ℹ CiteScore: 2019: 2.3 CiteScore measures the average citations received per peer-reviewed document published in this title. As a discipline, computer science spans a range of topics from theoretical studies of algorithms, computation and information to the practical issues of implementing computational systems in hardware and software.. Its fields can be divided into theoretical and practical disciplines. Argument & Computation 6(1), 50-72, Swansea University is a registered charity, No. Journal of Functional Programming 27. Technocamps: : Advancing Computer Science Education in Wales. We study efficient solutions for big data analytics, including sublinear algorithms, streaming algorithms, and distributed/parallel algorithms. Research in the Mathematical Sciences is an international, peer-reviewed hybrid journal covering the full scope of Theoretical Mathematics, Applied Mathematics, and … Proc. (2018) Optimized Program Extraction for Induction and Coinduction. The most famous open problem in the area is the P versus NP-problem, listed among the seven Clay Millenium Prize problems (see also the topic 'Satisfiability Solving'). Researchers at Duke have studied fundamental questions in this emerging area, including auction theory, social choice theory, fair resource allocation, preference elicitation, and crowdsourcing, along with real-world implications to ethics, democracy, and society. Knapp, A., Mossakowski, T., Roggenbach, M. & Glauer, M. (2015) An Institution for Simple UML State Machines. Williams, S., Ware, J M. & Müller, B. Research Areas. Blasco, J., Chen, T., Kalutarage, H., Muttik, I., Nguyen, H., Roggenbach, M. & Shaikh, S. (2017). Interactive programming in Agda – Objects and graphical user interfaces. Initially studied in philosophy and law, argumentation has been researched extensively in AI and Computer Science in the last decade. Melbourne, Australia: International Joint Conference on Artificial Intelligence (IJCAI). Here at Swansea, we take an interdisciplinary approach that cuts across research themes in Computer Science and out to wider fields such as Law. & Kober, P. (2010). Classifying the computational power of stochastic physical oracles. Starting with Carl Adam Petri's seminal work on Petri nets in the early 1960s, a wide variety of formalisms have been developed for modelling and reasoning about concurrency. It is a field that has a wide ranging background, from core fundamentals (e.g. Regarding topics. Algorithmic game theory. We investigate theoretical foundations of applied areas including artificial intelligence (AI), machine learning (ML), and databases (DB). In N. Martí-Oliet, P. C. Ölveczky, and C. Talcott, editors, Logic, Rewriting, and Concurrency, volume 9200 of Lecture Notes in Computer Science, pages 519–538. Research at the Theoretical Computer Science group at Penn State spans diverse areas in algorithms and complexity theory, as well as in closely connected application domains such as machine learning, biology, and statistical physics. A Provably Correct Translation of the Lambda-Calculus into a Mathematical Model of C++. In the form of the P vs NP problem, the complexity of SAT solving is one of the central topics of theoretical computer science. Two main approaches are: machine learning, where texts are statistically analysed and classified with respect to sentiment, opinion, topic, and other types; knowledge representation and reasoning, where (logical) rules and knowledge structures are used to process, relate, extract, represent, and reason with the fine-grained information encoded in language. USC has a strong and active background in modern theoretical computer science, with research spanning a broad range of topics. Proceedings of MFCS. Soft Computing 21(1), 191-197. 253-267). This field comprises two sub-fields: the theory of algorithms, which involves the design and analysis of computational procedures; and complexity theory, which involves efforts to prove that no efficient algorithms exist in certain cases, and which investigates the classification system for computational tasks. Aiming to improve understanding of computation and its capabilities, limitations and future potential, this research area encompasses research around logic and semantics, and the study of algorithms, complexity and automata; researchers employ abstract models, formal and rigorous methods, logical concepts and semantics… Presented at Computing Education Practice, Durham, UK: Computing Education Practice. Heule, M.., Kullmann, O. legislation, case law, and contracts) and processes (e.g. Theorising Monitoring: Algebraic Models of Web Monitoring in Organisations. & Preining, N. (2018). (2017). Concurrency theory represents the area of theoretical computer science which studies the decomposability properties of a program, algorithm, or problem into parts that can be safely executed (partially) out of order. & Toni, F. (2019). All … Basset, N., Jecker, I., Pauly, A., Raskin, J. Heule, M., Kullmann, O. & Marek, V. (2016) Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. & Petrovska, O. (2009). Presented at Theory and Applications of Satisfiability Testing - SAT 2018, Oxford, UK: Theory and Applications of Satisfiability Testing. Regarding topics. (2018). (2017). Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the nature and limits of efficient computation. (pp. Moller, F. & Crick, T. (2018). Are there limits to what we can compute? & Preining, N. (2017). Communications of the ACM 60(8), 70-79. He received his Ph.D. in Computer Science in 1983 from Princeton University. Preserving safety, privacy and mobility of persons living with Dementia by recognising uncharacteristic out-door movement using Recurrent Neural Networks with low computing capacity. Springer. Beckmann, A. (2015). Weak Bisimulation as a Congruence in MSOS. For a long time I took it to mean mathematical, as opposed for example to "hacking". Satisfiability solving (SAT) is the algorithmic solution of a system of logical (boolean) equations. Submission. Programme duration: Full-time: 24 months Programme start: Autumn 2021 Entry requirements: You will need a good 2:1 honours degree (or above) in a subject area closely related to Computer Science, Mathematics, or the intersection of these two subject areas. We have as well expertise in verification of computer hardware. Copyright © 2021 The Trustees of & Raskin, J. It is a theory in theoretical computer science, under discrete mathematics (a section of mathematics and also of computer science). Springer. James, P., Moller, F., Nguyen, H., Roggenbach, M., Schneider, S. & Treharne, H. (2014). doi:10.4230/LIPIcs.CSL.2018.10, Pauly, A. Chilton, C., Kwiatkowska, M., Moller, F. & Wang, X. Prof. CiteScore values are based on citation counts in a range of four years (e.g. Computer scientists are at the heart of these technologies and can have deep insights into how they affect and change the world: from theory, to policy and practice. About. Beckmann, A., Buss, S., Friedman, S., Moller, M. & Thapen, N. (2018). & B., Jens (2010). Proceedings of the First Joint Workshop on AI in Health. (2016). At Swansea we do research on the mathematical foundation of computation over continuous data and are developing verified software for efficient exact real number computation. James, P., Lawrence, A., Roggenbach, M. & Seisenberger, M. (2016) Towards Safety Analysis of ERTMS/ETCS Level 2 in Real-Time Maude. & Spreen, D. (2016). Mathematical Structures in Computer Science 26(01), 129-153. Pauly, A. Indiana University Bloomington Berger, U. Our research focuses on the theoretical foundations of computer science and related applications. AI theory and tools are applied to legal information (e.g. (pp. James, P. & Roggenbach, M. (2014). Blockchains, and in general Distributed Ledger Technologies, provide a new way to agree on trusted digital information amongst untrusted parties. Electronic Notes in Theoretical Computer Science 221, 3. Agents and Dementia “ Smart Risk Assessment. Argument & Computation 7(2-3), 113-133. Journal of Logic and Analysis, Berger, U. Blanck, J. Types are used in programming to obtain programs with a higher degree of correctness, and help the compilers to compile programs more efficiently. attacks that deceive human judgement). Computer Systems, Networks, and Architecture; Theory of Computer Science. (2017). Presented at Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems. Swansea computer scientists have made, and are making, technical contributions that are driving change, but they are also addressing Educational, Historical and Philosophical question. & Wyner, A. (2018) Fall Detection with Unobtrusive Infrared Array Sensors. Theoretical computer science is the mathematical study of the capabilities and limitations of computing. In Swansea we cover the whole area, from the theoretical foundations via open-source implementations to applications in industry and mathematics. Presented at ISSEP'2016: The 9th International Conference on Informatics in Schools, Munster, Germany: ISSEP 2016. & Biere, A. Computer Science at U of T is known for its work in neural networks, computer graphics, machine learning, theory, human-computer interaction (HCI), scientific computation, computer performance evaluation, and more. Of particular interest is interdisciplinary research on argumentation in law with interactions between the Department of Computer Science and the School of Law. In Concurrency, Security, and Puzzles. Encapsulating Formal Methods within Domain Specific Languages: A Solution for Verifying Railway Scheme Plans. & van den Bogaard, M. (2018). Process. On the one hand, it forms the theoretical foundation of verification, as we can view a verification scenario as a game being played between the system and its environment. Springer. For more information, please visit the theory group wiki. Active research areas include: Computability Theory, Computational Complexity, Proof Theory, Type Theory, Game Theory, Concurrency, Artificial Intelligence (Satisfiability Solving, Multi-agent Systems, Argumentation Theory, Machine Learning, AI and Law), and Formal Methods (Cyber Security, Blockchain Technology, verification of Railway Control Systems). (2018). AI and Law is a research area within Artificial Intelligence. We are exploring more general ways of using blockchain technologies such as tracing the use of assets in the supply chain. Apply; Meet us On modelling and verifying railway interlockings: Tracking train lengths. There would be an ongoing debate about what constitutes Theoretical Computer Science, except that scientists are too busy doing real stuff than to waste their time chasing mice. In Logic, Language, Information, and Computation. 344-361). The theory group in Swansea focuses on logical descriptions of complexity, in particular propositional proof complexity and bounded arithmetic. We have expertise in several theorem provers such as Agda, B-Method, Coq, Event-B, Isabelle/HOL, Minlog, and Maude. & Seisenberger, M. (2015). & Hou, T. (2016). CEUR Workshop Proceedings, Vol-1698 (urn:nbn:de:0074-1698-4), pages 86-100. Presented at 10th Workshop in Primary and Secondary Computing Education,, 121-126. (2018) On Generating Explainable Plans with Assumption-Based Argumentation. Active research areas include: Computability Theory, Computational Complexity, Proof Theory, Type Theory, Game Theory, Concurrency, Artificial Intelligence (Satisfiability Solving, Multi-agent Systems, Argumentation Theory, Machine Learning, AI and Law), and Formal Methods (Cyber Security, … PRIMA 2018: Principles and Practice of Multi-Agent Systems. ACM Transactions on Computational Logic 19(3), 1-29. For the main conference, we solicit research papers in all areas of theoretical computer science. The Journal of Logic and Algebraic Programming 64(1), 41. Context-based and Explainable Decision Making with Argumentation. Formalisms for reasoning about various computation and programming paradigms are built using concepts and tools of formal logic. His main research interests are in complexity theory, algorithms, randomness, and cryptography. Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. Concurrency, Specification, and Programming (CS&P 2016). Towards Small-step Compilation Schemas for SOS (extended abstract). This allows to describe the correctness of procedures by expressing the output of a procedure by a type which is parametrized by its inputs. Crediting both the Phitonex team and Duke University, Lebeck states that "The foundational research behind the technology was performed at Duke over a span of about 17 years." Berger, U., Jones, A. 1138342. Theoretical Computer Science (TCS) looks at the fundamental questions of computation by creating formal models of computation and understanding the resources needed to solve general and specific algorithmic questions. In Sailing Routes in the World of Computation. In Swansea we have special expertise in proof theory of Martin Laf Type Theory, interactive theorem proving using the type theoretic theorem provers Agda and Coq, coalgebras and coinduction. Philosophy: How do our technologies speak to classic, human philosophical problems of what we can know, what we can do, and who we are? Deciding logics of linear Kripke frames with scattered end pieces. Blanck, J., Stoltenberg-Hansen, V. & Tucker, J. Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory.. (2018). There is significant overlap between the two Graduate Areas, and much research lies in their intersection. (2017). Blanck, J. The influence of data, software and computation on the world is intensifying. (pp. For a long time I took it to mean mathematical, as opposed for example to "hacking". (2016) A Specification Theory of Real-Time Processes. Solving very hard problems: Cube-and-Conquer, a hybrid SAT solving method. Expert Systems with Applications 117, 42-61. Another example is the property that after updating a railway interlocking system depending on requests by users, the new interlocking system fulfils safety criteria. The ACM's Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description: Bauer, A. Journal of Logic and Computation, exv078, Abel, A., Adelsberger, S. & Setzer, A. Mosses, P. & Vesely, F. (2014). The field of algorithmic game theory lies at the intersection of computer science and economics. (2018). Inf. Artificial Intelligence and Law 25(1), 107-126. (2017). We investigate theoretical foundations of applied areas including artificial intelligence (AI), machine learning (ML), and databases (DB). Therefore, driverless cars are being developed to make driving safer. Electronic Proceedings in Theoretical Computer Science 277, 30-42. Springer. Our methods frequently rely on rigorous mathematical proofs. We seek to obtain a precise and systematic understanding of various forms of computation through mathematical formulation and analysis of their core concepts, including their articulation (syntax), meaning (semantics), and interpretation (use). In Handbook of Parallel Constraint Reasoning. (2017). Crick, T. & Moller, F. (2015). & Roggenbach, M. (2017). All papers will undergo a rigorous review process and will be judged based on their originality, soundness, significance of the results, and relevance to the theme of the conference. Domain representations of spaces of compact subsets. There would be an ongoing debate about what constitutes Theoretical Computer Science, except that scientists are too busy doing real stuff than to waste their time chasing mice.