2308 search results - page 348 / 462 » Representing Symbolic Reasoning |
270
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
278
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
193
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
151
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
While the collection of behavioral protocols has been common practice in human-computer interaction research for many years, the analysis of large protocol data sets is often extr...
160
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...