Conference paper
Discourse segmentation in aid of document summarization
B.K. Boguraev, Mary S. Neff
HICSS 2000
We investigate the existence of various limits and colimits in three categories: CPI (chain-complete posets and isotone maps); CPC (chain-complete posets and chain-continuous maps); CPC* (chain-complete posets and chain-continuous maps). Among other things we show CPC to be complete and cocomplete. By way of contrast we show that LC* (complete lattices and chain-*continuous maps) is neither complete nor cocomplete. We also introduce a construction which yields the chain-completion of a poset and other "completions" as special cases. © 1977.
B.K. Boguraev, Mary S. Neff
HICSS 2000
Thomas M. Cheng
IT Professional
Leo Liberti, James Ostrowski
Journal of Global Optimization
György E. Révész
Theoretical Computer Science