4817 search results - page 685 / 964 » Learning Models of Intelligent Agents |
176
Voted
AAAI
2004
15 years 7 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
144
click to vote
AAAI
2006
15 years 7 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
166
Voted
AAAI
2006
15 years 7 months ago
2006
We present a new propagator achieving bound consistency for the INTER-DISTANCE constraint. This constraint ensures that, among a set of variables X1, . . . , Xn, the difference be...
160
Voted
AAAI
2000
15 years 7 months ago
2000
There are a number of frameworks for modelling argumentation in logic. They incorporate formal representation of individual arguments and techniques for comparing conflicting argu...
147
Voted
AAAI
2000
15 years 7 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...