Corrigindo a data: 21/07 (2a-feira) às 09:00 JMarcos
On Thu, Jul 17, 2025 at 2:01 PM Joao Marcos <botoc...@gmail.com> wrote: > > Na próxima 2a-feira, dia 20/07, ocorrerá a defesa de mestrado de João > Mendes Lopes Neto, figurinha bastante atuante na comunidade e já > conhecida de muita gente aqui na lista. Ela ocorrerá a partir das > 09:00 nesta sala: > https://meet.google.com/hhm-gewx-niu > Pessoas interessadas em assistir devem me contactar com antecedência > para que eu possa liberar o acesso à sala (tendo em mãos a informação > sobre o endereço eletrônico que será utilizado no acesso). > > Seguem os dados do trabalho: > > %%% > > "A method for automated generation of proof exercises with comparable > level of complexity" > > The automated generation of exercises may benefit educators by > significantly reducing the time they spend in manually creating > exercises. However, an obstacle in making such automation more present > in an educator’s professional routine is controlling the level of > complexity of mechanically generated exercises. In this work, we > present a method for the automated generation of proof exercises with > comparable levels of complexity. The inputs of this method are a proof > exercise and a set of rules allowing to prove this exercise. The > output is a set of proof exercises with comparable complexity to that > given as input. The scope of exercises we work with are mathematical > proof exercises described in first-order languages, covering topics > such as Set Theory and Number Theory. In order to calculate the level > of complexity of these exercises, we base our approach on the effort > required to solve them via informal proofs. We argue that such an > effort, in turn, may be captured by formal proofs in cut-based > tableaux that do not contain logical symbols. The rules utilized in > these proofs are extracted by a mechanizable procedure we provide. We > use the analytic character of such rules and the formal structure > tableau proofs have to provide a computational procedure of the method > in question. As case studies, we demonstrate how our method works with > fragments of Set Theory and Number Theory. A prototype implementation > of the method was also developed and we present it here. > > Keywords: Automatic Question Generation, Teaching Logic, Cut-based Tableaux > > %%% > > Cumprimentos lógicos, > Joao Marcos > > -- > https://sites.google.com/site/sequiturquodlibet/ -- https://sites.google.com/site/sequiturquodlibet/ -- LOGICA-L Lista acadêmica brasileira dos profissionais e estudantes da área de Lógica <logica-l@dimap.ufrn.br> --- Você está recebendo esta mensagem porque se inscreveu no grupo "LOGICA-L" dos Grupos do Google. Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie um e-mail para logica-l+unsubscr...@dimap.ufrn.br. Para ver esta conversa, acesse https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/CAO6j_LgJTqfHWZqLBZ_u0_z3tGFEv8L5TW68AcTMR3-XCfVLNw%40mail.gmail.com.
