Sciweavers

174 search results - page 18 / 35
» Loop Calculus for Satisfiability
Sort
View
ENTCS
2010
119views more  ENTCS 2010»
14 years 9 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
ENTCS
2006
173views more  ENTCS 2006»
14 years 9 months ago
Formal Security Analysis for Ad-Hoc Networks
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
Sebastian Nanz, Chris Hankin
CSR
2009
Springer
15 years 4 months ago
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...
Arnon Avron, Agata Ciabattoni, Anna Zamansky
CADE
2005
Springer
15 years 3 months ago
KRHyper - In Your Pocket
Abstract. Pocket KRHyper is a reasoning system for Java-enabled mobile devices. The core of the system is a first order theorem prover and model generator based on the hyper table...
Alex Sinner, Thomas Kleemann
TLCA
2001
Springer
15 years 2 months ago
Strong Normalization of Classical Natural Deduction with Disjunction
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
Philippe de Groote