2519 search results - page 197 / 504 » Reasoning with Textual Cases |
162
click to vote
UAI
1989
15 years 7 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
150
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...
182
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
164
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
184
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...