Sciweavers

1128 search results - page 84 / 226
» Little Engines of Proof
Sort
View
AMAST
2006
Springer
15 years 1 months ago
A Compositional Semantics of Plan Revision in Intelligent Agents
This paper revolves around the so-called plan revision rules of the agent programming language 3APL. These rules can be viewed as a generalization of procedures. This generalizatio...
M. Birna van Riemsdijk, John-Jules Ch. Meyer
FOSSACS
2006
Springer
15 years 1 months ago
On Metric Temporal Logic and Faulty Turing Machines
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
Joël Ouaknine, James Worrell
FSTTCS
1991
Springer
15 years 1 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
FSTTCS
1994
Springer
15 years 1 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
87
Voted
AMAST
2008
Springer
14 years 11 months ago
Explaining Verification Conditions
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
Ewen Denney, Bernd Fischer 0002