Sciweavers

344 search results - page 50 / 69
» The Santa Claus problem
Sort
View
TABLEAUX
1995
Springer
14 years 1 months ago
Constraint Model Elimination and a PTTP-Implementation
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...
Peter Baumgartner, Frieder Stolzenburg
LREC
2010
181views Education» more  LREC 2010»
13 years 11 months ago
A Data Category Registry- and Component-based Metadata Framework
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...
Daan Broeder, Marc Kemps-Snijders, Dieter Van Uytv...
NIPS
2003
13 years 11 months ago
Online Learning via Global Feedback for Phrase Recognition
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...
Xavier Carreras, Lluís Màrquez
PSSS
2003
13 years 11 months ago
Extending Classical Theorem Proving for the Semantic Web
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...
Tanel Tammet
AAAI
2000
13 years 11 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman