Sciweavers

49 search results - page 8 / 10
» Uniform Heyting arithmetic
Sort
View
PODC
2004
ACM
14 years 23 days ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
ICLP
2001
Springer
13 years 11 months ago
Higher-Precision Groundness Analysis
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
Michael Codish, Samir Genaim, Harald Sønder...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs
An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, met...
Johannes Oetsch, Jörg Pührer, Hans Tompi...
CORR
2006
Springer
71views Education» more  CORR 2006»
13 years 7 months ago
Wreath Products in Stream Cipher Design
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
Vladimir Anashin
JANCL
2007
74views more  JANCL 2007»
13 years 7 months ago
Operations on proofs and labels
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Tatiana Yavorskaya, Natalia Rubtsova