6978 search results - page 133 / 1396 » On Proofs in System P |
162
click to vote
ITP
2010
15 years 8 months ago
2010
Influenced by the success of the MIZAR system many declarative proof languages have been developed in the theorem prover community, as declarative proofs are more readable, easier...
169
click to vote
AIPS
2006
15 years 7 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
195
click to vote
SAT
2009
Springer
16 years 29 days ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
143
click to vote
ISMVL
2000
IEEE
15 years 10 months ago
2000
IEEE
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
153
click to vote
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...