4126 search results - page 306 / 826 » Set based logic programming |
158
Voted
CADE
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
147
click to vote
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
142
Voted
DIS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
155
click to vote
CHI
2010
ACM
15 years 10 months ago
2010
ACM
Paper prototyping offers unique affordances for interface design. However, due to its spontaneous nature and the limitations of paper, it is difficult to distill and communicate a...
143
click to vote
JODS
2007
15 years 5 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...