Sciweavers

207 search results - page 9 / 42
» Proof Systems and Transformation Games
Sort
View
IACR
2011
112views more  IACR 2011»
13 years 9 months ago
A Domain Transformation for Structure-Preserving Signatures on Group Elements
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
Melissa Chase, Markulf Kohlweiss
ASP
2001
Springer
15 years 2 months ago
Logic Programming Agents and Game Theory
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...
Marina De Vos, Dirk Vermeir
FM
2008
Springer
148views Formal Methods» more  FM 2008»
14 years 11 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
JSYML
2010
65views more  JSYML 2010»
14 years 4 months ago
Formalizing non-standard arguments in second-order arithmetic
In this paper, we introduce the systems ns-ACA0 and ns-WKL0 of non-standard second-order arithmetic in which we can formalize non-standard arguments in ACA0 and WKL0, respectively...
Keita Yokoyama
CG
2004
Springer
14 years 9 months ago
Recursive turtle programs and iterated affine transformations
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
Tao Ju, Scott Schaefer, Ron Goldman