Sciweavers

888 search results - page 128 / 178
» The Power of Temporal Proofs
Sort
View
ECCC
2008
168views more  ECCC 2008»
14 years 9 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson
JAR
2006
71views more  JAR 2006»
14 years 9 months ago
Mathematical Induction in Otter-Lambda
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...
Michael Beeson
JFP
2007
111views more  JFP 2007»
14 years 9 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
WWW
2009
ACM
15 years 10 months ago
Rethinking email message and people search
We show how a number of novel email search features can be implemented without any kind of natural language processing (NLP) or advanced data mining. Our approach inspects the ema...
Sebastian Michel, Ingmar Weber
POPL
2007
ACM
15 years 10 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty