Sciweavers

769 search results - page 24 / 154
» Where Is the Proof
Sort
View
CADE
2003
Springer
14 years 7 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
STACS
1999
Springer
13 years 11 months ago
One-sided Versus Two-sided Error in Probabilistic Computation
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...
Harry Buhrman, Lance Fortnow
JAPLL
2007
86views more  JAPLL 2007»
13 years 7 months ago
Using logical relevance for question answering
We propose a novel method of determining the appropriateness of an answer to a question through a proof of logical relevance rather than a logical proof of truth. We define logic...
Marco De Boni
IPPS
2003
IEEE
14 years 25 days ago
A UNITY-Based Formalism for Dynamic Distributed Systems
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and pro...
Daniel M. Zimmerman
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Cut Elimination for a Logic with Induction and Co-induction
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
Alwen Tiu, Alberto Momigliano