Events
Workshops, conferences and socials
-
A workshop dedicated to current and future trens in cyclic and illfounded notions of provability and justification. The event is sponsored by the Knut and Alice Wallenberg Foundation via the research project Taming Jörmungandr: The Logical Foundations of Circularity and the Department of Philosophy, Linguistics and Theory of Science.
-
Opponent: Jakub Szymanik, Associate professor at the Center for Brain/Mind Sciences and the Computer Science Department at the University of Trento.
Abstract Description logics are designed to reason efficiently with ontologies in knowledge bases, which are widely used in several industries. Human errors commonly cause mistakes to occur in the axioms of these ontologies, which leads to the logics deducing false conclusions. Ontology engineers spend much time on finding these false axioms to repair the ontology. This process can be facilitated by presenting a justification of the false conclusion, i.e. a set of axioms that entail the conclusion. Typically, the number of justifications for a given conclusion is very large and it is not clear which one should be presented.
It is therefore useful to estimate the cognitively adequate complexity of description logic so that the simplest justification(s) can be identified and selected. This work focusses on the cognitive complexity of deciding the consistency of ABoxes in the description logic $\mathcal{ALE}$. Conceptual considerations entail that the complexity of the ABox consistency problem is expressed as a linear preorder on a large enough set of ABoxes. This linear preorder can be estimated by an ACT-R model called SHARP. The model is a tableau algorithm implemented in a cognitive architecture, thereby modelling a human brain executing the tableau algorithm, which forms an approximation of the cognitive complexity ordering.
A complexity ordering that is a linear preorder can be obtained from experimental data by aggregating the different individual orders from a sample into one so-called proto-order, in which the largest transitive subrelation is the desired linear pre-order. The predicted complexity ordering by SHARP agrees well with the empirical data.
To enable applications in ontology debugging, a surrogate model is needed that accurately approximates SHARP’s output with great computational efficiency. Such a surrogate model can be obtained by the Random Forest algorithm trained on an appropriate dataset generated by SHARP. The complexity ordering thus obtained agrees well with the one predicted by SHARP but can be estimated in a fraction of the time enabling it for practical applications.
-
The Logic Group at the University of Gothenburg hosts its annual World Logic Day Pub Quiz. For information on World Logic Day events around the world, see http://wld.cipsh.international/wld2025.html.
-
The 2024 Annual European Meeting of the Association for Symbolic Logic, also known as the Logic Colloquium, will be held in Gothenburg on 24-28 June, 2024 and hosted by the Faculty of Humanities at the University of Gothenburg. The colloquium comprises 3 tutorials, 7 plenary lectures and 6 special sessions as well as contributed talks. In addition, the 2024 Gödel Lecture was delivered at the meeting.
See lc2024.se for full information.
-
The Logic Group at the University of Gothenburg hosts its annual World Logic Day Pub Quiz. For information of this and other World Logic Day events around the world, see http://wld.cipsh.international/wld2024.html.
-
There is now an acute need for intensive research on the possibility of effective learning with small data. The conference LSD running 11–12 September, organised by the Centre for Linguistic Theory and Studies in Probability (CLASP) and at the department of Philosophy, Linguistics and Theory of Science is devoted to work on this problem, with application to computational linguistics.
See the conference webpage for details.
-
Public defence of Dominik Wehr’s Licentiate thesis.
Opponent Associate Professor Anupam Das, University of Birmingham
Examiner Docent Fredrik Engström, Göteborgs universitet
Thesis available at the Gothenburg University Library Archive. -
Held on 27-28 April, 2023 at the University of Gothenburg, this workshop brought together researchers working on various aspects of fixed point logics and ill-founded proofs. The event was sponsored by the Knut and Alice Wallenberg Foundation via the research project Taming Jörmungandr: The Logical Foundations of Circularity and the Department of Philosophy, Linguistics and Theory of Science.
-
Public defence of Tjeerd Fokkens’ Licentiate thesis.
Opponent Dr Ing Stefan Borgwardt, Technische Universität Dresden
Examiner Professor Simon Dobnik, Göteborgs universitet -
The Logic Group at the University of Gothenburg hosts its annual World Logic Day Pub Quiz. For information of this and other World Logic Day events around the world, see http://wld.cipsh.international/wld2023.html.