Sciweavers

37 search results - page 3 / 8
» Weak Equivalence in Propositional Calculus
Sort
View
ESOP
2000
Springer
15 years 1 months ago
A Calculus for Link-Time Compilation
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
Elena Machkasova, Franklyn A. Turbak
88
Voted
TLCA
2005
Springer
15 years 3 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
77
Voted
CONCUR
1995
Springer
15 years 1 months ago
Bisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
Matthew Hennessy, Julian Rathke
FOCS
1999
IEEE
15 years 1 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
ICALP
1998
Springer
15 years 1 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr