Sciweavers

835 search results - page 55 / 167
» Geometric Logic in Computer Science
Sort
View
LICS
2008
IEEE
14 years 3 months ago
Correctness of Multiplicative Additive Proof Structures is NL-Complete
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
Paulin Jacobé de Naurois, Virgile Mogbil
POPL
2010
ACM
13 years 11 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
TLCA
2007
Springer
14 years 2 months ago
Completing Herbelin's Programme
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...
José Espírito Santo
ENTCS
2006
138views more  ENTCS 2006»
13 years 8 months ago
Model Checking Russian Cards
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
Hans P. van Ditmarsch, Wiebe van der Hoek, Ron van...
KSEM
2010
Springer
13 years 6 months ago
A Formalism for Causal Explanations with an Answer Set Programming Translation
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Yves Moinard