2962 search results - page 254 / 593 » Reasoning on Association Rules |
188
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
242
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
152
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
The process of planning in complex, multi-actor environment depends strongly on the ability of the individual actors to perform intelligent decommitment upon specific changes in ...
150
click to vote
TARK
2007
Springer
16 years 23 days ago
2007
Springer
A classical result in voting theory, the Gibbard-Satterthwaite Theorem, states that for any non-dictatorial voting rule for choosing between three or more candidates, there will b...
151
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...