{"id":1618,"date":"2011-10-13T06:38:08","date_gmt":"2011-10-13T06:38:08","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/lecturas-del-grupo-de-logica-computacional-septiembre-de-2011\/"},"modified":"2013-04-03T14:56:13","modified_gmt":"2013-04-03T14:56:13","slug":"lecturas-del-grupo-de-logica-computacional-septiembre-de-2011","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/lecturas-del-grupo-de-logica-computacional-septiembre-de-2011\/","title":{"rendered":"Lecturas del Grupo de L\u00f3gica Computacional (Septiembre de 2011)"},"content":{"rendered":"

Esta entrada es una recopilaci\u00f3n de lecturas compartidas en la lista de correo del grupo de l\u00f3gica computacional<\/a>. La recopilaci\u00f3n est\u00e1 ordenada por la fecha de su publicaci\u00f3n en la lista. Al final de cada art\u00edculo se encuentra etiquetas relativas a los sistemas que usa o a su contenido.<\/p>\n

    \n
  1. \n Formalization of Abstract State Transition Systems for SAT<\/a>. #Isabelle\n<\/li>\n
  2. \n Zeno: A tool for the automatic verification of algebraic properties of functional programs<\/a> #Isabelle #Haskell\n<\/li>\n
  3. \n Automating Induction with an SMT Solver<\/a>. #SMT #Z3\n<\/li>\n
  4. \n Artificial Intelligence Techniques for Understanding Gothic Cathedrals<\/a> #Prolog\n<\/li>\n
  5. \n RDFS\/OWL reasoning using the MapReduce framework<\/a>. #DL #SW\n<\/li>\n
  6. \n Automatic Proof and Disproof in Isabelle\/HOL<\/a>. #Isabelle\n<\/li>\n
  7. \n Proof Pearl: Mechanizing the Textbook Proof of Huffman\u2019s Algorithm<\/a>. #Isabelle\n<\/li>\n
  8. \n Isabelle Primer for Mathematicians<\/a>. #Isabelle\n<\/li>\n
  9. \n Majority Vote Algorithm Revisited Again<\/a> #Isabelle\n<\/li>\n
  10. \nA survey on Interactive Theorem Proving<\/a> #Survey #ITP\n<\/li>\n
  11. \nFormalization of Wu\u2019s simple method in Coq<\/a>. #Coq\n<\/li>\n
  12. \nFunctional Programming for Java Developers<\/a>. #PF #Tutorial\n<\/li>\n
  13. \nFormal Verification for Numerical Methods<\/a>. #Tesis #Coq\n<\/li>\n
  14. \nPractical Semantic Web and Linked Data Applications. Lisp Edition<\/a>. #SW #Lisp\n<\/li>\n
  15. \nBasics of Coq<\/a>. #Coq #Tutorial\n<\/li>\n
  16. \nCoq in a Hurry<\/a>. #Coq #Tutorial\n<\/li>\n
  17. \nReasoning Processes in Propositional Logic<\/a>.\n<\/li>\n
  18. \nProgramaci\u00f3n Funcional con Haskell<\/a>. #Haskell\n<\/li>\n
  19. \nEjercicios de programaci\u00f3n funcional con Haskell<\/a>. #Haskell\n<\/li>\n
  20. \nIntroducci\u00f3n a la programaci\u00f3n l\u00f3gica con Prolog<\/a>. #Prolog\n<\/li>\n
  21. \nEjercicios de programaci\u00f3n declarativa con Prolog<\/a>. #Prolog\n<\/li>\n
  22. \nVerification of the OWL-Time Ontology<\/a>. #Prover9 #Ontolog\u00eda\n<\/li>\n
  23. \nProof Pearl: A Formal Proof of Higman\u2019s Lemma in ACL2<\/a>. #ACL2\n<\/li>\n
  24. \nApprendre Haskell vous fera le plus grand bien!<\/a>. #Haskell\n<\/li>\n
  25. \nImplementation of Bourbaki’s Elements of Mathematics in Coq: Part One, Theory of Sets<\/a>. #Coq\n<\/li>\n
  26. \nDefining and using deductive systems with Isabelle<\/a>. #Isabelle\n<\/li>\n
  27. \nSome Applications of Propositional Logic to Cellular Automata<\/a>.\n<\/li>\n
  28. \nImplementation of Bourbaki’s Elements of Mathematics in Coq: Part Two; Ordered Sets, Cardinals, Integers<\/a>. #Coq\n<\/li>\n
  29. \nHow Kenzo program works<\/a>.\n<\/li>\n<\/ol>\n

    En Mendeley tambi\u00e9n se encuentran las lecturas del Grupo de L\u00f3gica Computacional<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"

    Esta entrada es una recopilaci\u00f3n de lecturas compartidas en la lista de correo del grupo de l\u00f3gica computacional. La recopilaci\u00f3n est\u00e1 ordenada por la fecha de su publicaci\u00f3n en la lista. Al final de cada art\u00edculo se encuentra etiquetas relativas a los sistemas que usa o a su contenido. Formalization of Abstract State Transition Systems…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[177],"tags":[178,292],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_likes_enabled":false,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/1618"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/comments?post=1618"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/1618\/revisions"}],"predecessor-version":[{"id":3175,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/1618\/revisions\/3175"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=1618"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=1618"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=1618"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}