123 search results - page 24 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
KI
2010
Springer
13 years 17 days ago
2010
Springer
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
CRYPTO
2007
Springer
13 years 9 months ago
2007
Springer
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
DLOG
2004
13 years 7 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
POPL
2008
ACM
14 years 6 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
NMR
2004
Springer
13 years 11 months ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...