61 search results - page 11 / 13 » What Is the Problem with Proof Nets for Classical Logic |
UAI
2003
13 years 8 months ago
2003
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
COCO
2003
Springer
14 years 18 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
ASIACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
NMR
2004
Springer
14 years 21 days ago
2004
Springer
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting a...