Spelling suggestions: "subject:"begriffs""
1 |
Dicomplemented lattices a contextual generalization of Boolean algebras /Kwuida, Leonard. January 2004 (has links) (PDF)
Dresden, Techn. Univ., Diss., 2004. / Computerdatei im Fernzugriff.
|
2 |
Computing and visualizing concept latticesYevtushenko, Serhiy. January 2004 (has links) (PDF)
Darmstadt, Techn. University, Diss., 2004.
|
3 |
Dicomplemented lattices a contextual generalization of Boolean algebras /Kwuida, Léonard. Unknown Date (has links) (PDF)
Techn. University, Diss., 2004--Dresden.
|
4 |
Relational exploration combining description logics and formal concept analysis for knowledge specification /Rudolph, Sebastian. January 2007 (has links)
Techn. University, Diss., 2006--Dresden.
|
5 |
Lokalisierung von Merkmalen in SoftwaresystemenSimon, Daniel January 2005 (has links)
Zugl.: Stuttgart, Univ., Diss., 2005
|
6 |
BASE ein begriffsbasiertes Analyseverfahren für die Software-Entwicklung /Düwel, Stephan. Unknown Date (has links)
Universiẗat, FB Mathematik und Informatik, Diss., 2000--Marburg.
|
7 |
Optimization of variability in software product lines a semi-automatic method for visualization, analysis, and restructuring of variability in software product linesLösch, Felix January 2008 (has links)
Zugl.: Stuttgart, Univ., Diss., 2008
|
8 |
Unterstützung der Modellierung verfahrenstechnischer Prozesse durch Nicht-Standardinferenzen in BeschreibungslogikenMolitor, Ralf. Unknown Date (has links) (PDF)
Techn. Hochsch., Diss., 2000--Aachen.
|
9 |
Relational Exploration / Combining Description Logics and Formal Concept Analysis for Knowledge SpecificationRudolph, Sebastian 28 February 2007 (has links) (PDF)
Facing the growing amount of information in today's society, the task of specifying human knowledge in a way that can be unambiguously processed by computers becomes more and more important. Two acknowledged fields in this evolving scientific area of Knowledge Representation are Description Logics (DL) and Formal Concept Analysis (FCA). While DL concentrates on characterizing domains via logical statements and inferring knowledge from these characterizations, FCA builds conceptual hierarchies on the basis of present data. This work introduces Relational Exploration, a method for acquiring complete relational knowledge about a domain of interest by successively consulting a domain expert without ever asking redundant questions. This is achieved by combining DL and FCA: DL formalisms are used for defining FCA attributes while FCA exploration techniques are deployed to obtain or refine DL knowledge specifications.
|
10 |
A Connection Between Clone Theory and FCA Provided by Duality TheoryKerkhoff, Sebastian 02 August 2012 (has links) (PDF)
The aim of this paper is to show how Formal Concept Analysis can be used for the bene t of clone theory. More precisely, we show how a recently developed duality theory for clones can be used to dualize clones over bounded lattices into the framework of Formal Concept Analysis, where they can be investigated with techniques very di erent from those that universal algebraists are usually armed with. We also illustrate this approach with some small examples.
|
Page generated in 0.0383 seconds