Sciweavers

989 search results - page 60 / 198
» Pebbling and Proofs of Work
Sort
View
ENGL
2007
123views more  ENGL 2007»
13 years 8 months ago
Characterization by Regulated Grammars of Calculations in the Gentzen System G
— The aim of the present work is to present a characterization of the Gentzen System G by means of a regulated grammar, according to the Formal Languages Theory. Given a proposit...
Ruben Monjaraz Hernandez-Imbert, Jose de Jesus Lav...
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
WOLLIC
2009
Springer
14 years 2 months ago
Deep Inference in Bi-intuitionistic Logic
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
Linda Postniece
LICS
2007
IEEE
14 years 2 months ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...
IPPS
1999
IEEE
14 years 16 days ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund