12774 search results - page 29 / 2555 » A Framework for Proof Systems |
STACS
2001
Springer
14 years 18 hour ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose to use Grothendieck institutions based on 2categorical diagrams as a basis for heterogeneous specification. We prove a number of results about colimits and (so...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The notion of a bilattice was rst proposed by Ginsberg as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting....
FAC
2008
13 years 7 months ago
2008
A development of the Mondex system was undertaken using Event-B and its associated proof tools. mental approach was used whereby the refinement between the abstract specification o...
TAMC
2010
Springer
14 years 19 days ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...