Sciweavers

7988 search results - page 26 / 1598
» A Useful Undecidable Theory
Sort
View
CADE
2010
Springer
13 years 10 months ago
Monotonicity Inference for Higher-Order Formulas
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...
Jasmin Christian Blanchette, Alexander Krauss
GG
2008
Springer
13 years 9 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
DM
2007
103views more  DM 2007»
13 years 8 months ago
On the existence of difference sets in groups of order 96
The correspondence between a (96, 20, 4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets ...
Anka Golemac, Josko Mandic, Tanja Vucicic
FLOPS
2010
Springer
13 years 7 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
FSTTCS
2003
Springer
14 years 2 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh