Sciweavers

500 search results - page 1 / 100
» Quantified Conditionals and Compositionality
Sort
View
LLC
2010
12 years 11 months ago
Quantified Conditionals and Compositionality
The interpretation of conditionals in the scope of a quantifier (as in `No student will succeed if he goofs off') presents a troubling puzzle. Either we are forced to abandon...
Janneke Huitink
ESORICS
2006
Springer
13 years 8 months ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...
CADE
2007
Springer
14 years 5 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
ENTCS
2006
214views more  ENTCS 2006»
13 years 4 months ago
A Generalization of ACP Using Belnap's Logic
ACP is combined with Belnap's four-valued logic via conditional composition (if
Alban Ponse, Mark van der Zwaag
IJCAI
2001
13 years 6 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...