Sciweavers

923 search results - page 65 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
APAL
2004
111views more  APAL 2004»
15 years 6 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
IPL
2000
94views more  IPL 2000»
15 years 6 months ago
On rewrite constraints and context unification
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Joachim Niehren, Sophie Tison, Ralf Treinen
ITA
2000
15 years 6 months ago
On a paper by Castelli, Mignosi, Restivo
Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce...
Jacques Justin
LOGCOM
2000
103views more  LOGCOM 2000»
15 years 6 months ago
A geometric proof of confluence by decreasing diagrams
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
ITA
2002
105views Communications» more  ITA 2002»
15 years 5 months ago
Polypodic codes
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are...
Symeon Bozapalidis, Olympia Louscou-Bozapalidou