271 search results - page 11 / 55 » A comparison between two logical formalisms for rewriting |
ENTCS
2006
13 years 7 months ago
2006
We propose a family of models of coordination of distributed object systems representing different views, with refinement relations between the different views. We start with dist...
TYPES
1998
Springer
14 years 2 days ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
PPDP
2005
Springer
14 years 1 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
AIIA
2005
Springer
14 years 1 months ago
2005
Springer
We look at extensions of modal logic for representation and reasoning in the area of multi-agent systems. Building on dynamic logic and Henkin quantifiers, we study an unusual typ...
IPPS
1997
IEEE
14 years 2 days ago
1997
IEEE
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...