887 search results - page 71 / 178 » A Science of Reasoning |
82
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
118
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
106
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
112
Voted
GI
2009
Springer
14 years 10 months ago
2009
Springer
: Static analysis techniques for consistency checking of workflows allow to avoid runtime errors. This is in particular crucial for long running workflows where errors, detected la...
203
Voted
TDSC
2011
14 years 7 months ago
2011
—Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client’s IP address from the server. The success of...