1029 search results - page 51 / 206 » Compact representations of ordered sets |
157
Voted
DEXAW
2003
IEEE
15 years 8 months ago
2003
IEEE
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
130
Voted
FLAIRS
2008
15 years 5 months ago
2008
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
104
Voted
APAL
2008
15 years 2 months ago
2008
We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the th...
130
Voted
WG
2005
Springer
15 years 8 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
103
Voted
ECSQARU
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...