654 search results - page 8 / 131 » Ordered Sets and Complete Lattices |
ACS
2004
13 years 7 months ago
2004
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
AML
2006
13 years 7 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
ICFCA
2007
Springer
14 years 1 months ago
2007
Springer
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
EJC
2008
13 years 7 months ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
PADL
2005
Springer
14 years 1 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...