Suche
Anzeige der Dokumente 171-180 von 194
Preprint
A finite state model for on-line analytical processing in triadic contexts
(2005)
About ten years ago, triadic contexts were presented by Lehmann and Wille as an extension of Formal Concept Analysis. However, they have rarely been used up to now, which may be due to the rather complex structure of the resulting diagrams. In this paper, we go one step back and discuss how traditional line diagrams of standard (dyadic) concept lattices can be used for exploring and navigating triadic data. Our approach is inspired by the slice & dice paradigm of On-Line-Analytical Processing (OLAP). We recall the ...
Preprint
Off to new shores
(2003)
In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from mathematics towards computer science. This article provides a review of this new orientation and analyzes why and how FCA and computer science attracted each other. It discusses FCA as a knowledge representation formalism using five knowledge representation principles provided by Davis, Shrobe, and Szolovits [DSS93]. It then studies how and why mathematics-based researchers got attracted by computer science. We will argue for ...
Dissertation
Regelbasiertes Reasoning auf massiv paralleler Hardware
(2015-10-15)
Eine wesentliche Funktionalität bei der Verwendung semantischer Technologien besteht in dem als Reasoning bezeichneten Prozess des Ableitens von impliziten Fakten aus einer explizit gegebenen Wissensbasis. Der Vorgang des Reasonings stellt vor dem Hintergrund der stetig wachsenden Menge an (semantischen) Informationen zunehmend eine Herausforderung in Bezug auf die notwendigen Ressourcen sowie der Ausführungsgeschwindigkeit dar. Um diesen Herausforderungen zu begegnen, adressiert die vorliegende Arbeit das Reasoning ...
Technischer Report
On CD-systems of stateless deterministic R-automata with window size one
(2010-04-27)
We study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We study the expressive power of these systems by relating the class of languages that they accept by mode =1 computations to other well-studied language ...
Dissertation
Investigation and Elimination of Substructures in Formal Concept Analysis focusing on Boolean Suborders and Subcontexts
(2023)
In the field of Formal Concept Analysis, data is mainly presented in so-called formal contexts, which assign to a set of objects their respective attributes. From those concept lattices can be generated, where the objects are grouped with respect to their common attributes to represent the relationships in the data in a way that enhances the understandability for humans. However, since a concept lattice can be of exponential size compared to its associated formal context, the presented relationships often become hard ...
Technischer Report
CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store
(2011-01-06)
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.
Technischer Report
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
(2008-11-18)
This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS), which both are useful models in computational linguistics. For PCGSs we study two complexity measures called 'generation complexity' and 'distribution complexity', and we prove that a PCGS Pi, for which the generation complexity and the distribution complexity are both bounded by constants, can be transformed into a freely rewriting restarting automaton of a very restricted ...
Technischer Report
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions
(2009-12-10)
We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-system M of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-system M' of restarting automata of the same type as M that, working in the new mode ed, accepts the language that M accepts in mode m. Further, we prove that in mode ed, a locally deterministic CD-system of restarting ...
Dissertation
Symbolic Representation of Dynamic Knowledge for Robotic Teams
(2020-11)
Das Forschungsziel dieser Arbeit ist es, die konzeptionellen Grundlagen für ein Team autonomer Roboter zu entwickeln, welches in der Lage ist, Wissen über seine Umwelt symbolisch darzustellen, über sein symbolisches Wissen zu kommunizieren und mit dem Wissen zu schlussfolgern, während sich die Umgebung dynamisch ändert. Dieses Forschungsziel wird durch mehrere Anwendungsbereiche motiviert, wobei die Domäne der Haushaltsroboter das Forschungsziel am besten motiviert. Wir haben die Anwendungsdomänen und das Forschungsziel ...
Dissertation
Dynamic Injection of Scribble Features into Graphical Diagram Editors
(2015-05-20)
Almost everyone sketches. People use sketches day in and day out in many different and heterogeneous fields, to share their thoughts and clarify ambiguous interpretations, for example. The media used to sketch varies from analog tools like flipcharts to digital tools like smartboards. Whereas analog tools are usually affected by insufficient editing capabilities like cut/copy/paste, digital tools greatly support these scenarios. Digital tools can be grouped into informal and formal tools. Informal tools can be ...