4573 search results - page 541 / 915 » Automated Reasoning |
152
click to vote
LICS
1994
IEEE
15 years 9 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
137
click to vote
TIME
1994
IEEE
15 years 9 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
134
click to vote
TIME
1994
IEEE
15 years 9 months ago
1994
IEEE
This paper outlines a generic, core temporal object model that provides support for the modeling of temporal object roles. This model draws from notions introduced in some of our ...
144
Voted
TPHOL
1994
IEEE
15 years 9 months ago
1994
IEEE
Verification Condition Generator (VCG) tools have been effective in simplifying the task of proving programs correct. However, in the past these VCG tools have in general not thems...
126
click to vote
ALP
1994
Springer
15 years 9 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...