Title: "A Faster Tableau for CTL*"
Speaker: Mark Reynolds , Head of the School of Computer Science and Software Engineering at The University of Western Australia.
Abstract: There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this talk we present a streamlined and more traditional tableau approach built upon the author's earlier theoretical work. Soundness and completeness results are proved. A prototype implementation demonstrates the significantly improved performance of the new approach on a range of test formulas. We also see that it compares favourably to state of the art, game and automata based decision procedures.
Title: A new rule for LTL tableaux"
Speaker: Mark Reynolds
Abstract : Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated.
In this talk, we introduce a novel style of tableau rule which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.
Speaker : Francesco Kriegel, Technische Universität Dresden, Germany
Title: Knowledge Acquisition and Discovery in Description Logics with Formal Concept Analysis
Аbstract: Description Logics (DLs) are a family of conceptual languages suitable for knowledge representation and reasoning that have a strong logical foundation for which the decidability and complexity of common reasoning problems is widely explored. In particular, the reasoning tasks allow for a deduction of implicit knowledge from explicitly stated facts and axioms, and plenty of appropriate algorithms were developed and implemented, e.g., tableaux algorithms, and completion algorithms. DLs provide the logical underpinning of the Web Ontology Language (OWL) and some of its fragments, which are used for the Semantic Web and Linked Data, e.g., in the medical domain (SNOMED ontology), and in DBpedia as well as Wikidata (structured machine-readable derivations of Wikipedia). Furthermore, DLs allow for the expression of assertional and terminological knowledge, and an interesting problem is the (semi-)automatic deduction of terminological facts, so called general concept inclusions (GCIs), from given assertional facts. This problem may also be varied by taking into account existing terminological facts. In this talk, we will explore the application of methods from Formal Concept Analysis (FCA) for tackling this problem for three different settings of the input data. In particular, we show how canonical implicational bases of suitable formal contexts or closure operators yield bases of GCIs for the input data. More specifically, we utilize suprema and infima of specific closure operators in the lattice of DL concept descriptions, and enumerate their canonical implicational base in order to generate the hidden terminological knowledge in a sound and complete manner. There is an algorithm that is able to solve this enumeration problem in a highly parallel way where no communication or synchronization between concurrent threads in necessary.
Speaker: Gerhard Wohlgenannt, assistant professor at the Institute of Information Business of the Vienna University of Economics and Business
Title: The Integration of Crowdsourcing into Knowledge Engineering Workflows; plus current Research Interests: such as Google word2vec
Abstract: The advent of the Web has significantly changed the context of systems that rely on formally specified knowledge, which led to opening up knowledge creation processes and tools to wider groups of contributors.
Further broadening of this process allows large populations of non-experts to create knowledge through the use of crowdsourcing techniques such as games or mechanised labour platforms. Crowdsourcing techniques can provide effective means for solving a variety of ontology engineering (and other knowledge-rich) problems. Yet, crowdsourcing is mainly used as external support to ontology engineering, without being integrated into the work of ontology engineers.
Speaker: Alexander Tuzhilin, Stern School of Business NYU
Title: "Recommending Remedial Learning Materials to the Students by Filling their Knowledge Gaps"
Abstract: A new content-based method of providing recommendations of remedial learning materials to the students will be presented. This method identifies gaps in students’ knowledge of the subject matter in the online courses that they take and provides recommendations of relevant targeted educational materials from the library of assembled learning materials to them in order to close the “gaps” in what the students have learned in the course. The proposed recommendation method is empirically validated using a randomized controlled experiment on the students from an online university. It is shown that the students not only liked the recommendations provided to them by the proposed method, but that these recommendations led to better performance results on the final exams for certain segments of the student body. This is joint work with Konstantin Bauman.
Speaker: Max Kanovich, professor of computer science at Department of Computer Science and Information Systems, University of London, visiting professor of Faculty of Computer Science,School of Data Analysis and Artificial Intelligence
Speaker: Stanislav O. Speranski, Scientific Researcher Laboratory of Logical Systems Sobolev Institute of Mathematics,
Title: Reasoning with probability spaces
(2015). Quantifying over events in probability logic: an introduction.Mathematical Structures in Computer Science. Cambridge: Accepted.
(2013). Complexity for probability logic with quantifiers over propositions.Journal of Logic and Computation 23:5, 1035–1055. Oxford.
R. Fagin, J.Y. Halpern and N. Megiddo (1990). A logic for reasoning about probabilities.
Information and Computation 87:1–2, 78–128. Elsevier.
Speaker: Michael Zakharyaschev, professor of computer science at Department of Computer Science and Information Systems, University of London, Birkbeck.
Abstract: Ontology-based data access and management (OBDA) is a popular paradigm of organising access to various types of data sources that has been developed since the mid 2000s. In a nutshell, OBDA separates the user from the data sources (relational databases, triple stores, etc.) by means of an ontology, which provides the user with a convenient query vocabulary, hides the structure of the data sources, enriches incomplete data with background knowledge, and supports queries to multiple and possibly heterogeneous data sources. A key concept of OBDA is first-order rewritability, which reduces the problem of answering ontology-mediated queries (OMQs) to standard database query evaluation.
Title : Data mining problems in computational mass spectrometry
Speaker : Attila Kertesz-Farkas, Associate Professor, Faculty of Computer Science, School of Data Analysis and Artificial Intelligence
Title: A Characterization of the Single-Peaked Domain
Speaker: Prof. Dr. Clemens Puppe, Chair, Economic Theory Karlsruhe Institute of Technology (KIT)
Abstract: It is proved that, among all restricted preference domains that guarantee consistency (i.e. transitivity) of pairwise majority voting, the single-peaked domain is the only minimally rich and connected domain that contains two completely reversed strict preference orders. It is argued that this result explains the predominant role of single-peakedness as a domain restriction in models of political economy and elsewhere over the last seven decades. Several intermediate steps of the proof shed further light on the structure of restricted domains that guarantee transitivity of pairwise majority voting, among them the result that a single-crossing (`order-restricted´) domain can be minimally rich only if it is a subdomain of a single-peaked domain.
Title: "Formal Concept Analysis: A Useful Example of Modern Mathematics"
Speaker: Prof. Bernard Ganter,Technische Universität Dresden
Title: "On computing all abductive explanations from a propositional Horn theory"
Speaker: Kazuhisa Makino, Research Institute for Mathematical Sciences (RIMS) at Kyoto University.
Speaker: Umnov Alexey Vitalievitch, lector of the big data and information search department of Computer Science faculty NRU HSE
Title: Use of sparced representations for working with Gibbs effect on images
Speaker: Zaitsev Alexey, PhD student of IITP RAS, reseacher of IITP RAS of the intellectual data analysis and modelling department.
Title: Consolidation of the different precision data with the use of Gaussian models
Speaker: Neznanov Alexey Andreevitch, Senior Research Fellow of the Faculty of Computer Science ( Laboratory for Intelligent Systems and Structural Analysis)
Speaker: Panov Alexandr Igorevitch, Institute for Systems Analysis of Russian Academy of Sciences
Speaker: Dmitry Alexandrov, PhD student of the mathematical theory of intellectual system department in the mechanical-mathematical faculty MSU
Speaker: Yury Kashnitsky, PhD student NRU HSE
Title: Methods of similarity of graphs definition
Speaker: Artem Revenko, НИУ ВШЭ, TU Dresden, TU Wien
Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.