12774 search results - page 29 / 2555 » A Framework for Proof Systems |
127
click to vote
STACS
2001
Springer
15 years 8 months 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...
108
click to vote
BIRTHDAY
2006
Springer
15 years 7 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...
126
click to vote
LICS
1994
IEEE
15 years 8 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....
106
click to vote
FAC
2008
15 years 4 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...
121
Voted
TAMC
2010
Springer
15 years 9 months 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...