Sciweavers

409 search results - page 58 / 82
» Semantics for a theory of defeasible reasoning
Sort
View
LPNMR
1990
Springer
13 years 11 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
CSL
2009
Springer
14 years 2 months ago
Enriching an Effect Calculus with Linear Types
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
CSFW
2010
IEEE
13 years 11 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
POPL
2009
ACM
14 years 8 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
ICLP
1998
Springer
13 years 11 months ago
Iterated Logic Program Updates
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
João Alexandre Leite, Luís Moniz Per...