Sciweavers

3235 search results - page 603 / 647
» Partial Redundant Modeling
Sort
View
LICS
1991
IEEE
14 years 1 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
AUSAI
2008
Springer
13 years 12 months ago
Exploiting Ontological Structure for Complex Preference Assembly
When a user is looking for a product recommendation they usually lack expert knowledge regarding the items they are looking for. Ontologies on the other hand are crafted by experts...
Gil Chamiel, Maurice Pagnucco
BIRTHDAY
2008
Springer
13 years 12 months ago
Why Sets?
Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a far-away plane...
Andreas Blass
CCS
2008
ACM
13 years 12 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
COLT
2005
Springer
13 years 12 months ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour