Sciweavers

11 search results - page 2 / 3
» The Basic Theorem on Generalized Concept Lattice
Sort
View
APAL
2004
111views more  APAL 2004»
13 years 10 months ago
Concept lattices and order in fuzzy logic
The theory of concept lattices (i.e. hierarchical structures of concepts in the sense of Port-Royal school) is approached from the point of view of fuzzy logic. The notions of par...
Radim Belohlávek
LPNMR
2004
Springer
14 years 4 months ago
Set Constraints in Logic Programming
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
V. Wiktor Marek, Jeffrey B. Remmel
ICFCA
2009
Springer
14 years 5 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
IANDC
2006
103views more  IANDC 2006»
13 years 11 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
ACTA
2000
82views more  ACTA 2000»
13 years 10 months ago
Semantics analysis through elementary meanings
Thesaurus is a collection of words classified according to some relatedness measures among them. In this paper, we lay the theoretical foundations of thesaurus construction through...
Youichi Kobuchi, Takashi Saito, Hidenobu Nunome