13090 search results - page 2351 / 2618 » Usable artificial intelligence |
197
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
204
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
189
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
161
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
152
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...