1941 search results - page 92 / 389 » Reasoning about Computations Using Two-Levels of Logic |
132
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
133
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
119
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
NMR
2004
Springer
15 years 8 months ago
2004
Springer
Unlike most non-monotonic logics Plausible Logic was designed from the very beginning with computer implementation in mind. But one aspect of implementation was neglected, namely ...
120
click to vote
CADE
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...