kw.\*:("Teoría demonstración")
Results 1 to 25 of 1558
Selection :
Probabilistically Checkable ProofsSUDAN, Madhu.Communications of the ACM. 2009, Vol 52, Num 3, pp 76-84, issn 0001-0782, 9 p.Article
Formal Mathematics for MathematiciansTRYBULEC, Andrzej; KORNILOWICZ, Artur; NAUMOWICZ, Adam et al.Journal of automated reasoning. 2013, Vol 50, Num 2, issn 0168-7433, 125 p.Serial Issue
Satisfiability Modulo Theories: Introduction and ApplicationsDE MOURA, Leonardo; BJØRNER, Nikolaj.Communications of the ACM. 2011, Vol 54, Num 9, pp 69-77, issn 0001-0782, 9 p.Article
Structured calculational proofBACK, R; GRUNDY, J; VON WRIGHT, J et al.Formal aspects of computing. 1997, Vol 9, Num 5-6, pp 469-483, issn 0934-5043Article
Generalization in type theory based proof assistantsPONS, Olivier.Lecture notes in computer science. 2002, pp 217-232, issn 0302-9743, isbn 3-540-43287-6Conference Paper
An inductive version of Nash-Williams' minimal-bad-sequence argument for Higman's lemmaSEISENBERGER, Monika.Lecture notes in computer science. 2002, pp 233-242, issn 0302-9743, isbn 3-540-43287-6Conference Paper
Focussing proof-net construction as a middleware paradigmANDREOLI, Jean Marc.Lecture notes in computer science. 2002, pp 501-516, issn 0302-9743, isbn 3-540-43931-5, 16 p.Conference Paper
Quadratic correctness criterion for non-commutative LogicMOGBIL, Virgile.Lecture notes in computer science. 2001, pp 69-83, issn 0302-9743, isbn 3-540-42554-3Conference Paper
Informal rigor and mathematical understandingROBINSON, J. A.Lecture notes in computer science. 1997, pp 54-64, issn 0302-9743, isbn 3-540-63385-5Conference Paper
Zero-KnowledgeCREPEAU, Claude.Journal of cryptology. 1996, Vol 9, Num 3, pp 127-195, issn 0933-2790Serial Issue
A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithmGOLDREICH, O; KUSHILEVITZ, E.Journal of cryptology. 1993, Vol 6, Num 2, pp 97-116, issn 0933-2790Article
On the communication complexity of zero-knowledge proofsBOYAR, J; LUND, C; PERALTA, R et al.Journal of cryptology. 1993, Vol 6, Num 2, pp 65-85, issn 0933-2790Article
Resolution, inverse method and the sequent calculusTAMMET, T.Lecture notes in computer science. 1997, pp 65-83, issn 0302-9743, isbn 3-540-63385-5Conference Paper
Relativisation provides natural separations for resolution-based proof systemsDANTCHEV, Stefan.Lecture notes in computer science. 2006, pp 147-158, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 12 p.Conference Paper
Competitive semantic tree theorem prover with resolutionsCHOON KYU KIM; NEWBORN, Monty.Lecture notes in computer science. 2003, pp 227-231, issn 0302-9743, isbn 3-540-20149-1, 5 p.Conference Paper
On generalizations of semi-terms of particularly simple formBAAZ, Matthias; MOSER, Georg.Lecture notes in computer science. 2002, pp 382-396, issn 0302-9743, isbn 3-540-44240-5, 15 p.Conference Paper
P.rex : An interactive proof explainerFIEDLER, Armin.Lecture notes in computer science. 2001, pp 416-420, issn 0302-9743, isbn 3-540-42254-4Conference Paper
Keeping the SZK-verifier honest unconditionallyDI CRESCENZO, G; OKAMOTO, T; YUNG, M et al.Lecture notes in computer science. 1997, pp 31-45, issn 0302-9743, isbn 3-540-63384-7Conference Paper
Propositional quantification for conditional logicBESNARD, P; GUINNEBAULT, J.-M; MAYER, E et al.Lecture notes in computer science. 1997, pp 183-197, issn 0302-9743, isbn 3-540-63095-3Conference Paper
Example verifications using alphabet axiomsKORVER, H; SELLINK, A.Formal aspects of computing. 1998, Vol 10, Num 1, pp 43-58, issn 0934-5043Article
Explaining Gentzen's consistency proof within infinitary proof theoryBUCHHOLZ, W.Lecture notes in computer science. 1997, pp 4-17, issn 0302-9743, isbn 3-540-63385-5Conference Paper
Fast cut-elimination by projectionBAAZ, M; LEITSCH, A.Lecture notes in computer science. 1997, pp 18-33, issn 0302-9743, isbn 3-540-63172-0Conference Paper
The seventeen provers of the worldWiedijk, Freek.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-30704-4, 1Vol, XVI-157 p, isbn 3-540-30704-4Book
System description : GCLCprover geothmsJANICIC, Predrag; QUARESMA, Pedro.Lecture notes in computer science. 2006, pp 145-150, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 6 p.Conference Paper
Using the TPTP language for writing derivations and finite interpretationsSUTCLIFFE, Geoff; SCHULZ, Stephan; CLAESSEN, Koen et al.Lecture notes in computer science. 2006, pp 67-81, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 15 p.Conference Paper