344 search results - page 50 / 69 » The Santa Claus problem |
111
click to vote
TABLEAUX
1995
Springer
15 years 2 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
89
Voted
LREC
2010
15 years 14 days ago
2010
We describe our computer-supported framework to overcome the rule of metadata schism. It combines the use of controlled vocabularies, managed by a data category registry, with a c...
105
Voted
NIPS
2003
15 years 11 days ago
2003
We present a system to recognize phrases based on perceptrons, and a global online learning algorithm to train them together. The recognition strategy applies learning in two laye...
88
Voted
PSSS
2003
15 years 11 days ago
2003
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
102
click to vote
AAAI
2000
15 years 11 days ago
2000
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...