446 search results - page 60 / 90 » A Theorem Prover for a Computational Logic |
172
click to vote
EATCS
2000
15 years 5 months ago
2000
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
141
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
163
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities P and Q we were able to capture t...
140
click to vote
BIRTHDAY
1991
Springer
15 years 9 months ago
1991
Springer
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
155
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...