- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 41 to 50 of 56 (0.05 seconds)Spelling suggestions: "subject:"begriffsanalyse"" "subject:"begriffsanalysen""
| 41 |
Identifiability in Knowledge Space Theory: a survey of recent resultsDoignon, Jean-Paul 28 May 2013 (has links)
Knowledge Space Theory (KST) links in several ways to Formal Concept Analysis (FCA). Recently, the probabilistic and statistical aspects of KST have been further developed by several authors. We review part of the recent results, and describe some of the open problems. The question of whether the outcomes can be useful in FCA remains to be investigated.
|
| 42 |
Attribute Exploration on the WebJäschke, Robert, Rudolph, Sebastian 28 May 2013 (has links)
We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.
|
| 43 |
Efficient Axiomatization of OWL 2 EL Ontologies from Data by means of Formal Concept Analysis: (Extended Version)Kriegel, Francesco 28 December 2023 (has links)
We present an FCA-based axiomatization method that produces a complete EL TBox (the terminological part of an OWL 2 EL ontology) from a graph dataset in at most
exponential time. We describe technical details that allow for efficient implementation as well as variations that dispense with the computation of extremely large axioms, thereby
rendering the approach applicable albeit some completeness is lost. Moreover, we evaluate the prototype on real-world datasets. / This is an extended version of an article accepted at AAAI 2024.
|
| 44 |
Joining implications in formal contexts and inductive learning in a Horn description logic: Extended VersionKriegel, Francesco 20 June 2022 (has links)
A joining implication is a restricted form of an implication where it is explicitly specified which attributesmay occur in the premise and in the conclusion, respectively. A technique for sound and complete axiomatization of joining implications valid in a given formal context is provided. In particular, a canonical base for the joining implications valid in a given formal context is proposed, which enjoys the property of being of minimal cardinality among all such bases. Background knowledge in form of a set of valid joining implications can be incorporated. Furthermore, an application to inductive learning in a Horn description logic is proposed, that is, a procedure for sound and complete axiomatization of Horn-M concept inclusions from a given interpretation is developed. A complexity analysis shows that this procedure runs in deterministic exponential time.
|
| 45 |
Most specific consequences in the description logic ELKriegel, Francesco 20 June 2022 (has links)
The notion of a most specific consequence with respect to some terminological box is introduced, conditions for its existence in the description logic EL and its variants are provided, and means for its computation are developed. Algebraic properties of most specific consequences are explored. Furthermore, several applications that make use of this new notion are proposed and, in particular, it is shown how given terminological knowledge can be incorporated in existing approaches for the axiomatization of observations. For instance, a procedure for an incremental learning of concept inclusions from sequences of interpretations is developed.
|
| 46 |
Axiomatization of General Concept Inclusions from Finite InterpretationsBorchmann, Daniel, Distel, Felix, Kriegel, Francesco 20 June 2022 (has links)
Description logic knowledge bases can be used to represent knowledge about a particular domain in a formal and unambiguous manner. Their practical relevance has been shown in many research areas, especially in biology and the semantic web. However, the tasks of constructing knowledge bases itself, often performed by human experts, is difficult, time-consuming and expensive. In particular the synthesis of terminological knowledge is a challenge every expert has to face. Because human experts cannot be omitted completely from the construction of knowledge bases, it would therefore be desirable to at least get some support from machines during this process. To this end, we shall investigate in this work an approach which shall allow us to extract terminological knowledge in the form of general concept inclusions from factual data, where the data is given in the form of vertex and edge labeled graphs. As such graphs appear naturally within the scope of the Semantic Web in the form of sets of RDF triples, the presented approach opens up the possibility to extract terminological knowledge from the Linked Open Data Cloud. We shall also present first experimental results showing that our approach has the potential to be useful for practical applications.
|
| 47 |
Dicomplemented Lattices / A Contextual Generalization of Boolean Algebras / Treillis Dicomplementes. Une Generalisation Contextuelle des Algebres de Boole. / Dikomplementaere Verbaende. Eine Kontextuelle Verallgemeinerung Boolescher AlgebrenKwuida, Leonard 23 October 2004 (has links) (PDF)
Das Ziel dieser Arbeit ist es die mathematische Theorie der Begriffsalgebren zu entwickeln. Wir betrachten dabei hauptsaechlich das Repraesentationsproblem dieser vor Kurzem eingefuehrten Strukturen. Motiviert durch die Suche nach einer geeigneten Negation sind die Begriffsalgebren entstanden. Sie sind nicht nur fuer die Philosophie oder die Wissensrepraesentation von Interesse, sondern auch fuer andere Felder, wie zum Beispiel Logik oder Linguistik. Das Problem Negationen geeignet einzufuehren, ist sicher eines der aeltesten der wissenschaftlichen oder philosophischen Gemeinschaft und erregt auch zur Zeit die Aufmerksamkeit vieler Wissenschaftler. Verschiedene Typen von Logik (die sich sehr stark durch die eigefuehrte Negation unterscheiden) unterstreichen die Wichtigkeit dieser Untersuchungen. In dieser Arbeit beschaeftigen wir uns hauptsaechlich mit der kontextuellen Logik, eine Herangehensweise der Formalen Begriffsanalyse, basierend auf der Idee, den Begriff als Einheit des Denkens aufzufassen. / The aim of this investigation is to develop a mathematical theory of concept algebras. We mainly consider the representation problem for this recently introduced class of structures. Motivated by the search of a "negation" on formal concepts, "concept algebras" are of considerable interest not only in Philosophy or Knowledge Representation, but also in other fields as Logic or Linguistics. The problem of negation is surely one of the oldest problems of the scientific and philosophic community, and still attracts the attention of many researchers. Various types of Logic (defined according to the behaviour of the corresponding negation) can attest this affirmation. In this thesis we focus on "Contextual Logic", a Formal Concept Analysis approach, based on concepts as units of thought.
|
| 48 |
Dicomplemented Lattices: A Contextual Generalization of Boolean AlgebrasKwuida, Leonard 29 June 2004 (has links)
Das Ziel dieser Arbeit ist es die mathematische Theorie der Begriffsalgebren zu entwickeln. Wir betrachten dabei hauptsaechlich das Repraesentationsproblem dieser vor Kurzem eingefuehrten Strukturen. Motiviert durch die Suche nach einer geeigneten Negation sind die Begriffsalgebren entstanden. Sie sind nicht nur fuer die Philosophie oder die Wissensrepraesentation von Interesse, sondern auch fuer andere Felder, wie zum Beispiel Logik oder Linguistik. Das Problem Negationen geeignet einzufuehren, ist sicher eines der aeltesten der wissenschaftlichen oder philosophischen Gemeinschaft und erregt auch zur Zeit die Aufmerksamkeit vieler Wissenschaftler. Verschiedene Typen von Logik (die sich sehr stark durch die eigefuehrte Negation unterscheiden) unterstreichen die Wichtigkeit dieser Untersuchungen. In dieser Arbeit beschaeftigen wir uns hauptsaechlich mit der kontextuellen Logik, eine Herangehensweise der Formalen Begriffsanalyse, basierend auf der Idee, den Begriff als Einheit des Denkens aufzufassen. / The aim of this investigation is to develop a mathematical theory of concept algebras. We mainly consider the representation problem for this recently introduced class of structures. Motivated by the search of a "negation" on formal concepts, "concept algebras" are of considerable interest not only in Philosophy or Knowledge Representation, but also in other fields as Logic or Linguistics. The problem of negation is surely one of the oldest problems of the scientific and philosophic community, and still attracts the attention of many researchers. Various types of Logic (defined according to the behaviour of the corresponding negation) can attest this affirmation. In this thesis we focus on "Contextual Logic", a Formal Concept Analysis approach, based on concepts as units of thought.
|
| 49 |
Annotating Lattice Orbifolds with Minimal Acting AutomorphismsSchlemmer, Tobias 10 January 2013 (has links) (PDF)
Context and lattice orbifolds have been discussed by M. Zickwolff, B. Ganter and D. Borchmann. Preordering the folding automorphisms by set inclusion of their orbits gives rise to further development. The minimal elements of this preorder have a prime group order and any group element can be dissolved into the product of group elements whose group order is a prime power. This contribution describes a way to compress an orbifold annotation to sets of such minimal automorphisms. This way a hierarchical annotation is described together with an interpretation of the annotation. Based on this annotation an example is given that illustrates the construction of an automaton for certain pattern matching problems in music processing.
|
| 50 |
Formal Concept Analysis Methods for Description Logics / Formale Begriffsanalyse Methoden für BeschreibungslogikenSertkaya, Baris 09 July 2008 (has links) (PDF)
This work presents mainly two contributions to Description Logics (DLs) research by means of Formal Concept Analysis (FCA) methods: supporting bottom-up construction of DL knowledge bases, and completing DL knowledge bases. Its contribution to FCA research is on the computational complexity of computing generators of closed sets.
|
Page generated in 0.0593 seconds