103 search results - page 12 / 21 » Computational Interpretations of Classical Linear Logic |
REX
1991
13 years 10 months ago
1991
We survey logic-based and automata-based languages and techniques for the speci cation and veri cation of real-time systems. In particular, we discuss three syntactic extensions of...
AGP
1995
IEEE
13 years 10 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
IPPS
2002
IEEE
13 years 11 months ago
2002
IEEE
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate detection algorithms for certain temporal logic predicat...
ICALP
2004
Springer
14 years 3 days ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...