4617 search results - page 306 / 924 » Automation of Diagrammatic Reasoning |
177
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows fo...
152
click to vote
TPHOL
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper outlines a formal model of the Intel IA-64 architecture, and explains how this model can be used to verify the correctness of assembly-level code optimizations. The form...
139
click to vote
CSL
1995
Springer
15 years 10 months ago
1995
Springer
We give an evolving algebra solution for the well-known railroad crossing problem and use the occasion to experiment with agents that perform instantaneous actions in continuous t...
154
Voted
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
We present a game-theoretic model of the polymorphic -calculus, system F, as a fibred category. Every morphism of the model defines an -expanded, -normal form ^ of system F whose...
217
click to vote
LICS
1995
IEEE
15 years 10 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...