We construct a complete set of reflection functors for the representations ofposets and prove that they really have the usual properties. In particular, when theposet is of finite representation type, all of its indecomposable representations can be obtained from some "trivial" ones via relations. To define such reflection functors, a wider class of matrix problem is introduced, called "representations of bisectedposets".
The combinatorial interest inposets is largely due to two unoriented graphs associated with a givenposet: the comparability graph (which we shall not consider here) and the covering graph.