Uta Priss

dblp:29/3789 · DBLP profile ↗
← Back
14ranked-venue papers
14as first author
4since 2021 · last 2024
0000-0003-0375-429XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 9 first-author · 2 since 2021Artificial intelligence and machine learning · 5 · 5 first-author · 2 since 2021
YearPublicationVenuePosition
2024 Rectangular Euler Diagrams and Order Theory
Uta Priss, Dominik Dürrschnabel
Diagrams1
2023 Representing Concept Lattices with Euler Diagrams
Uta Priss
ICFCA1
2021 Visualising Lattices with Tabular Diagrams
Uta Priss
Diagrams1
2021 Diagrammatic Representation of Conceptual Structures
Uta Priss
ICFCA1
2020 A Semiotic-Conceptual Analysis of Euler and Hasse Diagrams
Uta Priss
Diagrams1
2020 A Preliminary Semiotic-Conceptual Analysis of a Learning Management System
abstract
Semiotic-Conceptual Analysis (SCA) is a mathematical formalisation of semiotics that builds on a conceptual foundation. Its aim is to present a means for analysing the relationship between representations and their meanings. SCA can thus support “interactive linguistics”. The initial step of SCA is a qualitative analysis which provides an overview of the structures of an application domain. This initial step is followed by more formal analyses. In this paper, the initial step of SCA is applied to a learning management system as an example from the domain of educational software.
Uta Priss
KES1
2017 Learning Thresholds in Formal Concept Analysis
Uta Priss
ICFCA1
2013 Using FCA to Analyse How Students Learn to Program
Uta Priss
ICFCA1
2010 Concept Neighbourhoods in Lexical Databases
Uta Priss, L. John Old
ICFCA1
2009 Revisiting the Potentialities of a Mechanical Thesaurus
Uta Priss, L. John Old
ICFCA1
2006 An FCA Interpretation of Relation Algebra
Uta Priss
ICFCA1
2005 Conceptual Exploration of Semantic Mirrors
Uta Priss, L. John Old
ICFCA1
2004 Signs and Formal Concepts
Uta Priss
ICFCA1
1999 Efficient Implementation of Semantic Relations in Lexical Databases
abstract
In this paper we develop a formalization of semantic relations that facilitates efficient implementations of relations in lexical databases or knowledge representation systems using bases. The formalization of relations is based on a modeling of hierarchical relations in Formal Concept Analysis. Further, relations are analyzed according to Relational Concept Analysis, which allows a representation of semantic relations consisting of relational components and quantificational tags. This representation utilizes mathematical properties of semantic relations. The quantificational tags imply inheritance rules among semantic relations that can be used to check the consistency of relations and to reduce the redundancy in implementations by storing only the basis elements of semantic relations. The research presented in this paper is an example of an application of Relational Concept Analysis to lexical databases and knowledge representation systems (cf. Priss 1996) which is part of a larger framework of research on natural language analysis and formalization.
Uta Priss
Comput. Intell.1